Amounts of nondeterminism in finite automata-Reference-Cited by-同舟云学术

Amounts of nondeterminism in finite automata

Published:1980-02 Issue:2 Volume:13 Page:199-204
ISSN:0001-5903
Container-title:Acta Informatica
language:en
Short-container-title:Acta Informatica

Author:

Kintala Chandra M. R.,Wotschke Detlef

Publisher

Springer Science and Business Media LLC

Subject

Computer Networks and Communications,Information Systems,Software

Link

http://link.springer.com/content/pdf/10.1007/BF00263994.pdf

Reference4 articles.

1. Kintala, C.M.R., Wotschke, D.: Amounts of Nondeterminism in Finite Automata, Pennsylvania State University,Technical Report CS78-11, 1978

2. Mańdl, R.: Precise Bounds Associated with Subset Construction of Various Classes of Nondeterministic Finite Automata, Princeton Conference on System Sciences, 1973

3. Meyer, A.R., Fischer, M.J.: Economics of Description by Automata, Grammars and Formal Systems, Proceedings of 12th SWAT Symposium, pp. 188–191, 1971

4. Rabin, M.D., Scott, D.: Finite Automata and Decision Problems, IBM J. of Research and Development, 3, 114–125 (1959)

Cited by 52 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Maximal Existential and Universal Width;Scientific Annals of Computer Science;2023-05-29

2. Branching Measures and Nearly Acyclic NFAs;International Journal of Foundations of Computer Science;2019-09

3. Worst Case Branching and Other Measures of Nondeterminism;International Journal of Foundations of Computer Science;2017-04

4. Ambiguity, Nondeterminism and State Complexity of Finite Automata;Acta Cybernetica;2017

5. Closure properties and descriptional complexity of deterministic regular expressions;Theoretical Computer Science;2016-05