One-way acceptors and languages
- 24 Downloads
Abstract
In the present paper, a parallel presentation of the theories of abstract families of languages (AFL) and abstract families of deterministic languages (AFDL) is given. This is done by introducing two families of languages. One of them is the one-way nondeterministic family of languages (1NFL). A 1NFL is a family of languages closed under special marked substitution and inverse nondeterministic a-gsm mapping. The deterministic counterpart of 1NFL is 1DFL. It is shown that 1NFL and 1DFL are equivalent to AFL and AFDL, respectively. These families of languages are then used to characterize, side by side and with alternate proofs, the families of languages accepted by AFA and AFDA. Moreover, it is also shown that 1NFL and 1DFL can be used to characterize the families of languages accepted by a closed class of 1NBA and 1DBA, respectively.
Keywords
Operating System Alternate Proof Closed Class Deterministic Counterpart Parallel PresentationPreview
Unable to display preview. Download preview PDF.
References
- 1.W. J. Chandler, “Abstract families of deterministic languages,”Proc. ACM Symp. on Theory of Computing (Marina del Rey, California, 1969), 21–30.Google Scholar
- 2.S. Ginsburg and S. Greibach, “Abstract families of languages,”Memoirs Am. Math. Soc. 1969(87):1–32.Google Scholar
- 3.S. Ginsburg, S. Greibach, and J. Hopcroft, “Pre-AFL,”Memoirs Am. Math. Soc. 1969(87):41–51.Google Scholar
- 4.S. Ginsburg and J. Hopcroft, “Two-way balloon automata and AFL,”J. ACM 17:3–13 (1970).Google Scholar
- 5.J. Hopcroft and J. Ullman, “An approach to a unified theory of automata,”Bell Syst. Tech. J. 46:1793–1829 (1967).Google Scholar
- 6.G. F. Rose, “Abstract families of processors,”J. Computer Syst. Sci. 4(3):193–204 (1970).Google Scholar