Automata: Theoretic Aspects of Formal Power Series
Automata: Theoretic Aspects of Formal Power Series
On the complexity of regular-grammars with integer attributes
Journal of Computer and System Sciences
Hi-index | 5.23 |
We define two natural properties of context-free grammars. The first property generalizes linearity and the second property strengthens nonlinearity. A language generated by an unambiguous grammar of the first type is called the language with weak linear structure and a language generated by an unambiguous grammar of the second type is called the language with strong nonlinear structure. Our main theorem states that the family of unambiguous grammars generating languages with weak linear structure and the family of unambiguous grammars generating languages with strong nonlinear structure are effectively separable.