Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
N. Abe, M. Mizumoto, J. Toyoda, and K. Tanaka, “Web grammars and several graphs,”J. Comput. Syst. Sci. 7:37–65 (1973).
A. V. Aho and J. D. Ullman,The Theory of Parsing, Translation and Compiling, Vol. 1 (Prentice-Hall, Englewood Cliffs, New Jersey, 1972).
C. R. Cook, “First order graph grammars,”SIAM J. Comput. 3:90–99 (1974).
S. Ginsburg,The Mathematical Theory of Context-free Languages (McGraw-Hill, New York, 1966).
S. Ginsburg and S. Griebach, “Abstract Families of Languages,” inStudies in Abstract Families of Languages, Am. Math. Soc. Memoir No.87, 1–32 (1969).
S. Ginsburg and E. H. Spanier, “Bounded ALGOL-like languages,”Trans. Am. Math. Soc. 113:333–368 (1964).
S. Ginsburg and E. H. Spanier, “Bounded regular sets,”Proc. Am. Math. Soc. 17:1043–1049 (1966).
J. Goldstine, “Bounded AFLs,”Quarterly Report No. 40, Institute for Computer Research, University of Chicago (1974).
J. Goldstine, “Substitution and bounded languages,”J. Comput. Syst. Sci. 6:9–29 (1972).
U. G. Montanari, “Separable graphs, planar graphs and web grammars,”Inf. Control 16:243–267 (1970).
T. Pavlidis, “Linear and context-free graph grammars,”J. Assoc. Comput. Mach. 19:11–22 (1972).
T. W. Pratt, “Pair grammars, graph languages and string-to-graph translations,”J. Comput. Syst. Sci. 5:560–595 (1971).
K. B. Salomon, “The decidability of a mapping problem for generalized sequential machines with final states,”J. Comput. Syst. Sci. 10:200–218 (1975).
E. Shamir, “On sequential languages and two classes of regular events,”Z. Phonetik, Sprach. Kommun. 18:61–69 (1965).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Salomon, K.B. String and graph grammar characterizations of bounded regular languages. International Journal of Computer and Information Sciences 7, 1–10 (1978). https://doi.org/10.1007/BF00991938
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF00991938