Skip to main content
SpringerLink
Log in

One-way acceptors and languages

  • Published:
International Journal of Computer & Information Sciences Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

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.

  3. S. Ginsburg, S. Greibach, and J. Hopcroft, “Pre-AFL,”Memoirs Am. Math. Soc. 1969(87):41–51.

  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 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Youngstown State University, Youngstown, Ohio

    Eugene S. Santos

Authors
  1. Eugene S. Santos
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

This work was supported in part by the University Research Council of Youngstown State University, Youngstown, Ohio.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Santos, E.S. One-way acceptors and languages. International Journal of Computer and Information Sciences 3, 141–151 (1974). https://doi.org/10.1007/BF00976640

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00976640

Keywords

Search

Navigation