It is known that the weakly monotone restarting automata accept exactly the growing context-sensitive languages. We introduce a measure on the degree of weak monotonicity and show that the language classes obtained in this way form strict hierarchies for the various types of deterministic and nondeterministic restarting automata without auxiliary symbols
In this study, we first introduce several problems related to finding reset words for deterministic ...
The restarting automaton is a restricted model of computation that was introduced by Jancar et al. t...
In this study, we first introduce several problems related to finding reset words for deterministic ...
It is known that the weakly monotone restarting automata accept exactly the growing context-sensitiv...
AbstractIn the literature various notions of monotonicity for restarting automata have been studied....
In the literature various notions of (non-) monotonicity of restarting automata have been studied. H...
Abstract We consider several classes of rewriting automata with a restart operation and the monotoni...
We consider several classes of rewriting automata with a restart operation and the monotonicity prop...
This paper presents a study on lookahead hierarchies for restarting automata with auxiliary symbols....
Abstract. It is known that for (right-) monotone deterministic one-way restarting automata, the use ...
ABSTRACT The degree of monotonicity can serve as a parameter for the syntactic analysis by a general...
Some lower bound results are presented that separate the language classes accepted by certain types ...
AbstractThe t-contextual grammars are generalizations of Marcus contextual grammars, which insert t ...
Here we show that for monotone RWW- (and RRWW-) automata, window size two is sufficient, both in the...
AbstractIn an earlier paper, we have studied reset words for synchronizing automatawhose states admi...
In this study, we first introduce several problems related to finding reset words for deterministic ...
The restarting automaton is a restricted model of computation that was introduced by Jancar et al. t...
In this study, we first introduce several problems related to finding reset words for deterministic ...
It is known that the weakly monotone restarting automata accept exactly the growing context-sensitiv...
AbstractIn the literature various notions of monotonicity for restarting automata have been studied....
In the literature various notions of (non-) monotonicity of restarting automata have been studied. H...
Abstract We consider several classes of rewriting automata with a restart operation and the monotoni...
We consider several classes of rewriting automata with a restart operation and the monotonicity prop...
This paper presents a study on lookahead hierarchies for restarting automata with auxiliary symbols....
Abstract. It is known that for (right-) monotone deterministic one-way restarting automata, the use ...
ABSTRACT The degree of monotonicity can serve as a parameter for the syntactic analysis by a general...
Some lower bound results are presented that separate the language classes accepted by certain types ...
AbstractThe t-contextual grammars are generalizations of Marcus contextual grammars, which insert t ...
Here we show that for monotone RWW- (and RRWW-) automata, window size two is sufficient, both in the...
AbstractIn an earlier paper, we have studied reset words for synchronizing automatawhose states admi...
In this study, we first introduce several problems related to finding reset words for deterministic ...
The restarting automaton is a restricted model of computation that was introduced by Jancar et al. t...
In this study, we first introduce several problems related to finding reset words for deterministic ...
DOI
Add to ORKG