Automata, Languages and Programming: Ninth Colloquium Aarhus, Denmark, July 12–16, 1982 | SpringerLink
Skip to main content
Springer Nature Link
Log in

Automata, Languages and Programming

Ninth Colloquium Aarhus, Denmark, July 12–16, 1982

  • Conference proceedings
  • © 1982

Overview

Editors:
  1. Mogens Nielsen
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Erik Meineche Schmidt
    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 140)

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

Access this book

Log in via an institution

Subscribe and save

Springer+ Basic
¥17,985 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

eBook JPY 5719
Price includes VAT (Japan)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book JPY 7149
Price includes VAT (Japan)
  • 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

Keywords

Table of contents (50 papers)

  1. Front Matter

    Download chapter PDF

  2. Locality in modular systems

    • R. J. R. Back, H. Mannila
    Pages 1-13

  3. On-the-fly garbage collection: New algorithms inspired by program proofs

    • Mordechai Ben-Ari
    Pages 14-22

  4. Algebraic specifications for parametrized data types with minimal parameter and target algebras

    • J. A. Bergstra, J. W. Klop
    Pages 23-34

  5. A modification of the λ-calculus as a base for functional programming languages

    • K. J. Berkling, E. Fehr
    Pages 35-47

  6. On the power of nondeterminism in dynamic logic

    • Piotr Berman, Joseph Y. Halpern, Jerzy Tiuryn
    Pages 48-60

  7. Equivalence and membership problems for regular trace languages

    • A. Bertoni, G. Mauri, N. Sabadini
    Pages 61-71

  8. On the power of chain rules in context free grammars

    • Norbert Blum
    Pages 72-82

  9. Extended Chomsky-Schützenberger theorems

    • Franz-Josef Brandenburg
    Pages 83-93

  10. Real time agents

    • Luoa Cardelli
    Pages 94-106

  11. Machine inductive inference and language identification

    • John Case, Christopher Lynes
    Pages 107-115

  12. Approximations of infinitary objects

    • G. Comyn, M. Dauchet
    Pages 116-127

  13. On test sets and the Ehrenfeucht conjecture

    • Karel Culik II, Juhani Karhumäki
    Pages 128-140

  14. An automata-theoretic characterization of the OI-hierarchy

    • Werner Damm, Andreas Goerdt
    Pages 141-153

  15. Fast detection of polyhedral intersections

    • David P. Dobkin, David G. Kirkpatrick
    Pages 154-165

  16. On reversal-bounded counter machines and on pushdown automata with a bound on the size of the pushdown store

    • Pavol Dūri¯s, Zvi Galil
    Pages 166-175

  17. Multihead finite state automata am concatenation

    • Pavol Ďuriš, Juraj Hromkovič
    Pages 176-186

  18. Conditions enforcing regularity of context-free languages

    • A. Ehrenfeucht, D. Haussler, G. Rozenberg
    Pages 187-191

  19. Repetitions in homomorphisms and languages

    • A. Ehrenfeucht, G. Rozenberg
    Pages 192-196

  20. Parameter passing commutes with implementation of parameterized data types

    • H. Ehrig, H. -J. Kreowski
    Pages 197-211
Back to top

Bibliographic Information

  • Book Title: Automata, Languages and Programming

  • Book Subtitle: Ninth Colloquium Aarhus, Denmark, July 12–16, 1982

  • Editors: Mogens Nielsen, Erik Meineche Schmidt

  • Series Title: Lecture Notes in Computer Science

  • DOI: https://doi.org/10.1007/BFb0012751

  • Publisher: Springer Berlin, Heidelberg

  • eBook Packages: Springer Book Archive

  • Copyright Information: Springer-Verlag Berlin Heidelberg 1982

  • Softcover ISBN: 978-3-540-11576-2Published: 01 July 1982

  • eBook ISBN: 978-3-540-39308-5Published: 23 November 2005

  • Series ISSN: 0302-9743

  • Series E-ISSN: 1611-3349

  • Edition Number: 1

  • Number of Pages: VII, 615

  • Topics: Algorithm Analysis and Problem Complexity, Mathematical Logic and Formal Languages

Publish with us

Policies and ethics

Back to top

Search

Navigation