Skip to main content
SpringerLink
Log in

A rational theory of AFLs

  • Conference paper
  • First Online:
Automata, Languages and Programming (ICALP 1979)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 71))

Included in the following conference series:

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

5. References

  1. B. S. Baker and R. V. Book, Reversal-bounded multipushdown machines, Inf. and Contr. 24 (1979), 231–246.

    Google Scholar 

  2. J. H. Conway, Regular Algebra and Finite Machines, Chapman and Hall, London, 1971.

    Google Scholar 

  3. S. Eilenberg, Automata, Languages, and Machines, Vol. A, Academic Press, New York, 1974.

    Google Scholar 

  4. C. C. Elgot and J. E. Mezei, On relations defined by generalized finite automata, IBM J. Res. and Dev. 9 (1965), 47–68.

    Google Scholar 

  5. S. Ginsburg, Algebraic and Automata-Theoretic Properties of Formal Languages, North-Holland, Amsterdam, 1975.

    Google Scholar 

  6. S. Ginsburg and S. A. Greibach, Abstract families of languages, in "Studies in Abstract Families of Languages," Memoirs of the Am. Math. Soc., No. 87 (1969), 1–32.

    Google Scholar 

  7. J. Goldstine, Automata with data storage, Proc. Conf. on Theoretical Computer Science, Univ. of Waterloo, Ontario, Canada (August, 1977), 239–246.

    Google Scholar 

  8. J. Hartmanis and J. Hopcroft, What makes some language theory problems undecidable, J. Comp. Sys. Sci. (1970), 368–376.

    Google Scholar 

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

    Google Scholar 

  10. M. Minsky, Recursive unsolvability of Posts' problem of "tag" and other topics in the theory of Turing machines, Ann. Math. 74 (1961), 437–455.

    Google Scholar 

  11. M. Nivat, Transductions des langages de Chomsky, Ph.D. thesis, Paris, 1967.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, The Pennsylvania State University, 16802, University Park, PA, USA

    Jonathan Goldstine

Authors
  1. Jonathan Goldstine
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Hermann A. Maurer

Rights and permissions

Reprints and permissions

Copyright information

© 1979 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Goldstine, J. (1979). A rational theory of AFLs. In: Maurer, H.A. (eds) Automata, Languages and Programming. ICALP 1979. Lecture Notes in Computer Science, vol 71. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-09510-1_21

Download citation

  • DOI: https://doi.org/10.1007/3-540-09510-1_21

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-09510-1

  • Online ISBN: 978-3-540-35168-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation