skip to content
Fundamentals of Computation Theory : 11th International Symposium, FCT'97 Kraków, Poland, September 1 3, 1997 Proceedings. Preview this item
ClosePreview this item
Checking...

Fundamentals of Computation Theory : 11th International Symposium, FCT'97 Kraków, Poland, September 1 3, 1997 Proceedings.

Author: Bogdan S Chlebus; Ludwik Czaja
Publisher: Berlin ; Heidelberg : Springer-Verlag, 1997.
Series: Lecture notes in computer science, 1279
Edition/Format:   eBook : Document : EnglishView all editions and formats
Summary:
This book constitutes the refereed proceedings of the 11th International Symposium on Fundamentals of Computer Theory, FCT'97, held in Krakow, Poland, in September 1997. The 34 revised full papers presented in the volume were selected from a total of 72 submissions. Also included are six invited papers by leading scientists. The papers address a variety of current topics in theoretical computer science including  Read more...
Rating:

(not yet rated) 0 with reviews - Be the first.

Subjects
More like this

Find a copy online

Find a copy in the library

&AllPage.SpinnerRetrieving; Finding libraries that hold this item...

Details

Genre/Form: Electronic books
Conference papers and proceedings
Congresses
Additional Physical Format: Printed edition:
Material Type: Document, Internet resource
Document Type: Internet Resource, Computer File
All Authors / Contributors: Bogdan S Chlebus; Ludwik Czaja
ISBN: 9783540695295 354069529X
OCLC Number: 769770915
Description: 1 online resource.
Contents: The complexity class? p 2 : Recent results and applications in AI and modal logic --
Proof systems for structured algebraic specifications: An overview --
Average-case analysis via incompressibility --
Locally computable enumerations --
The complexity of error-correcting codes --
Stochastic analysis of dynamic processes --
k-k Sorting on the multi-mesh --
Refinement of coloured petri nets --
Stratified petri nets --
Distributed acyclic orientation of asynchronous anonymous networks --
Generalized rational relations and their logical definability --
A note on broadcasting with linearly bounded transmission faults in constant degree networks --
Logics which capture complexity classes over the reals --
Criteria to disprove context-freeness of collage languages --
The subword complexity of fixed points of binary uniform morphisms --
Efficient parallel computing with memory faults --
Bounded concurrency --
Concerning the time bounds of existing shortest watchman route algorithms --
Query order in the polynomial hierarchy --
Polynomial time machines equipped with word problems over algebraic structures as their acceptance criteria --
Pattern-matching problems for 2-dimensional images described by finite automata --
The complexity of the coverability, the containment, and the equivalence problems for commutative semigroups --
Contextual grammars with distributed catenation and shuffle --
A two-dimensional hierarchy for attributed tree transducers --
Synchronization of 1-way connected processors --
A linear-time heuristic for minimum rectangular coverings (Extended abstract) --
On occurrence net semantics for petri nets with contacts --
Cellular automata universality revisited --
Trade-off results for connection management --
On the average complexity of the membership problem for a generalized Dyck language --
Towards optimal locality in mesh-indexings --
On the hierarchy of nondeterministic branching k-programs --
FDT is undecidable for finitely presented monoids with solvable word problems --
The equivalence of pebbles and sensing heads for finite automata --
From finite automata toward hybrid systems (Extended abstract) --
On an optimal quantified propositional proof system nal proof system and a complete language for NP? co-NP for NP? co-NP --
Lower bounds in on-line geometric searching metric searching --
The complexity of universal text-learners --
Unique normal forms for nonlinear term rewriting systems: Root overlaps --
Behavioural characterizations of partial order logics.
Series Title: Lecture notes in computer science, 1279

Abstract:

This book constitutes the refereed proceedings of the 11th International Symposium on Fundamentals of Computer Theory, FCT'97, held in Krakow, Poland, in September 1997. The 34 revised full papers presented in the volume were selected from a total of 72 submissions. Also included are six invited papers by leading scientists. The papers address a variety of current topics in theoretical computer science including models of computation, concurrency, algorithms, complexity theory, programming theory, formal languages, graph theory and discrete mathematics, networking, automata theory, term rewriting, etc.

Reviews

User-contributed reviews
Retrieving GoodReads reviews...
Retrieving DOGObooks reviews...

Tags

Be the first.
Confirm this request

You may have already requested this item. Please select Ok if you would like to proceed with this request anyway.

Linked Data


Primary Entity

