skip to content
Fundamentals of computation theory : proceedings of the 1981 International FCT-Conference, Szeged, Hungary, August 24-28, 1981 Preview this item
ClosePreview this item
Checking...

Fundamentals of computation theory : proceedings of the 1981 International FCT-Conference, Szeged, Hungary, August 24-28, 1981

Author: Ferenc Gécseg; József Attila Tudományegyetem. Institute of Mathematics (Szeged)
Publisher: Berlin : Springer, 1981.
Series: Lecture notes in computer science, 117.
Edition/Format:   eBook : Document : Conference publication : EnglishView all editions and formats
Rating:

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

Subjects
More like this

Find a copy online

Links to this item

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: Fundamentals of computation theory
(NL-LeOCL)810869322
(OCoLC)7741455
Material Type: Conference publication, Document, Internet resource
Document Type: Internet Resource, Computer File
All Authors / Contributors: Ferenc Gécseg; József Attila Tudományegyetem. Institute of Mathematics (Szeged)
ISBN: 3540108548 9783540108542 9783540387657 354038765X
OCLC Number: 150394082
Notes: " ... org. by the Institute of Mathematics of the József Attila University (Szeged) in co-op. with the Computer and Automation Institute of the Hungarian Academy of Sciences."--Preface.
Description: 1 online resource (x, 471 pages) : illustrations
Contents: Observability and Nerode equivalence in concrete categories --
Some universal algebraic and model theoretic results in computer science --
Probabilistic analysis of the performance of greedy strategies over different classes of combinatorial problems --
Moderately exponential bound for graph isomorphism --
An algebraic definition of attributed transformations --
Analogies of PAL and COPY --
Quasi-equational logic for partial algeras --
Homogeneity and completeness --
On the error correcting power of pluralism in inductive inference --
Equality languages and language families --
Extremal combinatorial problems in relational data base --
Specifying algebraic data types by domain equations --
An axiomatization of regular forests in the language of algebraic theories with iteration --
Fast recognition of rings and lattices --
A definition of the P = NP-problem in categories --
Generating graph languages using hypergraph grammars --
Lower bounds for problems defined by polynomial inequalities --
What is computable for abstract data types? --
On strongly cube-free?-words generated by binary morphisms --
On the role of selectors in selective substitution grammars --
Classes of functions over binary trees --
Mathematical structures underlying greedy algorithms --
Some properties of language families generated by commutative languages --
Isomorphism completeness for some algebraic structures --
Reducing algebraic tree grammars --
Rational cone and substitution --
On the regularity problem of SF-languages generated by minimal linear grammars --
Co-algebras as machines for the interpretations of flow diagrams --
Random access machines and straight-line programs --
On the LBA problem --
Dynamic algebras of programs --
The equivalence problem for LL- and LR-regular grammars --
Context-free languages of infinite words as least fixpoints --
Remarks on the notion of concurrency relation in the case of systems --
On the size of conjunctive representations of n-ary relations --
On subwords of formal languages --
First order dynamic logic with decidable proofs and workable model theory --
Elimination of second-order quantifiers for well-founded trees in stationary logic and finitely determinate structures --
Processes in Petri nets --
Some algebraic aspects of recognizability and rationality --
Pebbling and bandwidth --
On cellular graph-automata and second-order definable graph-properties --
Extensions of symmetric hom-functors to the Kleisli category --
A new operation between languages --
Logical description of computation processes --
An algorithm to identify slices, with applications to vector replacement systems --
One pebble does not suffice to search plane labyrinths --
About the by codings of environments induced posets [æ z,?] and [?z,?] --
The complexity of automata and subtheories of monadic second order arithmetics --
Tape complexity of word problems.
Series Title: Lecture notes in computer science, 117.
Responsibility: ed. by Ferenc Gécseg.

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/150394082> # Fundamentals of computation theory : proceedings of the 1981 International FCT-Conference, Szeged, Hungary, August 24-28, 1981
    a schema:MediaObject, schema:CreativeWork, schema:Book ;
    library:oclcnum "150394082" ;
    library:placeOfPublication <http://id.loc.gov/vocabulary/countries/gw> ;
    library:placeOfPublication <http://experiment.worldcat.org/entity/work/data/892425260#Place/berlin> ; # Berlin
    schema:about <http://experiment.worldcat.org/entity/work/data/892425260#Topic/machine_theory> ; # Machine theory
    schema:about <http://id.worldcat.org/fast/871991> ; # Computational complexity
    schema:about <http://dewey.info/class/004.0151/e23/> ;
    schema:about <http://id.worldcat.org/fast/1004846> ; # Machine theory
    schema:about <http://experiment.worldcat.org/entity/work/data/892425260#Topic/computational_complexity> ; # Computational complexity
    schema:bookFormat schema:EBook ;
    schema:contributor <http://viaf.org/viaf/150826734> ; # József Attila Tudományegyetem. Institute of Mathematics (Szeged)
    schema:contributor <http://experiment.worldcat.org/entity/work/data/892425260#Meeting/international_conference_on_fundamentals_of_computation_theory_fct_3_24_08_1981_28_08_1981_szeged_hungary> ; # International Conference on Fundamentals of Computation Theory, FCT (3 : 24-08-1981 - 28-08-1981 : Szeged, Hungary)
    schema:datePublished "1981" ;
    schema:description "Observability and Nerode equivalence in concrete categories -- Some universal algebraic and model theoretic results in computer science -- Probabilistic analysis of the performance of greedy strategies over different classes of combinatorial problems -- Moderately exponential bound for graph isomorphism -- An algebraic definition of attributed transformations -- Analogies of PAL and COPY -- Quasi-equational logic for partial algeras -- Homogeneity and completeness -- On the error correcting power of pluralism in inductive inference -- Equality languages and language families -- Extremal combinatorial problems in relational data base -- Specifying algebraic data types by domain equations -- An axiomatization of regular forests in the language of algebraic theories with iteration -- Fast recognition of rings and lattices -- A definition of the P = NP-problem in categories -- Generating graph languages using hypergraph grammars -- Lower bounds for problems defined by polynomial inequalities -- What is computable for abstract data types? -- On strongly cube-free?-words generated by binary morphisms -- On the role of selectors in selective substitution grammars -- Classes of functions over binary trees -- Mathematical structures underlying greedy algorithms -- Some properties of language families generated by commutative languages -- Isomorphism completeness for some algebraic structures -- Reducing algebraic tree grammars -- Rational cone and substitution -- On the regularity problem of SF-languages generated by minimal linear grammars -- Co-algebras as machines for the interpretations of flow diagrams -- Random access machines and straight-line programs -- On the LBA problem -- Dynamic algebras of programs -- The equivalence problem for LL- and LR-regular grammars -- Context-free languages of infinite words as least fixpoints -- Remarks on the notion of concurrency relation in the case of systems -- On the size of conjunctive representations of n-ary relations -- On subwords of formal languages -- First order dynamic logic with decidable proofs and workable model theory -- Elimination of second-order quantifiers for well-founded trees in stationary logic and finitely determinate structures -- Processes in Petri nets -- Some algebraic aspects of recognizability and rationality -- Pebbling and bandwidth -- On cellular graph-automata and second-order definable graph-properties -- Extensions of symmetric hom-functors to the Kleisli category -- A new operation between languages -- Logical description of computation processes -- An algorithm to identify slices, with applications to vector replacement systems -- One pebble does not suffice to search plane labyrinths -- About the by codings of environments induced posets [æ z,?] and [?z,?] -- The complexity of automata and subtheories of monadic second order arithmetics -- Tape complexity of word problems."@en ;
    schema:editor <http://viaf.org/viaf/108229771> ; # Ferenc Gécseg
    schema:exampleOfWork <http://worldcat.org/entity/work/id/892425260> ;
    schema:genre "Conference publication"@en ;
    schema:genre "Electronic books"@en ;
    schema:genre "Conference papers and proceedings"@en ;
    schema:inLanguage "en" ;
    schema:isPartOf <http://worldcat.org/issn/1611-3349> ; # Lecture notes in computer science ;
    schema:isSimilarTo <http://www.worldcat.org/oclc/7741455> ;
    schema:name "Fundamentals of computation theory : proceedings of the 1981 International FCT-Conference, Szeged, Hungary, August 24-28, 1981"@en ;
    schema:productID "150394082" ;
    schema:publication <http://www.worldcat.org/title/-/oclc/150394082#PublicationEvent/berlin_springer_1981> ;
    schema:publisher <http://experiment.worldcat.org/entity/work/data/892425260#Agent/springer> ; # Springer
    schema:url <http://link.springer.com/openurl?genre=book&isbn=978-3-540-10854-2> ;
    schema:url <http://dx.doi.org/10.1007/3-540-10854-8> ;
    schema:workExample <http://worldcat.org/isbn/9783540108542> ;
    schema:workExample <http://dx.doi.org/10.1007/3-540-10854-8> ;
    schema:workExample <http://worldcat.org/isbn/9783540387657> ;
    wdrs:describedby <http://www.worldcat.org/title/-/oclc/150394082> ;
    .


