Skip to main content
SpringerLink
Log in
Book cover
  • Conference proceedings
  • © 1986

Automata, Languages and Programming

13th International Colloquium, Rennes, France, July 15-19, 1986. Proceedings

Editors:

  1. Laurent Kott
    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 226)

Sections

Buy it now

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

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

Table of contents (48 papers)

  1. Front Matter

    PDF

  2. Characterizations of PUNC and precomputation

    • Eric W. Allender
    Pages 1-10

  3. Comparison of algorithms controlling concurrent access to a database: A combinatorial approach

    • D. Arques, J. Françon, M. T. Guichet, P. Guichet
    Pages 11-20

  6. On exponential lowness

    • R. Book, P. Orponen, D. Russo, O. Watanabe
    Pages 40-49

  7. A tradeoff between search and update time for the implicit dictionary problem

    • Allan Borodin, Faith E. Fich, Friedhelm Meyer auf der Heide, Eli Upfal, Avi Wigderson
    Pages 50-59

  8. Intersections of some families of languages

    • Franz J. Brandenburg
    Pages 60-68

  10. Counting with rational functions

    • C. Choffrut, M. P. Schutzenberger
    Pages 79-88

  11. Finite biprefix sets of paths in a Graph

    • Clelia De Felice
    Pages 89-94

  14. On discerning words by automata

    • P. Goralčík, V. Koubek
    Pages 116-122

  15. Complexity classes without machines: On complete languages for UP

    • Juris Hartmanis, Lane Hemachandra
    Pages 123-135

  16. Containment, separation, complete sets, and immunity of complexity classes

    • Juris Hartmanis, Ming Li, Yaacov Yesha
    Pages 136-145

  17. On nontermination of Knuth-Bendix algorithm

    • Mikuláš Hermann, Igor Prívara
    Pages 146-156

  19. Rational equivalence relations

    • J. Howard Johnson
    Pages 167-176

  20. Some further results on digital search trees

    • Peter Kirschenhofer, Helmut Prodinger
    Pages 177-185
Back to top

Keywords

Back to top

Bibliographic Information

Back to top

Publish with us

Policies and ethics

Back to top
Access via your institution

Buy it now

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

Search

Navigation