Operational State Complexity and Decidability of Jumping Finite Automata-Reference-Cited by-同舟云学术

Operational State Complexity and Decidability of Jumping Finite Automata

Published:2017 Issue: Volume: Page:96-108
ISSN:0302-9743
Container-title:Developments in Language Theory
language:
Short-container-title:

Author:

Beier Simon,Holzer Markus,Kutrib Martin

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-319-62809-7_6

Reference19 articles.

1. Baeza-Yates, R., Ribeiro-Neto, B.: Modern Information Retrieval: The Concepts and Technology Behind Search. Addison-Wesley, New York (2011)

2. Beier, S., Holzer, M., Kutrib, M.: On the descriptional complexity of operations on semilinear sets. IFIG Research Report 1701, Institut für Informatik, Universität Giessen (2017). http://www.informatik.uni-giessen.de/reports/Report1701.pdf

3. Dickson, L.E.: Finiteness of the odd perfect and primitive abundant numbers with n distinct prime factors. Am. J. Math. 35, 413–422 (1913)

4. Lecture Notes in Computer Science;H Fernau,2015

5. Fernau, H., Paramasivan, M., Schmid, M.L., Vorel, V.: Characterization and complexity results on jumping finite automata. Theor. Comput. Sci. 679, 31–52 (2017)

Cited by 10 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A jumping $$5'\rightarrow 3'$$ Watson–Crick finite automata model;Acta Informatica;2022-01-24

2. The effect of jumping modes on various automata models;Natural Computing;2021-03-09

3. Nondeterministic right one-way jumping finite automata;Information and Computation;2021-01

4. Decidability of Right One-Way Jumping Finite Automata;International Journal of Foundations of Computer Science;2020-09

5. Properties of right one-way jumping finite automata;Theoretical Computer Science;2019-12