Skip to main content
SpringerLink
Log in
Book cover

Automata, Languages, and Programming

Sixth Colloquium, Graz, Austria, July 16-20, 1979. Proceedings

  • Conference proceedings
  • © 1979

Overview

Editors:
  1. Hermann A. Maurer
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 71)

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
Softcover Book USD 139.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (53 papers)

  1. Front Matter

    Download chapter PDF

  2. Sharing in nondeterminism

    • Egidio Astesiano, Gerardo Costa
    Pages 1-15

  3. Sur les mots sans carré définis par un morphisme

    • Jean Berstel
    Pages 16-25

  4. A characterization of abstract data as model-theoretic invariants

    • A. Bertoni, G. Mauri, P. A. Miglioli
    Pages 26-37

  5. Inherent ambiguities in families of grammars extended abstract

    • Meera Blattner
    Pages 38-48

  6. Representing complexity classes by equality sets

    • Ronald V. Book, Franz-Josef Brandenburg
    Pages 49-57

  7. Supercounter machines

    • B. v. Braunmühl, E. Hotzel
    Pages 58-72

  8. Existential quantifiers in abstract data types

    • M. Broy, W. Dosch, H. Partsch, P. Pepper, M. Wirsing
    Pages 73-87

  9. A generalization of Ginsburg and Rose's characterization of G-S-M mappings

    • C. Choffrut
    Pages 88-103

  10. Strict deterministic languages and controlled rewriting systems

    • Laurent Chottin
    Pages 104-117

  11. A string matching algorithm fast on the average

    • Beate Commentz-Walter
    Pages 118-132

  12. Functional characterization of some semantic equalities inside λ-calculus

    • M. Coppo, M. Dezani-Ciancaglini, P. Salle'
    Pages 133-146

  13. Arbitration and queueing under limited shared storage requirements

    • Armin B. Cremers, Thomas N. Hibbard
    Pages 147-160

  14. On the homomorphic characterizations of families of languages

    • K. Culik II
    Pages 161-170

  15. Two level grammars: CF-grammars with equation schemes

    • Piotr DembiÅ„ski, Jan MaÅ‚uszyÅ„ski
    Pages 171-187

  16. Proving termination with multiset orderings

    • Nachum Dershowitz, Zohar Manna
    Pages 188-202

  17. One abstract accepting algorithm for all kinds of parsers

    • P. Deussen
    Pages 203-217

  18. Studies in abstract/concrete mappings in proving algorithm correctness

    • Arthur G. Duncan, Lawrence Yelowitz
    Pages 218-229

  19. A characterization of a dot-depth two analogue of generalized definite languages

    • Faith E. Fich, J. A. Brzozowski
    Pages 230-244

  20. Partitioned LL(k) grammars

    • Dietmar Friede
    Pages 245-255
Back to top

Keywords

Bibliographic Information

  • Book Title: Automata, Languages, and Programming

  • Book Subtitle: Sixth Colloquium, Graz, Austria, July 16-20, 1979. Proceedings

  • Editors: Hermann A. Maurer

  • Series Title: Lecture Notes in Computer Science

  • DOI: https://doi.org/10.1007/3-540-09510-1

  • Publisher: Springer Berlin, Heidelberg

  • eBook Packages: Springer Book Archive

  • Copyright Information: Springer-Verlag Berlin Heidelberg 1979

  • Softcover ISBN: 978-3-540-09510-1Published: 01 June 1979

  • eBook ISBN: 978-3-540-35168-9Published: 05 July 2005

  • Series ISSN: 0302-9743

  • Series E-ISSN: 1611-3349

  • Edition Number: 1

  • Number of Pages: XII, 688

  • Topics: Theory of Computation, Software Engineering/Programming and Operating Systems

Publish with us

Policies and ethics

Back to top

Search

Navigation