Abstract
Given a language L, its center is defined as the set of left factors of L for which there exists infinitely many ways to be completed in a word of L. In this communication we prove the center of a one-counter language (resp. a non-expansive language) to be one-counter (resp. non-expansive).
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
BEAUQUIER J., et M. NIVAT: Application of Formal languages Theory to Problems of Security and Synchronization. to appear — Santa-Barbara — Formal languages (1979).
BOASSON L., Un Langage Algébrique Particulier. RAIRO Informatique Théorique. 13 (1979), p. 203–215.
BOASSON L. et M. NIVAT.,: Le Cylindre des Langages Linéaires, Math. System theory — 11 (1977), p. 147–155.
BOASSON L. et M. NIVAT.,: Adhérences of Languages J.C.S.S. Vol. 20 (1980) p. 285–309
GABARRO K.,: Sur une Conjecture Concernant l'Index Rationnel. (to appear)
GINSBURG S.,: The Mathematical Theory of Context-Free Languages, Mc Graw-Hill.
R.M. KARP et MILLER,: Parallel Program Schemata. J.C.S.S. Vol. 13 (1969) p. 147–195
NIVAT M.,: Sur les Ensembles de Mots Infinis Engendrés par une Grammaire Algébrique. RAIRO. — Informatique Théorique — 12 (1978), p. 259–278.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1981 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Boasson, L., Nivat, M. (1981). Centers of languages. In: Deussen, P. (eds) Theoretical Computer Science. Lecture Notes in Computer Science, vol 104. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0017316
Download citation
DOI: https://doi.org/10.1007/BFb0017316
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-10576-3
Online ISBN: 978-3-540-38561-5
eBook Packages: Springer Book Archive