International audienceRecently, new types of non-sequential machine models have been introduced and studied, such as jumping automata and one-way jumping automata. We study the abilities and limitations of automata with these two jumping modes of tape heads with respect to how they affect the class of accepted languages. We give several methods to determine whether a language is accepted by a machine with jumping mode. We also consider relationships among the classes of languages defined by the new machines and their classical counterparts
AbstractWe continue here the investigation of P automata, in their non-extended case, a class of dev...
This paper introduces and discusses automata systems as a new way for formal languages processing. I...
International audienceFirst, we show that universality and other properties of general jumping finit...
Recently, new types of non-sequential machine models have been introduced and studied, such as jumpi...
The main goal of this thesis is introduction and investigation of extended version of jumping automa...
The recently introduced model of one-way jumping finite automata skips over letters for which it doe...
International audienceRight one-way jumping finite automata are deterministic devices that process t...
This thesis proposes alternating jumping automata and investigates some of their properties and expr...
The present paper modifies and studies jumping finite automata so they always perform two simultaneo...
Deterministic 1-way stack automata (SA) are generalized to include jumps, and it is established that...
International audienceLimited automata are single-tape Turing machines with severe rewriting restric...
This paper is concerned with demonstration of newly investigated jumping finite automata. Unlike con...
The bachelor's thesis builds upon the study of jumping finite automata and introduces jumping finite...
In this paper, we extend a newly introduced concept called the jumping nite automata for accepting ...
We present two restricted versions of one-tape Turing machines. Both characterize the class of conte...
AbstractWe continue here the investigation of P automata, in their non-extended case, a class of dev...
This paper introduces and discusses automata systems as a new way for formal languages processing. I...
International audienceFirst, we show that universality and other properties of general jumping finit...
Recently, new types of non-sequential machine models have been introduced and studied, such as jumpi...
The main goal of this thesis is introduction and investigation of extended version of jumping automa...
The recently introduced model of one-way jumping finite automata skips over letters for which it doe...
International audienceRight one-way jumping finite automata are deterministic devices that process t...
This thesis proposes alternating jumping automata and investigates some of their properties and expr...
The present paper modifies and studies jumping finite automata so they always perform two simultaneo...
Deterministic 1-way stack automata (SA) are generalized to include jumps, and it is established that...
International audienceLimited automata are single-tape Turing machines with severe rewriting restric...
This paper is concerned with demonstration of newly investigated jumping finite automata. Unlike con...
The bachelor's thesis builds upon the study of jumping finite automata and introduces jumping finite...
In this paper, we extend a newly introduced concept called the jumping nite automata for accepting ...
We present two restricted versions of one-tape Turing machines. Both characterize the class of conte...
AbstractWe continue here the investigation of P automata, in their non-extended case, a class of dev...
This paper introduces and discusses automata systems as a new way for formal languages processing. I...
International audienceFirst, we show that universality and other properties of general jumping finit...