<http://www.worldcat.org/oclc/769770915> # Fundamentals of Computation Theory : 11th International Symposium, FCT'97 Kraków, Poland, September 1 3, 1997 Proceedings.
    a schema:MediaObject, schema:CreativeWork, schema:Book ;
    library:oclcnum "769770915" ;
    library:placeOfPublication <http://experiment.worldcat.org/entity/work/data/1068340416#Place/heidelberg> ; # Heidelberg
    library:placeOfPublication <http://experiment.worldcat.org/entity/work/data/1068340416#Place/berlin> ; # Berlin
    library:placeOfPublication <http://id.loc.gov/vocabulary/countries/gw> ;
    schema:about <http://id.worldcat.org/fast/973149> ; # Information theory
    schema:about <http://dewey.info/class/004/e21/> ;
    schema:about <http://experiment.worldcat.org/entity/work/data/1068340416#Topic/engineering_&_applied_sciences> ; # Engineering & Applied Sciences
    schema:about <http://experiment.worldcat.org/entity/work/data/1068340416#Topic/computer_science> ; # Computer Science
    schema:about <http://id.worldcat.org/fast/871991> ; # Computational complexity
    schema:about <http://id.worldcat.org/fast/872119> ; # Computer graphics
    schema:about <http://id.worldcat.org/fast/872451> ; # Computer science
    schema:about <http://id.worldcat.org/fast/887978> ; # Data structures (Computer science)
    schema:bookFormat schema:EBook ;
    schema:contributor <http://viaf.org/viaf/6679968> ; # Ludwik Czaja
    schema:creator <http://viaf.org/viaf/54844471> ; # Bogdan S. Chlebus
    schema:datePublished "1997" ;
    schema:description "The complexity class? p 2 : Recent results and applications in AI and modal logic -- Proof systems for structured algebraic specifications: An overview -- Average-case analysis via incompressibility -- Locally computable enumerations -- The complexity of error-correcting codes -- Stochastic analysis of dynamic processes -- k-k Sorting on the multi-mesh -- Refinement of coloured petri nets -- Stratified petri nets -- Distributed acyclic orientation of asynchronous anonymous networks -- Generalized rational relations and their logical definability -- A note on broadcasting with linearly bounded transmission faults in constant degree networks -- Logics which capture complexity classes over the reals -- Criteria to disprove context-freeness of collage languages -- The subword complexity of fixed points of binary uniform morphisms -- Efficient parallel computing with memory faults -- Bounded concurrency -- Concerning the time bounds of existing shortest watchman route algorithms -- Query order in the polynomial hierarchy -- Polynomial time machines equipped with word problems over algebraic structures as their acceptance criteria -- Pattern-matching problems for 2-dimensional images described by finite automata -- The complexity of the coverability, the containment, and the equivalence problems for commutative semigroups -- Contextual grammars with distributed catenation and shuffle -- A two-dimensional hierarchy for attributed tree transducers -- Synchronization of 1-way connected processors -- A linear-time heuristic for minimum rectangular coverings (Extended abstract) -- On occurrence net semantics for petri nets with contacts -- Cellular automata universality revisited -- Trade-off results for connection management -- On the average complexity of the membership problem for a generalized Dyck language -- Towards optimal locality in mesh-indexings -- On the hierarchy of nondeterministic branching k-programs -- FDT is undecidable for finitely presented monoids with solvable word problems -- The equivalence of pebbles and sensing heads for finite automata -- From finite automata toward hybrid systems (Extended abstract) -- On an optimal quantified propositional proof system nal proof system and a complete language for NP? co-NP for NP? co-NP -- Lower bounds in on-line geometric searching metric searching -- The complexity of universal text-learners -- Unique normal forms for nonlinear term rewriting systems: Root overlaps -- Behavioural characterizations of partial order logics."@en ;
    schema:description "This book constitutes the refereed proceedings of the 11th International Symposium on Fundamentals of Computer Theory, FCT'97, held in Krakow, Poland, in September 1997. The 34 revised full papers presented in the volume were selected from a total of 72 submissions. Also included are six invited papers by leading scientists. The papers address a variety of current topics in theoretical computer science including models of computation, concurrency, algorithms, complexity theory, programming theory, formal languages, graph theory and discrete mathematics, networking, automata theory, term rewriting, etc."@en ;
    schema:exampleOfWork <http://worldcat.org/entity/work/id/1068340416> ;
    schema:genre "Conference papers and proceedings"@en ;
    schema:genre "Electronic books"@en ;
    schema:inLanguage "en" ;
    schema:isPartOf <http://worldcat.org/issn/0302-9743> ; # Lecture notes in computer science ;
    schema:isSimilarTo <http://worldcat.org/entity/work/data/1068340416#CreativeWork/> ;
    schema:name "Fundamentals of Computation Theory : 11th International Symposium, FCT'97 Kraków, Poland, September 1 3, 1997 Proceedings."@en ;
    schema:productID "769770915" ;
    schema:publication <http://www.worldcat.org/title/-/oclc/769770915#PublicationEvent/berlin_heidelberg_springer_verlag_1997> ;
    schema:publisher <http://experiment.worldcat.org/entity/work/data/1068340416#Agent/springer_verlag> ; # Springer-Verlag
    schema:url <http://link.springer.com/10.1007/BFb0036167> ;
    schema:url <http://dx.doi.org/10.1007/BFb0036167> ;
    schema:workExample <http://dx.doi.org/10.1007/BFb0036167> ;
    schema:workExample <http://worldcat.org/isbn/9783540695295> ;
    wdrs:describedby <http://www.worldcat.org/title/-/oclc/769770915> ;
    .


