On measuring nondeterminism in regular languages
Information and Computation
Growing context-sensitive languages and Church-Rosser languages
Information and Computation
On monotonic automata with a restart operation
Journal of Automata, Languages and Combinatorics
Measuring Nondeterminism in Pushdown Automata
STACS '97 Proceedings of the 14th Annual Symposium on Theoretical Aspects of Computer Science
A grammar based approach to a grammar checking of free word order languages
COLING '94 Proceedings of the 15th conference on Computational linguistics - Volume 2
A measure for the degree of nondeterminism of context-free languages
CIAA'07 Proceedings of the 12th international conference on Implementation and application of automata
Modeling syntax of free word-order languages: dependency analysis by reduction
TSD'05 Proceedings of the 8th international conference on Text, Speech and Dialogue
Parallel Communicating Grammar Systems with Regular Control
CAI '09 Proceedings of the 3rd International Conference on Algebraic Informatics
Parallel communicating grammar systems with regular control and skeleton preserving FRR automata
Theoretical Computer Science
| Hi-index | 0.00 |
We study proper languages of (strongly) lexicalized FRR-automata, which are a theoretical model for the analysis by reduction that is used in structural analysis of (natural) languages. We obtain two variants of a two-dimensional hierarchy of language classes based on two types of constraints: (1) the number of rewrite operations per cycle, and (2) the number of occurrences of auxiliary symbols (categories) in the sentences (words) of the corresponding characteristic language. The former type of constraints models non-local valences (dependencies), and the latter type models the use of categories during syntactic disambiguation of the sentence being analyzed.