Related Entities

<http://experiment.worldcat.org/entity/work/data/892425260#Meeting/international_conference_on_fundamentals_of_computation_theory_fct_3_24_08_1981_28_08_1981_szeged_hungary> # International Conference on Fundamentals of Computation Theory, FCT (3 : 24-08-1981 - 28-08-1981 : Szeged, Hungary)
    a bgn:Meeting, schema:Event ;
    schema:location <http://experiment.worldcat.org/entity/work/data/892425260#Place/szeged_hungary> ; # Szeged, Hungary)
    schema:name "International Conference on Fundamentals of Computation Theory, FCT (3 : 24-08-1981 - 28-08-1981 : Szeged, Hungary)" ;
    .

<http://experiment.worldcat.org/entity/work/data/892425260#Place/szeged_hungary> # Szeged, Hungary)
    a schema:Place ;
    schema:name "Szeged, Hungary)" ;
    .

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

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

<http://viaf.org/viaf/108229771> # Ferenc Gécseg
    a schema:Person ;
    schema:familyName "Gécseg" ;
    schema:givenName "Ferenc" ;
    schema:name "Ferenc Gécseg" ;
    .

<http://viaf.org/viaf/150826734> # József Attila Tudományegyetem. Institute of Mathematics (Szeged)
    a schema:Organization ;
    schema:name "József Attila Tudományegyetem. Institute of Mathematics (Szeged)" ;
    .