Related Entities

<http://experiment.worldcat.org/entity/work/data/1068340416#Agent/springer_verlag> # Springer-Verlag
    a bgn:Agent ;
    schema:name "Springer-Verlag" ;
    .

<http://experiment.worldcat.org/entity/work/data/1068340416#Topic/engineering_&_applied_sciences> # Engineering & Applied Sciences
    a schema:Intangible ;
    schema:name "Engineering & Applied Sciences"@en ;
    .

<http://id.worldcat.org/fast/871991> # Computational complexity
    a schema:Intangible ;
    schema:name "Computational complexity"@en ;
    .

<http://id.worldcat.org/fast/872119> # Computer graphics
    a schema:Intangible ;
    schema:name "Computer graphics"@en ;
    .

<http://id.worldcat.org/fast/872451> # Computer science
    a schema:Intangible ;
    schema:name "Computer science"@en ;
    .

<http://id.worldcat.org/fast/887978> # Data structures (Computer science)
    a schema:Intangible ;
    schema:name "Data structures (Computer science)"@en ;
    .

<http://id.worldcat.org/fast/973149> # Information theory
    a schema:Intangible ;
    schema:name "Information theory"@en ;
    .

<http://viaf.org/viaf/54844471> # Bogdan S. Chlebus
    a schema:Person ;
    schema:familyName "Chlebus" ;
    schema:givenName "Bogdan S." ;
    schema:name "Bogdan S. Chlebus" ;
    .

<http://viaf.org/viaf/6679968> # Ludwik Czaja
    a schema:Person ;
    schema:familyName "Czaja" ;
    schema:givenName "Ludwik" ;
    schema:name "Ludwik Czaja" ;
    .

<http://worldcat.org/entity/work/data/1068340416#CreativeWork/>
    a schema:CreativeWork ;
    schema:description "Printed edition:" ;
    schema:isSimilarTo <http://www.worldcat.org/oclc/769770915> ; # Fundamentals of Computation Theory : 11th International Symposium, FCT'97 Kraków, Poland, September 1 3, 1997 Proceedings.
    .

<http://worldcat.org/isbn/9783540695295>
    a schema:ProductModel ;
    schema:isbn "354069529X" ;
    schema:isbn "9783540695295" ;
    .

<http://worldcat.org/issn/0302-9743> # Lecture notes in computer science ;
    a bgn:PublicationSeries ;
    schema:hasPart <http://www.worldcat.org/oclc/769770915> ; # Fundamentals of Computation Theory : 11th International Symposium, FCT'97 Kraków, Poland, September 1 3, 1997 Proceedings.
    schema:issn "0302-9743" ;
    schema:name "Lecture notes in computer science ;" ;
    schema:name "Lecture Notes in Computer Science ;" ;
    .

<http://www.worldcat.org/title/-/oclc/769770915>
    a genont:InformationResource, genont:ContentTypeGenericResource ;
    schema:about <http://www.worldcat.org/oclc/769770915> ; # Fundamentals of Computation Theory : 11th International Symposium, FCT'97 Kraków, Poland, September 1 3, 1997 Proceedings.
    schema:dateModified "2018-10-26" ;
    void:inDataset <http://purl.oclc.org/dataset/WorldCat> ;
    .


Content-negotiable representations

Close Window

Please sign in to WorldCat 

Don't have an account? You can easily create a free account.