Skip to main content
SpringerLink
Log in

Applications of an infinite squarefree CO-CFL

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

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

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. J.M. Autebert, L. Boasson and G. Cousineau, A note on l-locally linear languages, Information and Control 37(1978), 1–4.

    Article  Google Scholar 

  2. J.M. Autebert, J. Beauquier, L. Boasson and M. Nivat, Quelques problems ouverts en theorie des languages algebriques, RAIRO Informatique theorique / Theoretical Informatics 13 (1979) 4, 363–378.

    Google Scholar 

  3. J.M. Autebert, J. Beauquier, L. Boasson and M. Latteux, Very small families of algebraic nonrational languages, in Formal Language Theory: Perspectives and Open Problems (R. Book, Ed.), Academic Press (1980), New York, 89–108.

    Google Scholar 

  4. L. Boasson, Un critere de rationalite des lanages algebriques, in: International Conference on Automata and Programming Languages, (M. Nivat, ed.), (North-Holland, 1972), 359–365.

    Google Scholar 

  5. C.H. Braunholtz, Solution to problem 5030, Am. Math. Mo. 70 (1963), 675–676.

    Google Scholar 

  6. W. Bucher, A. Ehrenfeucht and D. Haussler. On Total Regulators Generated by Derivation Relations, pre-publication manuscript.

    Google Scholar 

  7. A. Cobham Uniform tag sequences, Math. Sys. Theory 6 (1972), 164–191.

    Article  Google Scholar 

  8. A. Ehrenfeucht, R. Parikh and G. Rozenberg, Pumping lemmas for regular sets, SIAM J. of Computing 10, 1981.

    Google Scholar 

  9. M. Harrison, Introduction to Formal Language Theory, Addison-Wesley, Reading, MA., (1978), 36–40.

    Google Scholar 

  10. G.A. Hedlund, Remarks on the work of Axel Thue on sequences, Nord. Mat. Tidskr. 16 (1967), 148–150. MR 37 (1959), #4454.

    Google Scholar 

  11. J.E. Hopcroft and J.D. Ullman, Introduction to Automata Theory, Languages and Computation, Addison-Wesley, Reading, MA., 1979.

    Google Scholar 

  12. M.G. Main, Permutations are not context-free: an application of the interchange lemma, IPL (1982), 68–71.

    Google Scholar 

  13. M.G. Main, An infinite squarefree co-CFL, IPL, to appear.

    Google Scholar 

  14. J.F. Perrot, Introduction aux monoides syntactiques des langages algebriques, in: Languages Algebriques (J.P. Crestin and M. Nivat, eds), (1973), p. 167–222.

    Google Scholar 

  15. P.A.B. Pleasants, Nonrepetitive sequences, Proc. Cambridge Phil. Soc. 68 (1970), 267–274.

    Google Scholar 

  16. A. Thue, Uber unendliche Zeichenreihen, Norske Videnskabers Selskabs Skrifter Mat.-Nat. Kl. (Kristiania) (1906), Nr. 7, 1–22.

    Google Scholar 

  17. A. Thue, Uber die gegenseitige Lage gleicher Teile gewisser Zeichenreihen, Norske Videnskabers Selskabs Skrifter Mat.-Nat. Kl. (Kristiania) (1912), Nr. 1, 1–67.

    Google Scholar 

  18. A.P.J. van der Walt, Locally linear families of languages, Information and Control 32(1976), 27–32.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Colorado, 80309, Boulder, CO, USA

    Michael G. Main

  2. Intitutes for Information Processing, Technical University of Graz, A-8010, Graz, AUSTRIA

    Walter Bucher

  3. Department of Mathematics and Computer Science, University of Denver, 80208, Denver, CO, USA

    David Haussler

Authors
  1. Michael G. Main
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Walter Bucher
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. David Haussler
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Wilfried Brauer

Rights and permissions

Reprints and permissions

Copyright information

© 1985 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Main, M.G., Bucher, W., Haussler, D. (1985). Applications of an infinite squarefree CO-CFL. In: Brauer, W. (eds) Automata, Languages and Programming. ICALP 1985. Lecture Notes in Computer Science, vol 194. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0015766

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-15650-5

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation