Affiliation:
1. Department of Theoretical Computer Science and Mathematical Logic, Charles University, Malostranské nám. 25, Prague, Czech Republic
Abstract
We complete the initial study of jumping finite automata, which was started in a former article of Meduna and Zemek [7]. The open questions about basic closure properties are solved. Besides this, we correct erroneous results presented in the article. Finally, we point out important relations between jumping finite automata and some other models studied in the literature.
Publisher
World Scientific Pub Co Pte Lt
Subject
Computer Science (miscellaneous)
Cited by
12 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献