1. Merging two Hierarchies of Internal Contextual Grammars with Subregular Selection
- Author
-
Truthe, Bianca
- Subjects
Computer Science - Computational Complexity ,Computer Science - Formal Languages and Automata Theory - Abstract
In this paper, we continue the research on the power of contextual grammars with selection languages from subfamilies of the family of regular languages. In the past, two independent hierarchies have been obtained for external and internal contextual grammars, one based on selection languages defined by structural properties (finite, monoidal, nilpotent, combinational, definite, ordered, non-counting, power-separating, suffix-closed, commutative, circular, or union-free languages), the other one based on selection languages defined by resources (number of non-terminal symbols, production rules, or states needed for generating or accepting them). In a previous paper, the language families of these hierarchies for external contextual grammars were compared and the hierarchies merged. In the present paper, we compare the language families of these hierarchies for internal contextual grammars and merge these hierarchies., Comment: In Proceedings NCMA 2023, arXiv:2309.07333. arXiv admin note: text overlap with arXiv:2309.02768, arXiv:2208.14725
- Published
- 2023
- Full Text
- View/download PDF