Skip to main content
Springer Nature Link
Account

Automata, Languages, and Programming

11th Colloquium, Antwerp, Belgium, July 16-20, 1984 (EATCS sign). Proceedings

  • Conference proceedings
  • © 1984

Overview

Editors:
  1. Jan Paredaens

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

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 69.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

Explore related subjects

Discover the latest articles, books and news in related subjects.

Table of contents (48 papers)

  1. Front Matter

    Download chapter PDF

  2. The theory of data dependencies — An overview

    • Ronald Fagin, Moshe Y. Vardi
    Pages 1-22

  3. The VLSI revolution in theoretical circles

    • Arnold L. Rosenberg
    Pages 23-40

  4. Tuple sequences and indexes

    • Serge Abiteboul, Seymour Ginsburg
    Pages 41-50

  5. The complexity of cubical graphs

    • Foto Afrati, Christos H. Papadimitriou, George Papageorgiou
    Pages 51-57

  6. P-generic sets

    • Klaus Ambos-Spies, Hans Fleischhack, Hagen Huwig
    Pages 58-68

  7. Functional dependencies and disjunctive existence constraints in database relations with null values

    • Paolo Atzeni, Nicola M. Morfuni
    Pages 69-81

  8. The algebra of recursively defined processes and the algebra of regular processes

    • J. A. Bergstra, J. W. Klop
    Pages 82-94

  9. Algebraic specification of exception handling and error recovery by means of declarations and equations

    • Michel Bidoit
    Pages 95-108

  10. Building the minimal DFA for the set of all subwords of a word on-line in linear time

    • A. Blumer, J. Blumer, A. Ehrenfeucht, D. Haussler, R. McConnell
    Pages 109-118

  11. The complexity and decidability of separation

    • Bernard Chazelle, Thomas Ottmann, Eljas Soisalon-Soininen, Derick Wood
    Pages 119-127

  12. Concurrent transmissions in broadcast networks

    • Charles J. Colbourn, Andrzej Proskurowski
    Pages 128-136

  13. Linear searching for a square in a word

    • Max Crochemore
    Pages 137-137

  14. Domain algebras

    • Peter Dybjer
    Pages 138-150

  15. Principality results about some matrix languages families

    • Didier Ferment
    Pages 151-161

  16. Oriented equational clauses as a programming language

    • L. Fribourg
    Pages 162-173

  17. Relational algebra operations and sizes of relations

    • Danièle Gardy, Claude Puech
    Pages 174-186

  18. Some results about finite and infinite behaviours of a pushdown automaton

    • Danièle Girault-Beauquier
    Pages 187-195

  19. On the relationship of CCS and petri nets

    • Ursula Goltz, Alan Mycroft
    Pages 196-208

  20. Communicating finite state machines with priority channels

    • M. G. Gouda, L. E. Rosier
    Pages 209-221
Back to top

Accessibility Information

Accessibility information for this book is coming soon. We're working to make it available as quickly as possible. Thank you for your patience.

Bibliographic Information

Keywords

Publish with us

Policies and ethics

Back to top