Add to ORKGSome lower bound results are presented that separate the language classes accepted by certain types of nonforgetting restarting automata or CD-systems of restarting automata from each other.
Several types of systems of parallel communicating restarting automata are introduced and ...
We study cooperating distributed systems (CD-systems) of stateless deterministic restartin...
AbstractThe descriptional complexity of restarting automata is investigated. We distinguish the clas...
AbstractIn the literature various notions of monotonicity for restarting automata have been studied....
It is known that the weakly monotone restarting automata accept exactly the growing context-sensitiv...
Restarting automata were introduced as a model for analysis by reduction which is a linguistically m...
This paper presents a study on lookahead hierarchies for restarting automata with auxiliary symbols....
AbstractA restarting automaton processes a given word by executing a sequence of local simplificatio...
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...
In the literature various notions of (non-) monotonicity of restarting automata have been studied. H...
Restarting automata were introduced as a model for analysis by reduction which is a linguistically m...
The restarting automaton is a restricted model of computation that was introduced by Jancar et al. t...
AbstractThe restarting automaton is a restricted model of computation that was introduced by Jančar ...
AbstractThe class of growing context-sensitive languages (GCSL) was proposed as a naturally defined ...
Several types of systems of parallel communicating restarting automata are introduced and ...
We study cooperating distributed systems (CD-systems) of stateless deterministic restartin...
AbstractThe descriptional complexity of restarting automata is investigated. We distinguish the clas...
AbstractIn the literature various notions of monotonicity for restarting automata have been studied....
It is known that the weakly monotone restarting automata accept exactly the growing context-sensitiv...
Restarting automata were introduced as a model for analysis by reduction which is a linguistically m...
This paper presents a study on lookahead hierarchies for restarting automata with auxiliary symbols....
AbstractA restarting automaton processes a given word by executing a sequence of local simplificatio...
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...
In the literature various notions of (non-) monotonicity of restarting automata have been studied. H...
Restarting automata were introduced as a model for analysis by reduction which is a linguistically m...
The restarting automaton is a restricted model of computation that was introduced by Jancar et al. t...
AbstractThe restarting automaton is a restricted model of computation that was introduced by Jančar ...
AbstractThe class of growing context-sensitive languages (GCSL) was proposed as a naturally defined ...
Several types of systems of parallel communicating restarting automata are introduced and ...
We study cooperating distributed systems (CD-systems) of stateless deterministic restartin...
AbstractThe descriptional complexity of restarting automata is investigated. We distinguish the clas...