Funder
Japan Society for the Promotion of Science
Subject
General Computer Science,Theoretical Computer Science
Reference13 articles.
1. Restarting automata;Jančar,1995
2. On input-revolving deterministic and nondeterministic finite automata;Bensch;Inf. Comput.,2009
3. Jumping finite automata;Meduna;Int. J. Found. Comput. Sci.,2012
4. Finite-state acceptors with translucent letters;Nagy,2011
5. One-way jumping finite automata;Chigahara;Int. J. Found. Comput. Sci.,2016
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Proceedings 14th International Workshop on Non-Classical Models of Automata and Applications;Electronic Proceedings in Theoretical Computer Science;2024-09-11
2. Jumping Automata over Infinite Words;Theory of Computing Systems;2024-09-10
3. Jumping Automata over Infinite Words;Developments in Language Theory;2023
4. Sweep Complexity Revisited;Implementation and Application of Automata;2023