Add to ORKGRestarting automata were introduced as a model for analysis by reduction which is a linguistically motivated method for checking correctness of a sentence. The thesis studies locally restricted models of restarting automata which (to the contrary of general restarting automata) can modify the input tape based only on a limited context. The investigation of such restricted models is easier than in the case of general restarting automata. Moreover, these models are effectively learnable from positive samples of reductions and their instructions are human readable. Powered by TCPDF (www.tcpdf.org
AbstractThe descriptional complexity of restarting automata is investigated. We distinguish the clas...
We study the inference of models of the analysis by reduction that forms an important tool for parsi...
AbstractA restarting automaton processes a given word by executing a sequence of local simplificatio...
Restarting automata were introduced as a model for analysis by reduction which is a linguistically m...
Restarting automata are linguistically motivated models of automata that can be used e.g. in checkin...
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 ...
Analysis by reduction is a linguistically motivated method for checking correctness of a sentence. I...
In the present work is discussed the problem of learning of analysis by reduction. Analysis by reduc...
Restarting automata are linguistically motivated models for language representation. The main goal o...
ABSTRACT The degree of monotonicity can serve as a parameter for the syntactic analysis by a general...
This thesis deals with reducing automata, their normalization, and their application for a (robust) ...
Abstract A special type of linear bounded automata, called deleting automata with a restart operatio...
This paper presents a study on lookahead hierarchies for restarting automata with auxiliary symbols....
Some lower bound results are presented that separate the language classes accepted by certain types ...
AbstractThe descriptional complexity of restarting automata is investigated. We distinguish the clas...
We study the inference of models of the analysis by reduction that forms an important tool for parsi...
AbstractA restarting automaton processes a given word by executing a sequence of local simplificatio...
Restarting automata were introduced as a model for analysis by reduction which is a linguistically m...
Restarting automata are linguistically motivated models of automata that can be used e.g. in checkin...
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 ...
Analysis by reduction is a linguistically motivated method for checking correctness of a sentence. I...
In the present work is discussed the problem of learning of analysis by reduction. Analysis by reduc...
Restarting automata are linguistically motivated models for language representation. The main goal o...
ABSTRACT The degree of monotonicity can serve as a parameter for the syntactic analysis by a general...
This thesis deals with reducing automata, their normalization, and their application for a (robust) ...
Abstract A special type of linear bounded automata, called deleting automata with a restart operatio...
This paper presents a study on lookahead hierarchies for restarting automata with auxiliary symbols....
Some lower bound results are presented that separate the language classes accepted by certain types ...
AbstractThe descriptional complexity of restarting automata is investigated. We distinguish the clas...
We study the inference of models of the analysis by reduction that forms an important tool for parsi...
AbstractA restarting automaton processes a given word by executing a sequence of local simplificatio...