| Title:
|
On families recognizable by finite branching automata (English) |
| Author:
|
Benda, Václav |
| Author:
|
Bendová, Kamila |
| Language:
|
English |
| Journal:
|
Kybernetika |
| ISSN:
|
0023-5954 |
| Volume:
|
13 |
| Issue:
|
5 |
| Year:
|
1977 |
| Pages:
|
(293)-319 |
| . |
| Category:
|
math |
| . |
| MSC:
|
68A25 |
| MSC:
|
68A30 |
| MSC:
|
68Q45 |
| idZBL:
|
Zbl 0374.94040 |
| idMR:
|
MR0464712 |
| . |
| Date available:
|
2009-09-24T16:58:07Z |
| Last updated:
|
2012-06-05 |
| Stable URL:
|
http://hdl.handle.net/10338.dmlcz/124239 |
| . |
| Reference:
|
[1] I. M. Havel: Finite Branching Automata.Kybernetika 10 (1974), 281-302. Zbl 0287.94050, MR 0381383 |
| Reference:
|
[2] V. Benda K. Bendová: On specific features of recognizable families of languages.In: Mathematical Foundations of Computer Science (A. Mazurkiewicz, Ed.). Lecture Notes in Computer Science 45, Springer-Verlag, Berlin 1976, 187-193. |
| Reference:
|
[3] V. Benda K. Bendová: Recognizable Filters and Ideals.CMUC 17, 2 (1976), 251-259. MR 0411246 |
| Reference:
|
[4] I. M. Havel: Finite branching automata: automata theory motivated by problem solving.In: Mathematical Foundations of Computer Science (A. Blikle, Ed.). Lecture Notes in Computer Science 28, Springer-Verlag, Berlin 1975, 53-61. Zbl 0306.68039, MR 0381383 |
| Reference:
|
[5] I. M. Havel: On the branching structure of languages.In: Mathematical Foundations of Computer Science (A. Mazurkiewicz, Ed.). Lecture Notes in Computer Science 45, Springer-Verlag, Berlin 1976, 81-98. Zbl 0338.68060 |
| Reference:
|
[6] S. Eilenberg: Automata, Languages and Machines.Volume A. Academic Press, New York 1974. Zbl 0317.94045, MR 0530382 |
| Reference:
|
[7] P. M. Cohn: Universal Algebra.Harper and Rower, New York 1965. Zbl 0141.01002, MR 0175948 |
| Reference:
|
[8] A. Ginzburg: Algebraic Theory of Automata.Academic Press, New York-London 1968. Zbl 0195.02501, MR 0242679 |
| . |
