Abstract
The standard notion of acceptance for nondeterministic automata will be extended to characterize Boolean closures of families of languages. The notions of Cutpoint-pda (lba)-languages and Weighted-pda (lba)-languages will be introduced. A problem equivalent to the complementation problem for nondeterministic context-sensitive languages will be stated. The complements of the (nondeterministic) context-sensitive languages form a principal AFL.
The research in this paper was supported in part by the National Science Foundation under Grant GJ-803.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Ginsburg, S., The Mathematical Theory of Context-Free Languages, McGraw-Hill, New York, (1966).
Ginsburg, S., Greibach, S. and Hopcroft, J., Studies in Abstract Families of Languages, Memoirs of the AMS, No. 87, (1969).
Rosenberg, A.L., "Multitape Finite Automata with Rewind Instructions", JCSS, 1 (1967), 299–315.
Wegbreit, B., "A Generator of Context-Sensitive Languages", JCSS, 3 (1969), 456–461.
Wotschke, D., "The Boolean Closures of the Deterministic and Nondeterministic Context-Free Languages", will appear in Lecture Notes in Economics and Mathematical Systems, Springer-Verlag, New York, (1973).
Rights and permissions
Copyright information
© 1973 Springer-Verlag
About this paper
Cite this paper
Wotschke, D. (1973). A characterization of boolean closures of families of languages. In: GI Gesellschaft für Informatik e. V. 1. Fachtagung über Automatentheorie und Formale Sprachen. Lecture Notes in Computer Science, vol 2. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0039154
Download citation
DOI: https://doi.org/10.1007/BFb0039154
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-06527-2
Online ISBN: 978-3-540-37826-6
eBook Packages: Springer Book Archive