Skip to main content
SpringerLink
Log in

Fundamentals of Computation Theory

Proceedings of the 1977 International FCT-Conference. Poznan - Kornik, Poland, September 19 - 23, 1977

  • Conference proceedings
  • © 1977

Overview

Editors:
  1. Marek KarpiƄski
    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 56)

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 (63 papers)

  1. Front Matter

    Download chapter PDF

  2. Methodology of proving a finite-state stochastic representability and nonrepresentability

    • R. G. Bukharajev, Ju. A. Alpin
    Pages 3-11

  3. Non deterministic recursive program schemes

    • A. Annold, M. Nivat
    Pages 12-21

  4. Some remarks on relational composition in computational theory and practice

    • A. R. Bednarek, S. M. Ulam
    Pages 22-32

  5. An axiomatization of the rational data objects

    • J. A. Bergstra, A. Ollongren, Th. P. van der Weide
    Pages 33-38

  6. Some recent results on recognizable formal power series

    • J. Berstel
    Pages 39-48

  7. Canonical forms of context-free grammars and position restricted grammar forms

    • Meera Blattner
    Pages 49-53

  8. Environments, labyrinths and automata

    • Lothar Budach
    Pages 54-64

  9. Automata in labyrinths

    • Wolfgang Coy
    Pages 65-71

  10. Stochastic algebras and stochastic automata over general measurable spaces: Algebraic theory and a decomposition theorem

    • Hans Daduna
    Pages 72-77

  11. Some remarks on the algebra of automaton mappings

    • JĂŒrgen Dassow
    Pages 78-83

  12. Algebraic semantics of type definitions and structured variables

    • H. -D. Ehrich
    Pages 84-97

  13. Universal algebras and tree automata

    • Ferenc GĂ©cseg
    Pages 98-112

  14. Vectors of coroutines over blikle nets

    • Ryszard Janicki
    Pages 113-119

  15. Initial algebraic semantics for non context-free languages

    • H. Kaphengst, H. Reichel
    Pages 120-126

  16. Reading functions and an extension of Kleene theorem for some families of languages

    • Robert Knast, Jacek Martinek
    Pages 127-134

  17. Operations on ω-regular languages

    • Andrzej WƂodzimierz Mostowski
    Pages 135-141

  18. On the relation between graph grammars and graph L-systems

    • Manfred Nagl
    Pages 142-151

  19. On the theory of syntactic monoids for rational languages

    • J -F. Perrot
    Pages 152-165

  20. The equivalence of schemata with some feedbacks

    • M. Roytberg
    Pages 166-170
Back to top

Keywords

Bibliographic Information

  • Book Title: Fundamentals of Computation Theory

  • Book Subtitle: Proceedings of the 1977 International FCT-Conference. Poznan - Kornik, Poland, September 19 - 23, 1977

  • Editors: Marek KarpiƄski

  • Series Title: Lecture Notes in Computer Science

  • DOI: https://doi.org/10.1007/3-540-08442-8

  • Publisher: Springer Berlin, Heidelberg

  • eBook Packages: Springer Book Archive

  • Copyright Information: Springer-Verlag Berlin Heidelberg 1977

  • Softcover ISBN: 978-3-540-08442-6Published: 01 September 1977

  • eBook ISBN: 978-3-540-37084-0Published: 05 July 2005

  • Series ISSN: 0302-9743

  • Series E-ISSN: 1611-3349

  • Edition Number: 1

  • Number of Pages: XIV, 546

  • Topics: Mathematical Logic and Foundations, Computer Science, general

Publish with us

Policies and ethics

Back to top

Search

Navigation