Part of the Lecture Notes in Computer Science book series (LNCS, volume 32)
Nondeterministically recognizable sets of languages
KeywordsDecision Rule Generalize Behavior Finite Automaton Input String Automaton Theory
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.
- 1.Rabin, M.O. and Scott, D., Finite automata and their decision problems. IBM Journal of Research and Development, 3 (1959), 114–125.Google Scholar
- 2.Scott, D., Some definitional suggestions for automata theory. Journal of Computer and System Sciences, 1 (1967), 187–212.Google Scholar
- 3.Havel, I.M., Finite branching automata. Kybernetika 10 (1974), 281–302.Google Scholar
- 4.Havel, I.M., Finite branching automata: automata theory motivated by problem solving. In Proceedings MFCS'74 Symposium, Springer-Verlag, Berlin,1975.Google Scholar
- 5.Eilenberg, S., Automata, Languages, and Machines, Vol. A. Academic Press, New York, 1974.Google Scholar
- 6.Benda, V., Contributions to the theory of finite branching automata. (In Czech) Diploma thesis, Faculty of Mathematics and Physics, Charles University, Prague, 1975.Google Scholar
- 7.Karpiński, M., this volume pp. 273–279.Google Scholar
© Springer-Verlag Berlin Heidelberg 1975