Cut Hierarchies for Restarting Automata and Marcus t-Contextual Grammars
نویسندگان
چکیده
t-contextual grammars with regular selection are considered for which all t insertions are performed in the same neighbourhood. The languages generated by these grammars are accepted by restarting automata with cut-index t. Here the classes of languages accepted by certain variants of restarting automata with limited cut-index are studied.
منابع مشابه
On h-Lexicalized Restarting Automata
Following some previous studies on restarting automata, we introduce a refined model – the hlexicalized restarting automaton (h-RLWW). We argue that this model is useful for expressing lexicalized syntax in computational linguistics. We compare the input languages, which are the languages traditionally considered in automata theory, to the so-called basic and h-proper languages, which are (impl...
متن کاملTwo infinite hierarchies of languages defined by branching grammars
Two types of branching grammars are introduced inspired from Havel's works about branching automata. They naturally define two infinite hierarchies into the family of regular, respectively, linear languages. Homomorphic characterisations of regular and linear languages >n terms of branching languages are obtained. Finally, the relations between branching grammars and contextual grammars of [5] ...
متن کاملRestarting Automata and Variants of j-Monotonicity
In the literature various notions of (non-) monotonicity of restarting automata have been studied. Here we introduce two new variants of (non-) monotonicity for restarting automata and for two-way restarting automata: left (non-) monotonicity and right-left (non-) monotonicity. It is shown that for the various types of deterministic and nondeterministic (two-way) restarting automata without aux...
متن کاملHierarchies of weakly monotone restarting automata
It is known that the weakly monotone restarting automata accept exactly the growing contextsensitive langauges. 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.
متن کاملLookahead Hierarchies of Restarting Automata
The restarting automaton is a special kind of the linear bounded automaton with a read/write window of fixed length. It works in cycles, reducing the length of the actual word in each cycle. We study several versions of restarting automata and we show several hierarchies of language classes recognized by them with respect to the size of the read/write-window.
متن کامل