iBet uBet web content aggregator. Adding the entire web to your favor.
iBet uBet web content aggregator. Adding the entire web to your favor.



Link to original content: https://unpaywall.org/10.1007/3-540-10854-8_23
Some properties of language families generated by commutative languages | SpringerLink
Skip to main content
Springer Nature Link
Log in

Some properties of language families generated by commutative languages

  • Conference paper
  • First Online:
Fundamentals of Computation Theory (FCT 1981)

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

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.

References

  1. S.Ginsburg, Algebraic and Automata-Theoretic Properties of Formal Languages, North-Holland Publishing Company, 1975.

    Google Scholar 

  2. S. Ginsburg and J. Goldstine, Intersection-Closed Full AFL and the Recursively Enumerable Languages,Inf. Control 22 (1973), 201–231.

    Google Scholar 

  3. J. Goldstine, Substitution and Bounded Languages, J.Comput.Syst.Sci. 6, (1972), 9–29.

    Google Scholar 

  4. J. Goldstine, Bounded AFLs, J.Comput.Syst.Sci. 12 (1976), 399–419.

    Google Scholar 

  5. M. Latteux, Cônes rationnels commutativement clos, RAIRO, Inf.Theor. 11 (1977), 29–51.

    Google Scholar 

  6. M. Latteux, Langages commutatifs, Thesè Sciences Mathematiques, Universitè Lille, 1978.

    Google Scholar 

  7. M. Latteux, Cônes rationnels commutatifs, J.Comput.Syst.Sci. 18 (1979), 307–333.

    Google Scholar 

  8. B. Rovan, Proving Containment of Bounded Languages, J.Comput.Syst.Sci. 11 (1975), 1–55.

    Google Scholar 

  9. P.Turakainen, On Some Bounded SemiAFLs and AFLs (to appear in Inf. Sci.).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics Faculty of Science, University of Oulu Linnanmaa, SF-90570, Oulu 57, Finland

    Juha Kortelainen

Authors
  1. Juha Kortelainen
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Ferenc Gécseg

Rights and permissions

Reprints and permissions

Copyright information

© 1981 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kortelainen, J. (1981). Some properties of language families generated by commutative languages. In: Gécseg, F. (eds) Fundamentals of Computation Theory. FCT 1981. Lecture Notes in Computer Science, vol 117. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-10854-8_23

Download citation

  • DOI: https://doi.org/10.1007/3-540-10854-8_23

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-10854-2

  • Online ISBN: 978-3-540-38765-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation