Publisher
Springer International Publishing
Reference15 articles.
1. Bordihn, H., Holzer, M., Kutrib, M.: Determination of finite automata accepting subregular languages. Theor. Comp. Sci. 410, 3209–3222 (2009)
2. Caron, P.: Families of locally testable languages. Theor. Comp. Sci. 242, 361–376 (2000)
3. books@ocg.at, Band;J Dassow,2012
4. Garey, M.R., Johnson, D.S.: Computers and Intractability. A Guide to the Theory of NP-Completeness. Freeman, San Francisco (1979)
5. Holzer, M., Kutrib, M.: Descriptional and computational complexity of finite automata - a survey. Inform. Comp. 209, 456–470 (2011)
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Reversibility for stateless ordered RRWW-automata;Acta Informatica;2021-07-19
2. On Deterministic Ordered Restart-Delete Automata;Developments in Language Theory;2018
3. A Pumping Lemma for Ordered Restarting Automata;Descriptional Complexity of Formal Systems;2017
4. Some classes of rational functions for pictures;RAIRO - Theoretical Informatics and Applications;2016-10
5. On Ordered RRWW-Automata;Developments in Language Theory;2016