Skip to main content
SpringerLink
Log in

Fundamentals of Computation Theory

Proceedings of the 1981 International FCT-Conference, Szeged, Hungaria, August 24-28, 1981

  • Conference proceedings
  • © 1981

Overview

Editors:
  1. Ferenc GĂ©cseg
    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 117)

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

  1. Front Matter

    Download chapter PDF

  2. Observability and Nerode equivalence in concrete categories

    • J. Adámek
    Pages 1-15

  3. Some universal algebraic and model theoretic results in computer science

    • H. AndrĂ©ka, I. NĂ©meti
    Pages 16-23

  4. Probabilistic analysis of the performance of greedy strategies over different classes of combinatorial problems

    • G. Ausiello, M. Protasi
    Pages 24-33

  5. Moderately exponential bound for graph isomorphism

    • LászlĂł Babai
    Pages 34-50

  6. An algebraic definition of attributed transformations

    • MiklĂłs Bartha
    Pages 51-60

  7. Analogies of PAL and COPY

    • Franz-Josef Brandenburg
    Pages 61-70

  8. Quasi-equational logic for partial algeras

    • Peter Burmeister
    Pages 71-80

  9. Homogeneity and completeness

    • B. Csákány
    Pages 81-89

  10. On the error correcting power of pluralism in inductive inference

    • Robert P. Daley
    Pages 90-99

  11. Equality languages and language families

    • JĂĽrgen Dassow
    Pages 100-109

  12. Extremal combinatorial problems in relational data base

    • J. Demetrovics, G. O. H. Katona
    Pages 110-119

  13. Specifying algebraic data types by domain equations

    • H. -D. Ehrich
    Pages 120-129

  14. An axiomatization of regular forests in the language of algebraic theories with iteration

    • Z. Ésik
    Pages 130-136

  15. Fast recognition of rings and lattices

    • P. GoralÄŤĂ­k, A. GoralÄŤĂ­ková, V. Koubek, V. Rödl
    Pages 137-145

  16. A definition of the P = NP-problem in categories

    • H. Huwig
    Pages 146-153

  17. Generating graph languages using hypergraph grammars

    • D. Janssens, G. Rozenberg
    Pages 154-164

  18. Lower bounds for problems defined by polynomial inequalities

    • Jerzy W. Jaromczyk
    Pages 165-172

  19. What is computable for abstract data types ?

    • H. Kaphengst
    Pages 173-181

  20. On strongly cube-free ω-words generated by binary morphisms

    • Juhani Karhumäki
    Pages 182-189
Back to top

Keywords

Bibliographic Information

  • Book Title: Fundamentals of Computation Theory

  • Book Subtitle: Proceedings of the 1981 International FCT-Conference, Szeged, Hungaria, August 24-28, 1981

  • Editors: Ferenc GĂ©cseg

  • Series Title: Lecture Notes in Computer Science

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

  • Publisher: Springer Berlin, Heidelberg

  • eBook Packages: Springer Book Archive

  • Copyright Information: Springer-Verlag Berlin Heidelberg 1981

  • Softcover ISBN: 978-3-540-10854-2Published: 01 August 1981

  • eBook ISBN: 978-3-540-38765-7Published: 15 August 2005

  • Series ISSN: 0302-9743

  • Series E-ISSN: 1611-3349

  • Edition Number: 1

  • Number of Pages: XI, 471

  • Topics: Mathematics, general, Computation by Abstract Devices, Theory of Computation

Publish with us

Policies and ethics

Back to top

Search

Navigation