Skip to main content
SpringerLink
Log in

Characterizations of transductions defined by abstract families of transducers

  • Published:
Mathematical systems theory Aims and scope Submit manuscript

Abstract

Two characterizations of transductions defined by abstract families of transducers are presented. The first characterization is in terms of languages defined by acceptors derived from the transducers when the output structure is removed. The second characterization is in terms of sets of pairs of words satisfying certain closure operations.

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. A. V. Aho, J. E. Hopcroft, andJ. D. Ullman, A general theory of translations,Math. Systems Theory 3 (1969), 193–221.

    Google Scholar 

  2. A. V. Aho andJ. D. Ullman, A characterization of two-way deterministic classes of languages,IEEE Conference Record of 1969 Tenth Annual Symposium on Switching Automata Theory, pp. 231–239.

  3. W. J. Chandler, Abstract families of deterministic languages,Proc. ACM Symposium on Theory of Computing, pp. 21–30, Marina del Rey, California, 1969.

    Google Scholar 

  4. J. E. Hopcroft andJ. D. Ullman, An approach to a unified theory of automata,Bell System Tech. J. 46 (1967), 1793–1829.

    Google Scholar 

  5. C. C. Elgot andJ. E. Mezei, On relations defined by generalized finite automata,IBM J. Res. Develop. 9 (1965), 47–68.

    Google Scholar 

  6. S. Ginsburg,The Mathematical Theory of Context-free Languages, McGraw-Hill, New York, 1966.

    Google Scholar 

  7. S. Ginsburg andS. A. Greibach, Abstract families of languages,IEEE Conference Record of 1967 Eighth Annual Symposium on Switching and Automata Theory, pp. 128–139.

  8. S. Ginsburg, S. A. Greibach andM. A. Harrison, One-way stack automata.J. Assoc. Comput. Mach. 14 (1967), 339–418.

    Google Scholar 

  9. S. Ginsburg andG. Rose, Operations which preserve definability in languages,J. Assoc. Comput. Mach. 10 (1963), 175–195.

    Google Scholar 

  10. S. Ginsburg andG. Rose, Preservation of languages by transducers,Information and Control 9 (1966), 153–176.

    Google Scholar 

  11. S. A. Greibach, An infinite hierarchy of context-free languages,J. Assoc. Comput. Mach. 16 (1969), 91–106.

    Google Scholar 

  12. M. A. Harrison andO. H. Ibarra, Multi-tape and multi-head pushdown automata,Information and Control 13 (1968), 433–470.

    Google Scholar 

  13. O. H. Ibarra, Generalizations of pushdown automata. Ph.D. Thesis, University of California, Berkeley, 1967.

    Google Scholar 

  14. M. O. Rabin andD. Scott, Finite automata and their decision problems,IBM J. Res. Develop. 3 (1959), 114–125.

    Google Scholar 

  15. A. L. Rosenberg, Nonwriting extensions of finite automata. Ph.D. Thesis, Harvard University, 1965.

Download references

Author information

Authors and Affiliations

  1. Department of Computer, Information, and Control Sciences Institute of Technology, University of Minnesota, 55455, Minneapolis, Minnesota, USA

    Oscar H. Ibarra

Authors
  1. Oscar H. Ibarra
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Ibarra, O.H. Characterizations of transductions defined by abstract families of transducers. Math. Systems Theory 5, 271–281 (1971). https://doi.org/10.1007/BF01694183

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Keywords

Search

Navigation