Skip to main content
  • Conference proceedings
  • © 1982

Theoretical Computer Science

6th GI-Conference Dortmund, January 5-7, 1983

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

Buy it now

Buying options

Softcover Book USD 54.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 (31 papers)

  1. Coroutines and processes in block structured languages

    • A. Kreczmar, T. Müldner
    Pages 231-241
  2. Two remarks on the power of counting

    • Christos H. Papadimitriou, Stathis K. Zachos
    Pages 269-275
  3. Some operations and transductions that preserve rationality

    • J. -E. Pin, J. Sakarovitch
    Pages 277-288
  4. The equivalence problem for N.T.S. languages is deoidable

    • Géraud Senizergues
    Pages 313-323
  5. A hierarchy of sets of infinite trees

    • Wolfgang Thomas
    Pages 335-342
  6. Maintaining order in a generalized linked list

    • Athanasios K. Tsakalidis
    Pages 343-352
  7. Back Matter

Bibliographic Information

Buy it now

Buying options

Softcover Book USD 54.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