On specific features of recognizable families of languages

  • Václav Benda
  • Kamila Bendová
Part of the Lecture Notes in Computer Science book series (LNCS, volume 45)


Regular Language Characterization Theorem Characteristic String Uncountable Family Principal Filter 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Havel, I. M., Finite Branching Automata. Kybernetika 10 1974, 281–302.Google Scholar
  2. 2.
    Benda, V. and Bendová, K., On Families Recognizable by Finite Branching Automata /in preparation/.Google Scholar
  3. 3.
    Havel, I. M., On the Branching Structure of Languages. This volume, pp.Google Scholar
  4. 4.
    Eilenberg, S., Automata, Languages, and Machines. Volume A. Academic Press, New York 1974.Google Scholar
  5. 5.
    Cohn, P. M., Universal Algebra. Harper and Row, New York 1965.Google Scholar
  6. 6.
    Benda V. and Bendová K., Recognizable Filters and Ideals. Commentationes Math. Univ. Carolinae /to appear/.Google Scholar
  7. 7.
    Katětov, M., O základech matematického vyjadřování plánu /On the basis of mathematical expression of a plan/. Mimeographed notes, Faculty of Mathematics and Physics, Charles University.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1976

Authors and Affiliations

  • Václav Benda
    • 1
  • Kamila Bendová
    • 2
  1. 1.Railway Research InstitutePrague 1
  2. 2.Mathematical Institute ČSAVPrague 1Czechoslovakia

Personalised recommendations