Idézéskapcsolat

Leupold Peter. Primitive words are unavoidable for context-free languages. (2010) Megjelent: Language and Automata Theory and Applications pp. 403-413

Közlemény:
Dömösi Pál et al. The language of primitive words in not regular: two simple proofs. (2005) BULLETIN OF THE EUROPEAN ASSOCIATION FOR THEORETICAL COMPUTER SCIENCE 0252-9742 87 191-197
Idéző közlemény:
Leupold Peter. Primitive words are unavoidable for context-free languages. (2010) Megjelent: Language and Automata Theory and Applications pp. 403-413
Független: Igen
2021-10-23 02:45