[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ Skip to main content
Log in

On languages with a certain prefix property

  • Published:
Mathematical systems theory Aims and scope Submit manuscript

Abstract

A languageL has theprefix property if for allx, y ∈ L, eitherx is a prefix ofy ory is a prefix ofx. It is shown that for certain classes of languages, if a language in the class has the prefix property, then it is a regular set. The results provide new distinctions between classes as well as new profs of previously known distinctions.

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

Access this article

Subscribe and save

Springer+ Basic
£29.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price includes VAT (United Kingdom)

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. R. Book andR. Lipton, On the complexity of infinite sequences, unpublished manuscript.

  2. R. Book andM. Nivat, Reversal-bounded acceptors, in preparation.

  3. R. Book, M. Nivat, andM. Paterson, Reversal-bounded acceptors and Intersections of linear languages,SIAM J. Computing 3 (1974), 283–295.

    Google Scholar 

  4. A. Ehrenfeucht andG. Rozenberg, A pumping theorem for deterministic ETOL languages,Revue d'Automatique, Informatique, Recherche Opérationnelle (série rouge) 9 (1975), 13–23.

    Google Scholar 

  5. S. Ginsburg, S. Greibach, andM. Harrison, Stack automata and compiling,J. Assoc. Comput. Mach. 14 (1967), 172–201.

    Google Scholar 

  6. S. Ginsburg andE. Spanier, Finite-turn pushdown automata,Siam J. Control 4 (1966), 429–453.

    Google Scholar 

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

    Google Scholar 

  8. S. Greibach, Checking automata and one-way stack languages,J. Comput. System Sci. 3 (1969), 196–217.

    Google Scholar 

  9. W. Ogden, Intercalation Theorems for Pushdown Store and Stack Languages, Ph.D. dissertation, Stanford University, 1968.

  10. W. Ogden, A helpful result for proving inherent ambiguity,Math. Systems Theory 2 (1968), 191–195.

    Google Scholar 

  11. F. Rodriguez, Cones d'Accepteurs-Application a l'Etude d'une Hierarchie Infinie de Cones Rationnels de Languages d'Accepteurs Vérificateurs, Thèse Docteur-Ingenieur, Toulouse, 1973.

    Google Scholar 

  12. R. Rodriguez, Une double hierarchie infinie de languages vérifiables,Revue d'Automatique, Informatique, Recherche Opérationelle (série rouge) 9 (1975), 5–19.

    Google Scholar 

  13. R. Siromoney, On equal matrix languages,Information and Control 14 (1969), 135–151.

    Google Scholar 

  14. R. Siromoney, Finite-turn checking automata,J. Computer System Sci. 5 (1971), 549–559.

    Google Scholar 

  15. A. Thue, Über die gegenseitige Lage gleicher Teile gewisser Zeichenreiher,Videnskabssekskabets Skrifter I Mat. nat. Kl., Christiana, 1912.

  16. G. A. Hedlund, Remarks on the work of Axel Thue on sequences,Nordisk Mat. Tidskr 15 (1967), 148–150.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Additional information

This research was supported in part by the National Science Foundation under Grant DCR-75-15945 and Grant MCS76-05744.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Book, R.V. On languages with a certain prefix property. Math. Systems Theory 10, 229–237 (1976). https://doi.org/10.1007/BF01683274

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Keywords

Navigation