2000 character limit reached
On the Generative Capacity of Contextual Grammars with Strictly Locally Testable Selection Languages (2208.14725v1)
Published 31 Aug 2022 in cs.FL
Abstract: We continue the research on the generative capacity of contextual grammars where contexts are adjoined around whole words (externally) or around subwords (internally) which belong to special regular selection languages. All languages generated by contextual grammars where all selection languages are elements of a certain subregular language family form again a language family. We investigate contextual grammars with strictly locally testable selection languages and compare those families to families which are based on finite, monoidal, nilpotent, combinational, definite, suffix-closed, ordered, commutative, circular, non-counting, power-separating, or union-free languages.