String and graph grammar characterizations of bounded regular languages


Two grammatical characterizations of the bounded regular languages are presented: one in terms of graph grammars, the other using string grammars. First it is shown that a class of state graphs recognizing the bounded regular languages can be generated by a particular second-order contextfree graph grammar. Next we call uniquely recursive a right-linear (string) grammar having at most one right-recursive production for each of its nonterminals. It is then established that the class of languages generated by uniquely recursive, sequential right-linear grammars is exactly the bounded regular languages. Some comments on the relationship between string and graph grammars are made.

DOI: 10.1007/BF00991938

1 Figure or Table

Cite this paper

@article{Salomon1978StringAG, title={String and graph grammar characterizations of bounded regular languages}, author={Kenneth B. Salomon}, journal={International Journal of Computer & Information Sciences}, year={1978}, volume={7}, pages={1-10} }