<http://worldcat.org/isbn/9783540108542>
    a schema:ProductModel ;
    schema:isbn "3540108548" ;
    schema:isbn "9783540108542" ;
    .

<http://worldcat.org/isbn/9783540387657>
    a schema:ProductModel ;
    schema:isbn "354038765X" ;
    schema:isbn "9783540387657" ;
    .

<http://worldcat.org/issn/1611-3349> # Lecture notes in computer science ;
    a bgn:PublicationSeries ;
    schema:hasPart <http://www.worldcat.org/oclc/150394082> ; # Fundamentals of computation theory : proceedings of the 1981 International FCT-Conference, Szeged, Hungary, August 24-28, 1981
    schema:issn "1611-3349" ;
    schema:name "Lecture notes in computer science ;" ;
    .

<http://www.worldcat.org/oclc/7741455>
    a schema:CreativeWork ;
    rdfs:label "Fundamentals of computation theory" ;
    schema:isSimilarTo <http://www.worldcat.org/oclc/150394082> ; # Fundamentals of computation theory : proceedings of the 1981 International FCT-Conference, Szeged, Hungary, August 24-28, 1981
    .

<http://www.worldcat.org/title/-/oclc/150394082>
    a genont:InformationResource, genont:ContentTypeGenericResource ;
    schema:about <http://www.worldcat.org/oclc/150394082> ; # Fundamentals of computation theory : proceedings of the 1981 International FCT-Conference, Szeged, Hungary, August 24-28, 1981
    schema:dateModified "2018-09-08" ;
    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.