Abstract
The operations of a homomorphic equality and an inverse homomorphic equality are introduced. These operations are obtained from n-tuples of homomorphisms, incorporating the notion of an equality set. For one-tuples they are a homomorphism and an inverse homomorphism. Homomorphic equality and inverse homomorphic equality operations provide simple and uniform characterizations of the recursively enumerable sets in terms of the regular sets, and of classes H(L λ MR) in terms of L. These characterizations resemble the Chomsky-Schützenberger theorem for context-free languages.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
R.V. Book, Simple representations of certain classes of languages. J. Assoc. Comput. Mach. 25 (1978), 23–31.
R.V. Book and F.J. Brandenburg, Equality sets and complexity classes. SIAM J. Comput. 9 (1980), 729–743.
R.V. Book and S.A. Greibach, Quasi-realtime languages. Math. Systems Theory 4 (1970), 97–111.
R.V. Book, S.A. Greibach, and C. Wrathall, Reset machines. J. Comput. System Sci. 19 (1979), 256–276.
R.V. Book and M. Nivat, Linear languages and the intersection closure of classes of languages. SIAM J. Comput. 7 (1978), 167–177.
R.V. Book, M. Nivat, and M. Paterson, Reversal-bounded acceptors and inter-sections of linear languages. SIAM J. Comput. 3 (1974), 283–295.
F.J. Brandenburg, Multiple equality sets and Post machines. J. Comput. System Sci. 21 (1980), 292–316.
F.J. Brandenburg, Unary multiple equality sets: the languages of rational matrices. Inform. Contr. (in press).
F.J. Brandenburg, Homomorphic equality operations on languages. Habilitationsschrift, Universität Bonn (1981).
K. Culik II, A purely homomorphic characterization of recursively enumerable sets. J. Assoc. Comput. Mach. 26 (1979), 345–350.
K. Culik II and H.A. Maurer, On simple representations of language families. RAIRO Theoret. Informatics 13 (1979), 241–250.
J. Engelfriet and G. Rozenberg, Equality sets and fixed point languages. Inform Contr. 43 (1979), 20–49.
J. Engelfriet and G. Rozenberg, Fixed point languages, equality languages and representations of recursively enumerable languages. J. Assoc. Comput. Mach. 27 (1980), 499–518.
S. Ginsburg, “Algebraic and automata-theoretic properties of formal languages”. North-Holland, Amsterdam, 1975.
A. Salomaa, Equality sets for homomorphisms of free monoids. Acta Cybernetica 4 (1978), 127–139.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1982 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Brandenburg, FJ. (1982). Extended Chomsky-Schützenberger theorems. In: Nielsen, M., Schmidt, E.M. (eds) Automata, Languages and Programming. ICALP 1982. Lecture Notes in Computer Science, vol 140. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0012759
Download citation
DOI: https://doi.org/10.1007/BFb0012759
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-11576-2
Online ISBN: 978-3-540-39308-5
eBook Packages: Springer Book Archive