skip to content
Automata, languages and programming : sixth colloquium, Graz, Austria, July 16-20, 1979 Preview this item
ClosePreview this item
Checking...

Automata, languages and programming : sixth colloquium, Graz, Austria, July 16-20, 1979

Author: Hermann A Maurer
Publisher: Berlin : Springer, 1979.
Series: Lecture notes in computer science, 71.
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
Congressen (vorm)
Additional Physical Format: Print version:
Automata, languages and programming
(NL-LeOCL)790294176
(OCoLC)5101304
Material Type: Conference publication, Document, Internet resource
Document Type: Internet Resource, Computer File
All Authors / Contributors: Hermann A Maurer
ISBN: 9783540351689 354035168X
OCLC Number: 150395089
Language Note: English.
Notes: Colloquium sponsored by EATCS (European Association for Theoretical Computer Science).
Description: 1 online resource (ix, 684 pages)
Contents: Sharing in nondeterminism --
Sur les mots sans carré définis par un morphisme --
A characterization of abstract data as model-theoretic invariants --
Inherent ambiguities in families of grammars extended abstract --
Representing complexity classes by equality sets --
Supercounter machines --
Existential quantifiers in abstract data types --
A generalization of Ginsburg and Rose's characterization of G-S-M mappings --
Strict deterministic languages and controlled rewriting systems --
A string matching algorithm fast on the average --
Functional characterization of some semantic equalities inside?-calculus --
Arbitration and queueing under limited shared storage requirements --
On the homomorphic characterizations of families of languages --
Two level grammars: CF-grammars with equation schemes --
Proving termination with multiset orderings --
One abstract accepting algorithm for all kinds of parsers --
Studies in abstract/concrete mappings in proving algorithm correctness --
A characterization of a dot-depth two analogue of generalized definite languages --
Partitioned LL(k) grammars --
Recursion schemes and generalized interpretations --
A rational theory of AFLs --
On the succinctness of different representations of languages --
A fixed-point theorem for recursive-enumerable languages and some considerations about fixed-point semantics of monadic programs --
Hierarchic index sequential search with optimal variable block size and its minimal expected number of comparisons --
A unique termination theorem for a theory with generalised commutative axioms --
Dags and Chomsky hierarchy --
Recent advances in the probabilistic analysis of graph-theoretic algorithms --
On the average stack size of regularly distributed binary trees --
On reductions of parallel programs --
On the height of derivation trees --
The modal logic of programs --
A comparison between two variations of a pebble game on graphs --
LL(k) parsing for attributed grammars --
On eliminating nondeterminism from Turing machines which use less than logarithm worktape space --
Structure preserving transformations on non-left-recursive grammars --
The complexity of restricted minimum spanning tree problems --
A systematic approach to formal language theory through parallel rewriting --
Extending the notion of finite index --
On the complexity of general context-free language parsing and recognition --
Space-time tradeoffs for oblivious integer multiplication --
Investigating programs in terms of partial graphs --
On the power of random access machines --
An axiomatic treatment of ALGOL 68 routines --
P-selective sets, tally languages, and the behavior of polynomial time reducibilities on NP --
Constructing call-by-value continuation semantics --
A formal semantics for concurrent systems --
On constructing LL(k) parsers --
More on advice on structuring compilers and proving them correct --
Languages of nilpotent and solvable groups (extended abstract) --
Unique fixed points vs. least fixed points --
A modification of the LR(k) method for constructing compact bottom-up parsers --
Optimal decomposition of linear automata --
Bracketed two-level grammars --
A decidable and practical approach to language definitions.
Series Title: Lecture notes in computer science, 71.
Responsibility: ed. by Hermann A. Maurer.

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/150395089> # Automata, languages and programming : sixth colloquium, Graz, Austria, July 16-20, 1979
    a schema:MediaObject, schema:CreativeWork, schema:Book ;
    library:oclcnum "150395089" ;
    library:placeOfPublication <http://id.loc.gov/vocabulary/countries/gw> ;
    schema:about <http://experiment.worldcat.org/entity/work/data/891134437#Topic/formele_talen> ; # Formele talen
    schema:about <http://experiment.worldcat.org/entity/work/data/891134437#Topic/abstracte_automaten> ; # Abstracte automaten
    schema:about <http://experiment.worldcat.org/entity/work/data/891134437#Topic/programmeren_computers> ; # Programmeren (computers)
    schema:about <http://id.worldcat.org/fast/872451> ; # Computer science
    schema:about <http://experiment.worldcat.org/entity/work/data/891134437#Topic/computers> ; # Computers
    schema:about <http://dewey.info/class/004/e23/> ;
    schema:bookFormat schema:EBook ;
    schema:contributor <http://experiment.worldcat.org/entity/work/data/891134437#Meeting/colloquium_on_automata_languages_and_programming_6_16_07_1979_20_07_1979_graz> ; # Colloquium on Automata, Languages, and Programming (6 : 16-07-1979 - 20-07-1979 : Graz)
    schema:datePublished "1979" ;
    schema:description "Sharing in nondeterminism -- Sur les mots sans carré définis par un morphisme -- A characterization of abstract data as model-theoretic invariants -- Inherent ambiguities in families of grammars extended abstract -- Representing complexity classes by equality sets -- Supercounter machines -- Existential quantifiers in abstract data types -- A generalization of Ginsburg and Rose's characterization of G-S-M mappings -- Strict deterministic languages and controlled rewriting systems -- A string matching algorithm fast on the average -- Functional characterization of some semantic equalities inside?-calculus -- Arbitration and queueing under limited shared storage requirements -- On the homomorphic characterizations of families of languages -- Two level grammars: CF-grammars with equation schemes -- Proving termination with multiset orderings -- One abstract accepting algorithm for all kinds of parsers -- Studies in abstract/concrete mappings in proving algorithm correctness -- A characterization of a dot-depth two analogue of generalized definite languages -- Partitioned LL(k) grammars -- Recursion schemes and generalized interpretations -- A rational theory of AFLs -- On the succinctness of different representations of languages -- A fixed-point theorem for recursive-enumerable languages and some considerations about fixed-point semantics of monadic programs -- Hierarchic index sequential search with optimal variable block size and its minimal expected number of comparisons -- A unique termination theorem for a theory with generalised commutative axioms -- Dags and Chomsky hierarchy -- Recent advances in the probabilistic analysis of graph-theoretic algorithms -- On the average stack size of regularly distributed binary trees -- On reductions of parallel programs -- On the height of derivation trees -- The modal logic of programs -- A comparison between two variations of a pebble game on graphs -- LL(k) parsing for attributed grammars -- On eliminating nondeterminism from Turing machines which use less than logarithm worktape space -- Structure preserving transformations on non-left-recursive grammars -- The complexity of restricted minimum spanning tree problems -- A systematic approach to formal language theory through parallel rewriting -- Extending the notion of finite index -- On the complexity of general context-free language parsing and recognition -- Space-time tradeoffs for oblivious integer multiplication -- Investigating programs in terms of partial graphs -- On the power of random access machines -- An axiomatic treatment of ALGOL 68 routines -- P-selective sets, tally languages, and the behavior of polynomial time reducibilities on NP -- Constructing call-by-value continuation semantics -- A formal semantics for concurrent systems -- On constructing LL(k) parsers -- More on advice on structuring compilers and proving them correct -- Languages of nilpotent and solvable groups (extended abstract) -- Unique fixed points vs. least fixed points -- A modification of the LR(k) method for constructing compact bottom-up parsers -- Optimal decomposition of linear automata -- Bracketed two-level grammars -- A decidable and practical approach to language definitions."@en ;
    schema:editor <http://viaf.org/viaf/105878114> ; # Hermann A. Maurer
    schema:exampleOfWork <http://worldcat.org/entity/work/id/891134437> ;
    schema:genre "Electronic books"@en ;
    schema:genre "Congressen (vorm)"@en ;
    schema:genre "Conference publication"@en ;
    schema:inLanguage "en" ;
    schema:isPartOf <http://worldcat.org/issn/1611-3349> ; # Lecture notes in computer science ;
    schema:isSimilarTo <http://www.worldcat.org/oclc/5101304> ;
    schema:name "Automata, languages and programming : sixth colloquium, Graz, Austria, July 16-20, 1979"@en ;
    schema:productID "150395089" ;
    schema:url <http://dx.doi.org/10.1007/3-540-09510-1> ;
    schema:url <https://login.proxy.lib.strath.ac.uk/login?url=http://link.springer.com/10.1007/3-540-09510-1> ;
    schema:url <http://books.eclibrary.ca/isbn/9783540351689> ;
    schema:url <http://link.springer.com/openurl?genre=book&isbn=978-3-540-09510-1> ;
    schema:url <http://link.springer.com/10.1007/3-540-09510-1> ;
    schema:url <https://link.springer.com/10.1007/3-540-09510-1> ;
    schema:workExample <http://worldcat.org/isbn/9783540351689> ;
    schema:workExample <http://dx.doi.org/10.1007/3-540-09510-1> ;
    wdrs:describedby <http://www.worldcat.org/title/-/oclc/150395089> ;
    .


