Formal languages consisting of primitive words-Reference-Cited by-同舟云学术

Formal languages consisting of primitive words

Published:1993 Issue: Volume: Page:194-203
ISSN:0302-9743
Container-title:Fundamentals of Computation Theory
language:
Short-container-title:

Author:

Dömösi P.,Horváth S.,Ito M.,Kászonyi L.,Katsura M.

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-57163-9_15.pdf

Reference17 articles.

1. Bader, C., Moura, A.: A generalization of Ogden's lemma. JACM, 29 (1982), 404–407.

2. Boasson, L., Horváth, S.: On languages satisfying Ogden's lemma. RAIRO Informatique théorique, 12 (1978), 201–202.

3. Dassow, J., Horváth, S., Karhumäki, J.: On context-free languages of n-th powers: structure and decidability. Presented at the Conf. Formal Languages, Boolean Functions and Complexity, Comenius Univ., Bratislava, CSSR, 6–10 March, 1989; to appear in Comp. and Artif. Int.

4. Dömösi, P., Horváth, S., Ito, M.: Formal languages and primitive words. Publ. Math., Debrecen (in print).

5. Ginsburg, S.: The Mathematical Theory of Context-Free Languages. McGraw-Hill, New York, 1966.

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

1. On Del-Robust Primitive Partial Words with One Hole;Language and Automata Theory and Applications;2016

2. On the Language of Primitive Partial Words;Language and Automata Theory and Applications;2015

3. ABELIAN PRIMITIVE WORDS;International Journal of Foundations of Computer Science;2012-08

4. d-Primitive Words and Contextual Grammars;IEICE Transactions on Information and Systems;2012

5. On Non-overlapping Words;IEICE Transactions on Information and Systems;2011