On basic properties of jumping finite automata
V Vorel - International Journal of Foundations of Computer …, 2018 - World Scientific
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 …
of Meduna and Zemek [7]. The open questions about basic closure properties are solved …
Matrix insertion–deletion systems
We investigate in this article the operations of insertion and deletion working in a matrix-
controlled manner. We show that this allows to us strictly increase the computational power …
controlled manner. We show that this allows to us strictly increase the computational power …
Random context and semi-conditional insertion-deletion systems
In this article we introduce the operations of insertion and deletion working in random
context and semi-conditional modes. We show that conditional application of insertion and …
context and semi-conditional modes. We show that conditional application of insertion and …
Two results on discontinuous input processing
V Vorel - Descriptional Complexity of Formal Systems: 18th IFIP …, 2016 - Springer
First, we show that universality and other properties of general jumping finite automata are
undecidable, which answers questions asked by Meduna and Zemek in 2012 [12]. Second …
undecidable, which answers questions asked by Meduna and Zemek in 2012 [12]. Second …
About one-sided one-symbol insertion-deletion P systems
In this article we consider insertion-deletion P systems inserting or deleting one symbol in
one or two symbol (s) left context (more precisely of size (1, 2, 0; 1, 1, 0) and (1, 1, 0; 1, 2, 0)) …
one or two symbol (s) left context (more precisely of size (1, 2, 0; 1, 1, 0) and (1, 1, 0; 1, 2, 0)) …
Adding matrix control: insertion-deletion systems with substitutions III
M Vu, H Fernau - Algorithms, 2021 - mdpi.com
Insertion-deletion systems have been introduced as a formalism to model operations that
find their counterparts in ideas of bio-computing, more specifically, when using DNA or RNA …
find their counterparts in ideas of bio-computing, more specifically, when using DNA or RNA …
Insertion-deletion systems with substitutions I
M Vu, H Fernau - Beyond the Horizon of Computability: 16th Conference …, 2020 - Springer
With good biological motivation, we add substitutions as a further type of operations to (in
particular, context-free) insertion-deletion systems. This way, we obtain new …
particular, context-free) insertion-deletion systems. This way, we obtain new …
Insertion-deletion with substitutions II
M Vu, H Fernau - Descriptional Complexity of Formal Systems: 22nd …, 2020 - Springer
We discuss substitutions as a further type of operations, added to (in particular, one-sided)
insertion-deletion systems. This way, we obtain new characterizations of classes of context …
insertion-deletion systems. This way, we obtain new characterizations of classes of context …
Random context and semi-conditional insertion-deletion systems
In this article we introduce the operations of insertion and deletion working in a random-
context and semi-conditional manner. We show that the conditional use of rules strictly …
context and semi-conditional manner. We show that the conditional use of rules strictly …
Synchronization, Road Coloring, and Jumps in Finite Automata
V Vorel - 2015 - dspace.cuni.cz
Multiple original results in the theory of automata and formal languages are presented,
dealing mainly with combinatorial problems and complexity questions related to reset words …
dealing mainly with combinatorial problems and complexity questions related to reset words …