Funder
Russian Science Foundation
Subject
Computational Theory and Mathematics,Computer Science Applications,Information Systems,Theoretical Computer Science
Reference21 articles.
1. State-complexity of finite-state devices, state compressibility and incompressibility;Birget;Math. Syst. Theory,1993
2. Converting two-way nondeterministic unary automata into simpler automata;Geffert;Theor. Comput. Sci.,2003
3. Complementing two-way finite automata;Geffert;Inf. Comput.,2007
4. One-way simulation of two-way finite automata over small alphabets;Geffert,2013
5. Algebraic enumeration;Gessel,1996
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献