Related Entities

<http://books.eclibrary.ca/isbn/9783540351689>
    rdfs:comment "Access restricted to Harris Learning Library use, and to students, faculty, and staff of Nipissing University." ;
    .

<http://experiment.worldcat.org/entity/work/data/891134437#Meeting/colloquium_on_automata_languages_and_programming_6_16_07_1979_20_07_1979_graz> # Colloquium on Automata, Languages, and Programming (6 : 16-07-1979 - 20-07-1979 : Graz)
    a bgn:Meeting, schema:Event ;
    schema:location <http://experiment.worldcat.org/entity/work/data/891134437#Place/graz> ; # Graz)
    schema:name "Colloquium on Automata, Languages, and Programming (6 : 16-07-1979 - 20-07-1979 : Graz)" ;
    .

<http://experiment.worldcat.org/entity/work/data/891134437#Topic/abstracte_automaten> # Abstracte automaten
    a schema:Intangible ;
    schema:name "Abstracte automaten"@en ;
    .

<http://experiment.worldcat.org/entity/work/data/891134437#Topic/programmeren_computers> # Programmeren (computers)
    a schema:Intangible ;
    schema:name "Programmeren (computers)"@en ;
    .

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

<http://viaf.org/viaf/105878114> # Hermann A. Maurer
    a schema:Person ;
    schema:birthDate "1941" ;
    schema:familyName "Maurer" ;
    schema:givenName "Hermann A." ;
    schema:name "Hermann A. Maurer" ;
    .

<http://worldcat.org/isbn/9783540351689>
    a schema:ProductModel ;
    schema:isbn "354035168X" ;
    schema:isbn "9783540351689" ;
    .

<http://worldcat.org/issn/1611-3349> # Lecture notes in computer science ;
    a bgn:PublicationSeries ;
    schema:hasPart <http://www.worldcat.org/oclc/150395089> ; # Automata, languages and programming : sixth colloquium, Graz, Austria, July 16-20, 1979
    schema:issn "1611-3349" ;
    schema:name "Lecture notes in computer science ;" ;
    .

<http://www.worldcat.org/oclc/5101304>
    a schema:CreativeWork ;
    rdfs:label "Automata, languages and programming" ;
    schema:description "Print version:" ;
    schema:isSimilarTo <http://www.worldcat.org/oclc/150395089> ; # Automata, languages and programming : sixth colloquium, Graz, Austria, July 16-20, 1979
    .

<http://www.worldcat.org/title/-/oclc/150395089>
    a genont:InformationResource, genont:ContentTypeGenericResource ;
    schema:about <http://www.worldcat.org/oclc/150395089> ; # Automata, languages and programming : sixth colloquium, Graz, Austria, July 16-20, 1979
    schema:dateModified "2019-03-01" ;
    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.