Advertisement

Characterization of recognizable families by means of regular languages

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

Keywords

Lecture Note Regular Graph Induction Step Mathematical Institute Decision Algorithm 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Havel, I.M., Nondeterministically recognizable sets of languages. In: Mathematical Foundations of Computer Science 1975 (J. Bečvář, Ed.) Lecture Notes in Computer Science 32, Springer-Verlag, Berlin 1975, pp. 252–257.Google Scholar
  2. 2.
    Karpiński, M., Decision algorithms for Havel's branching automata. In: Mathematical Foundations of Computer Science 1975 (J. Bečvář, Ed.) Lecture Notes in Computer Science 32, Springer-Verlag, Berlin 1975, pp. 273–280.Google Scholar
  3. 3.
    Havel, I.M., On the branching structure of languages. In: Mathematical Foundations of Computer Science 1976 (A. Mazurkiewicz, Ed.) Lecture Notes in Computer Science 45, Springer-Verlag, Berlin 1976, pp. 81–99.Google Scholar
  4. 4.
    Benda, V. and Bendová, K., On specific features of recognizable families of languages. In: Mathematical Foundations of Computer Science 1976 (A. Mazurkiewicz, Ed.) Lecture Notes of Computer Science 45, Springer-Verlag, Berlin 1976, pp. 187–194.Google Scholar
  5. 5.
    Havel, L.M., Finite branching automata. Kybernetika 10 (1974), pp. 281–302.Google Scholar
  6. 6.
    Benda, V. and Bendová, K., Recognizable filters and ideals. Commentationes Math.Univ.Carolinae 17, 2 (1976), pp. 251–259.Google Scholar
  7. 7.
    Benda, V. and Bendová, K., On families recognizable by finite branching automata (submitted for publication).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1977

Authors and Affiliations

  • Václav Benda
    • 1
  • Kamila Bendová
    • 2
  1. 1.Research Institute for Mathematical MachinesJinoniceStodůlecká
  2. 2.Mathematical Institute ČSAVŽitná 25Czechoslovakia

Personalised recommendations