Publisher
Springer Science and Business Media LLC
Subject
General Computer Science,General Computer Science
Reference10 articles.
1. V. M. Glushkov, Abstract automaton theory?, Usp. matem. nauk,16, no. 5(101), Moscow (1961).
2. M. Hall, The Theory of Groups [Russian translation], IL, Moscow (1962).
3. M. Harrison, ?A census of finite automata,? Canadian J. Math.,17, no. 1 (1965).
4. C. E. Radke, ?Enumeration of strongly connected sequential machines,? Information and Control,8, no. 4 (1965).
5. J. Riordan, ?Enumeration of linear graphs for mappings of finite sets,? Annals of Math. Statistics,33, no. 1 (1962).
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Random Deterministic Automata;Mathematical Foundations of Computer Science 2014;2014
2. IMPROVED BOUNDS ON THE NUMBER OF AUTOMATA ACCEPTING FINITE LANGUAGES;International Journal of Foundations of Computer Science;2004-02
3. On Enumeration of Müller Automata;Developments in Language Theory;2003
4. Improved Bounds on the Number of Automata Accepting Finite Languages;Developments in Language Theory;2003