Skip to main content
SpringerLink
Log in
SpringerLink
Log in

Results and Trends in Theoretical Computer Science

Colloquium in Honor of Arto Salomaa, Graz, Austria, June 10 - 11, 1994. Proceedings

  • Conference proceedings
  • © 1994

Overview

Editors:
  1. Juliani Karhumäki
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Hermann Maurer
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. Grzegorz Rozenberg
    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 812)

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

Licence this eBook for your library

Institutional subscriptions

Table of contents (32 papers)

  1. Front Matter

    Download chapter PDF

  2. Generalizing Cook's transformation to imperative stack programs

    • Nils Andersen, Neil D. Jones
    Pages 1-18

  3. A rewriting of Fife's theorem about overlap-free words

    • J. Berstel
    Pages 19-29

  4. Reconsidering the jeep problem or how to transport a birthday present to Salosauna

    • Wilfried Brauer, Ute Brauer
    Pages 30-33

  5. Learning picture sets from examples

    • Anne Brüggemann-Klein, Petra Fischer, Thomas Ottmann
    Pages 34-43

  6. Randomness as an invariant for number representations

    • C. Calude, H. Jürgensen
    Pages 44-66

  7. Cooperating grammars' systems: Power and parameters

    • Erzsébet Csuhaj-Varjú
    Pages 67-84

  8. Parallel pattern generation with one-way communications

    • Karel Culik II, Jarkko Kari
    Pages 85-96

  9. Dynamic labeled 2-structures with variable domains

    • A. Ehrenfeucht, G. Rozenberg
    Pages 97-123

  10. Deciding the NTS property of context-free grammars

    • Joost Engelfriet
    Pages 124-130

  11. Homomorphic representations by products of tree automata

    • Ferenc Gécseg
    Pages 131-139

  12. Identities and transductions

    • T. Harju, H. J. Hoogeboom, H. C. M. Kleijn
    Pages 140-144

  13. Decomposition of infinite labeled 2-structures

    • T. Harju, G. Rozenberg
    Pages 145-158

  14. An iteration property of Lindenmayerian power series

    • Juha Honkala
    Pages 159-168

  15. Comparing descriptional and computational complexity of infinite words

    • Juraj Hromkovič, Juhani Karhumäki, Arto Lepistö
    Pages 169-182

  16. On some open problems concerning the complexity of cellular arrays

    • Oscar H. Ibarra, Tao Jiang
    Pages 183-196

  17. Power of controlled insertion and deletion

    • Lila Kari
    Pages 197-212

  18. From colonies to eco(grammar)systems

    • Alica Kelemenová, Jozef Kelemen
    Pages 213-231

  19. On the multiplicity equivalence problem for context-free grammars

    • Werner Kuich
    Pages 232-250

  20. On general solution of word equations

    • G. S. Makanin, H. Abdulrab
    Pages 251-263
Back to top

Keywords

About this book

This volume is dedicated to Professor Arto Salomaa on the occasion of his 60th birthday. The 32 invited papers contained in the volume were presented at the festive colloquium, organized by Hermann Maurer at Graz, Austria, in June 1994; the contributing authors are well-known scientists with special relations to Professor Salomaa as friends, Ph.D. students, or co-authors. The volume reflects the broad spectrum of Professor Salomaa's research interests in theoretical computer science and mathematics with contributions particularly to automata theory, formal language theory, mathematical logic, computability, and cryptography. The appendix presents Professor Salomaa's curriculum vitae and lists the more than 300 papers and 9 books he published.

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation