Abstract
We continue our investigation [S. Beier, M. Holzer: Properties of right one-way jumping finite automata. In Proc. 20th DCFS, number 10952 in LNCS, 2018] on (right) one-way jumping finite automata (ROWJFA), a variant of jumping automata, which is an automaton model for discontinuous information processing. Here we focus on decision problems for ROWJFAs. It turns out that most problems such as, e.g., emptiness, finiteness, universality, the word problem and variants thereof, closure under permutation, etc., are decidable. Moreover, we show that the containment of a language within the strict hierarchy of ROWJFA permutation closed languages induced by the number of accepting states as well as whether permutation closed regular or jumping finite automata languages can be accepted by ROWJFAs is decidable, too. On the other hand, we prove that for (linear) context-free languages the corresponding ROWJFA acceptance problem becomes undecidable. Moreover, we also discuss some complexity results for the considered decision problems.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Bar-Hillel, Y., Perles, M., Shamir, E.: On formal properties of simple phrase structure grammars. Zeitschrift für Phonetik, Sprachwissenschaft und Kommunikationsforschung 14, 143–177 (1961)
Beier, S., Holzer, M.: Properties of right one-way jumping finite automata. In: Konstantinidis, S., Pighizzini, G. (eds.) DCFS 2018. LNCS, vol. 10952, pp. 11–23. Springer, Heidelberg (2018). https://doi.org/10.1007/978-3-319-94631-3_2
Beier, S., Holzer, M., Kutrib, M.: Operational state complexity and decidability of jumping finite automata. In: Charlier, É., Leroy, J., Rigo, M. (eds.) DLT 2017. LNCS, vol. 10396, pp. 96–108. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-62809-7_6
Chigahara, H., Fazekas, S., Yamamura, A.: One-way jumping finite automata. Int. J. Found. Comput. Sci. 27(3), 391–405 (2016)
Fazekas, S.Z., Yamamura, A.: On regular languages accepted by one-way jumping finite automata. In: 8th NCMA, Short Papers in books@ocg.atbooks@ocg.at, pp. 7–14, Österreichische Computer Gesellschaft, Debrecen, Hungary (2016)
Fernau, H., Paramasivan, M., Schmid, M.L.: Jumping finite automata: characterizations and complexity. In: Drewes, F. (ed.) CIAA 2015. LNCS, vol. 9223, pp. 89–101. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-22360-5_8
Fernau, H., Paramasivan, M., Schmid, M.L., Vorel, V.: Characterization and complexity results on jumping finite automata (2015). http://arxiv.org/abs/1512.00482,
Ginsburg, S., Spanier, E.H.: Bounded ALGOL-like languages. Trans. AMS 113, 333–368 (1964)
Harrison, M.A.: Introduction to Formal Language Theory. Addison-Wesley, Boston (1978)
Immerman, N.: Nondeterministic space is closed under complementation. SIAM J. Comput. 17(5), 935–938 (1988)
Kopczyński, E.: Complexity of problems of commutative grammars. Logical Methods in Computer Science, 11(1): Paper 9 (2015)
Meduna, A., Zemek, P.: Jumping finite automata. Int. J. Found. Comput. Sci. 23(7), 1555–1578 (2012)
Meduna, A., Zemek, P.: Regulated Grammars and Automata. Springer, New York (2014). https://doi.org/10.1007/978-1-4939-0369-6
Szelepcsényi, R.: The method of forced enumeration for nondeterministic automata. Acta Inform. 26(3), 279–284 (1988)
Vorel, V.: Basic properties of jumping finite automata (2015). http://arxiv.org/abs/1511.08396v2,
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer Nature Switzerland AG
About this paper
Cite this paper
Beier, S., Holzer, M. (2018). Decidability of Right One-Way Jumping Finite Automata. In: Hoshi, M., Seki, S. (eds) Developments in Language Theory. DLT 2018. Lecture Notes in Computer Science(), vol 11088. Springer, Cham. https://doi.org/10.1007/978-3-319-98654-8_9
Download citation
DOI: https://doi.org/10.1007/978-3-319-98654-8_9
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-98653-1
Online ISBN: 978-3-319-98654-8
eBook Packages: Computer ScienceComputer Science (R0)