Skip to main content
SpringerLink
Log in

A decidability result in algebraic language theory

  • Published:
Mathematical systems theory Aims and scope Submit manuscript

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

References

  1. N. Chomsky andM. P. Schützenberger, The algebraic theory of context-free languages, inComputer Programming and Formal Systems (F. Braffort et al., eds.), North Holland Publ. Co., Amsterdam, 1963.

    Google Scholar 

  2. E. Shamir, Algebraic, rational and context-free power series in non-commuting variables, inAlgebraic Theory of Machines, Languages and Semigroups (M. Arbib, ed.), Academic Press, New York, 1968.

    Google Scholar 

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

    Google Scholar 

  4. M. P. Schützenberger, On a theorem of R. Jungen,Proc. Amer. Math. Soc. 13 (1962), 885–890.

    Google Scholar 

  5. H. Furstenberg, Algebraic functions of finite fields,J. Algebra 7 (1967), 271–277.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Mathematics Department, Pennsylvania State University, University Park, 16802, Pennsylvania, USA

    Robert Townsend

Authors
  1. Robert Townsend
    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

Townsend, R. A decidability result in algebraic language theory. Math. Systems Theory 8, 225–227 (1974). https://doi.org/10.1007/BF01762669

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation