Publisher
Springer Berlin Heidelberg
Reference8 articles.
1. J. Goldstine, C.M.R. Kintala, and D. Wotschke, “On measuring nondeterminism in regular languages”, manuscript.
2. M.A. Harrison, Introduction to Formal Language Theory, Addison-Wesley, Reading, MA, 1978.
3. C.M.R. Kintala and P.C. Fischer, “Computations with a restricted number of nondeterministic steps”, Proceedings of the 9th ACM Symposium on the Theory of Computing, (1977) 178–185.
4. C.M.R. Kintala and D. Wotschke, “Amounts of nondeterminism in finite automata”, Acta Informatica 13 (1980) 199–204.
5. M. Li and P. Vitanyi, “A new approach to formal language theory by Kolmogorov complexity”, Proceedings of the 16th ICALP, Lecture Notes in Computer Science 372 (1989) 506–520.
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Pushdown automata with bounded nondeterminism and bounded ambiguity;LATIN '95: Theoretical Informatics;1995
2. Pumping and pushdown machines;RAIRO - Theoretical Informatics and Applications;1994