Classes of languages proof against regular pumping
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications (1980)
- Volume: 14, Issue: 2, page 169-180
- ISSN: 0988-3754
Access Full Article
top
How to cite
topSommerhalder, R.. "Classes of languages proof against regular pumping." RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications 14.2 (1980): 169-180. <http://eudml.org/doc/92122>.
@article{Sommerhalder1980,
author = {Sommerhalder, R.},
journal = {RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications},
keywords = {formal languages; regular sets; pumping; Thue-sequence},
language = {eng},
number = {2},
pages = {169-180},
publisher = {EDP-Sciences},
title = {Classes of languages proof against regular pumping},
url = {http://eudml.org/doc/92122},
volume = {14},
year = {1980},
}
TY - JOUR
AU - Sommerhalder, R.
TI - Classes of languages proof against regular pumping
JO - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY - 1980
PB - EDP-Sciences
VL - 14
IS - 2
SP - 169
EP - 180
LA - eng
KW - formal languages; regular sets; pumping; Thue-sequence
UR - http://eudml.org/doc/92122
ER -
References
top- 1. L. BOASSON, Un critère de rationnalité des langages algébriques. In M. NIVAT, Ed., Automata, Languages and Programming, 1972, pp. 359-365. Zbl0263.68038MR368487
- 2. S. HORVÀTH, The Family of Languages Satisfying Bar-Hillel's Lemma, R.A.I.R.O., Informatique Theorique, Vol. 12, No. 3, 1978, pp. 193-199. Zbl0387.68053MR510636
- 3. J. JAFFE, A Necessary and Sufficient Pumping Lemma for Regular Languages, S.I.G.A.C.T. News summer, 1978, pp. 48-49. Zbl0397.68084
- 4. J. VAN LEEUWEN, Private communication, 1978.
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.