Merging two Hierarchies of Internal Contextual Grammars with Subregular Selection

Bianca Truthe

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.

In Benedek Nagy and Rudolf Freund: Proceedings of the 13th International Workshop on Non-Classical Models of Automata and Applications (NCMA 2023), Famagusta, North Cyprus, 18th-19th September, 2023, Electronic Proceedings in Theoretical Computer Science 388, pp. 125–139.
Published: 15th September 2023.

ArXived at: https://dx.doi.org/10.4204/EPTCS.388.12 bibtex PDF
References in reconstructed bibtex, XML and HTML format (approximated).
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org