The family of languages satisfying Bar-Hillel's lemma-Reference-Cited by-同舟云学术

The family of languages satisfying Bar-Hillel's lemma

Published:1978 Issue:3 Volume:12 Page:193-199
ISSN:0399-0540
Container-title:RAIRO. Informatique théorique
language:
Short-container-title:RAIRO. Inform. théor.

Author:

Horváth Sándor

Publisher

EDP Sciences

Link

http://www.rairo-ita.org/10.1051/ita/1978120301931/pdf

Reference14 articles.

1. 1. BAR-HILLEL Y., PERLES M. and SHAMIR E., On Formal Properties of Simple Phrase Structure Grammars, Zeitschr. Phonetik, Sprachwiss., Kommunikationsforsch., Vol. 14, 1961, p. 143-172.1513760106.34501

2. 2. GINSBURG S., The Mathematical Theory of Context-free Languages, McGraw-Hill, New York, 1966.2118150184.28401

3. 3. HOPCROFT J. E. and ULLMAN J. D., Formal Languages and their Relation to Automata, Addison-Wesley, Reading, Mass., 1969.2372430196.01701

4. 4. MARTIN D. F., Formal Languages and their Related Automata, in Computer Science, A. F. CARDENAS, L. PRESSER and M. MARIN, eds., Wiley-Interscience, New York, London, 1972, p. 409-460.

5. 5. SALOMAA A., Formal Languages, Academic Press, New York, London, 1973.4387550262.68025

Cited by 7 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. On languages satisfying “interchange Lemma”;RAIRO - Theoretical Informatics and Applications;1993

2. Formal languages consisting of primitive words;Fundamentals of Computation Theory;1993

3. Comparisons between some pumping conditions for context-free languages;Mathematical Systems Theory;1988-12

4. On satisfying the LL-iteration theorem;Theoretical Computer Science;1988-03

5. On context-free and Szilard languages;BIT;1984-06