@article{MTMT:3320971,
	title = {On Chomsky Hierarchy of Palindromic Languages},
	url = {https://m2.mtmt.hu/api/publication/3320971},
	author = {Dömösi, Pál Béla and Fazekas, S and Ito, M},
	doi = {10.14232/actacyb.22.3.2016.10},
	journal-iso = {ACTA CYBERN-SZEGED},
	journal = {ACTA CYBERNETICA},
	volume = {22},
	unique-id = {3320971},
	issn = {0324-721X},
	abstract = {The characterization of the structure of palindromic regular and palindromic context-free languages is described by S. Horvath, J. Karhumaki, and J. Kleijn in 1987. In this paper alternative proofs are given for these characterizations.},
	year = {2016},
	eissn = {2676-993X},
	pages = {703-713}
}

@article{MTMT:2399329,
	title = {Pumping lemmas for linear and nonlinear context-free languages},
	url = {https://m2.mtmt.hu/api/publication/2399329},
	author = {Horváth, Géza and Nagy, Benedek},
	journal-iso = {ACTA UNIV SAP INFORM},
	journal = {ACTA UNIVERSITATIS SAPIENTIAE INFORMATICA},
	volume = {2},
	unique-id = {2399329},
	issn = {1844-6086},
	year = {2010},
	eissn = {2066-7760},
	pages = {194-209}
}

@article{MTMT:2399325,
	title = {On the Shyr–Yu theorem},
	url = {https://m2.mtmt.hu/api/publication/2399325},
	author = {Dömösi, Pál Béla and Horváth, Géza and Vuillon, Laurent},
	doi = {10.1016/j.tcs.2009.06.039},
	journal-iso = {THEOR COMPUT SCI},
	journal = {THEORETICAL COMPUTER SCIENCE},
	volume = {410},
	unique-id = {2399325},
	issn = {0304-3975},
	year = {2009},
	eissn = {1879-2294},
	pages = {4874-4877}
}

@article{MTMT:1130593,
	title = {Marcus Contextual Languages Consisting of Primitive Words},
	url = {https://m2.mtmt.hu/api/publication/1130593},
	author = {Dömösi, Pál Béla and Marcus, S and Ito, M},
	doi = {10.1016/j.disc.2007.09.006},
	journal-iso = {DISCRETE MATH},
	journal = {DISCRETE MATHEMATICS},
	volume = {308},
	unique-id = {1130593},
	issn = {0012-365X},
	year = {2008},
	eissn = {1872-681X},
	pages = {4877-4881}
}

@article{MTMT:1130216,
	title = {Alternative proof of the Lyndon-Schützenberger theorem},
	url = {https://m2.mtmt.hu/api/publication/1130216},
	author = {Dömösi, Pál Béla and Horváth, Géza},
	doi = {10.1016/j.tcs.2006.08.023},
	journal-iso = {THEOR COMPUT SCI},
	journal = {THEORETICAL COMPUTER SCIENCE},
	volume = {366},
	unique-id = {1130216},
	issn = {0304-3975},
	abstract = {Some observations on products of primitive words are discussed. By
		these results, alternative proof is given for the Lyndon-Schützenberger
		Theorem, which says that every solution of the equation a(m)b(n)=c(k)
		over Sigma* is trivial. (c) 2006 Elsevier B.V. All rights reserved.},
	year = {2006},
	eissn = {1879-2294},
	pages = {194-198}
}

@article{MTMT:2399324,
	title = {Some periodicity of words and Marcus contextual grammars},
	url = {https://m2.mtmt.hu/api/publication/2399324},
	author = {Dömösi, Pál Béla and Horváth, Géza and Ito, Masami and Shikishima-Tsuji, Kayoko},
	journal-iso = {VIETNAM J MATH},
	journal = {VIETNAM JOURNAL OF MATHEMATICS},
	volume = {34},
	unique-id = {2399324},
	issn = {2305-221X},
	year = {2006},
	eissn = {2305-2228},
	pages = {381-387}
}

@article{MTMT:2399331,
	title = {New Pumping Lemma for Non-Linear Context-Free Languages (Algorithmic problems in algebra, languages and computation systems)},
	url = {https://m2.mtmt.hu/api/publication/2399331},
	author = {Horváth, Géza},
	journal-iso = {RIMS KOKYUROKU},
	journal = {SURIKAISEKIKENKYUSHO KOKYUROKU / RIMS KOKYUROKU},
	volume = {1503},
	unique-id = {2399331},
	issn = {1880-2818},
	year = {2006},
	pages = {160-163}
}

@article{MTMT:1130215,
	title = {On polyslender context-free languages},
	url = {https://m2.mtmt.hu/api/publication/1130215},
	author = {Dömösi, Pál Béla and Martin-Vide, C and Mateescu, A},
	journal-iso = {PUBL MATH DEBRECEN},
	journal = {PUBLICATIONES MATHEMATICAE DEBRECEN},
	volume = {66},
	unique-id = {1130215},
	issn = {0033-3883},
	abstract = {A. Szilard, S. Yu, K. Zhang, and J. Shallit showed that for any
		positive integer k, a regular language is k-polyslender if and only if
		it is a finite union of (k + 1)-multiple loop languages. M. Latteux and
		G, Thierrin and later, independently, D. Raz proved that the family of
		polyslender context-free languages is bounded. Polyslender context-free
		languages are also characterized by L. Ilie, G. Rozenberg and A.
		Salomaa. In this paper, we continue this line of research.},
	keywords = {SLENDER LANGUAGES},
	year = {2005},
	eissn = {2064-2849},
	pages = {1-15}
}

@CONFERENCE{MTMT:1130306,
	title = {On products of primitive words},
	url = {https://m2.mtmt.hu/api/publication/1130306},
	author = {Dömösi, Pál Béla and Horváth, Géza},
	booktitle = {Automata and Formal Languages},
	unique-id = {1130306},
	year = {2005},
	pages = {112-121}
}

@article{MTMT:1130211,
	title = {A small hierarchy of languages consisting of non-primitive words},
	url = {https://m2.mtmt.hu/api/publication/1130211},
	author = {Dömösi, Pál Béla and Horváth, Géza and Ito, M},
	journal-iso = {PUBL MATH DEBRECEN},
	journal = {PUBLICATIONES MATHEMATICAE DEBRECEN},
	volume = {64},
	unique-id = {1130211},
	issn = {0033-3883},
	abstract = {Context-free languages consisting of non-primitive words have been
		characterized by M. Ito and M. Katsura in 1988. In this paper we show
		that the same type of characterization can be given for linear,
		respectively, regular languages consisting of non-primitive words. The
		observation completes our knowledge on the structure of different
		languages of non-primitive words.},
	year = {2004},
	eissn = {2064-2849},
	pages = {261-267}
}

@article{MTMT:1130212,
	title = {Remarks on sublanguages consisting of primitive words of slender regular and context-free languages},
	url = {https://m2.mtmt.hu/api/publication/1130212},
	author = {Dömösi, Pál Béla and Martin-Vide, C and Mitrana, V},
	doi = {10.1007/b98751#page=69},
	journal-iso = {LECT NOTES COMPUT SC},
	journal = {LECTURE NOTES IN COMPUTER SCIENCE},
	volume = {3113},
	unique-id = {1130212},
	issn = {0302-9743},
	abstract = {In this note we investigate the languages obtained by intersecting
		slender regular or context-free languages with the set of all primitive
		Words over the common alphabet. We prove that. these languages axe also
		re gular, and, respectively, context-free. The statement does not hold
		anymore for either regular or context-free languages. Moreover, the set
		of all non-primitive words of a slender context-free language is still
		context-free. Some possible directions for further research are finally
		discussed.},
	year = {2004},
	eissn = {1611-3349},
	pages = {60-67}
}

@article{MTMT:2847549,
	title = {Small Grammars and Primitive Words (Algebraic Systems, Formal Languages and Conventional and Unconventional Computation Theory)},
	url = {https://m2.mtmt.hu/api/publication/2847549},
	author = {Horváth, Géza},
	journal-iso = {RIMS KOKYUROKU},
	journal = {SURIKAISEKIKENKYUSHO KOKYUROKU / RIMS KOKYUROKU},
	volume = {1366},
	unique-id = {2847549},
	issn = {1880-2818},
	year = {2004},
	pages = {62-72}
}

@inbook{MTMT:1130311,
	title = {An improvement of iteration lemmata for context-free languages},
	url = {https://m2.mtmt.hu/api/publication/1130311},
	author = {Dömösi, Pál Béla and Kudlek, M},
	booktitle = {Words, languages and combinatorics III.},
	doi = {10.1142/4959},
	unique-id = {1130311},
	year = {2003},
	pages = {185-191}
}

@inproceedings{MTMT:3323447,
	title = {Some Remarks on Primitive Words and Palindromes},
	url = {https://m2.mtmt.hu/api/publication/3323447},
	author = {Dömösi, Pál Béla and Horváth, S and Ito, M and Katsura, M},
	booktitle = {5th International Workshop on Descriptional Complexity of Formal Systems, DCFS 2003},
	unique-id = {3323447},
	year = {2003},
	pages = {245-254}
}

@article{MTMT:1130323,
	title = {Iteration lemmata for context-free and linear indexed languages},
	url = {https://m2.mtmt.hu/api/publication/1130323},
	author = {Dömösi, Pál Béla and Kudlek, M},
	journal-iso = {PUBL MATH DEBRECEN},
	journal = {PUBLICATIONES MATHEMATICAE DEBRECEN},
	volume = {60},
	unique-id = {1130323},
	issn = {0033-3883},
	year = {2002},
	eissn = {2064-2849},
	pages = {551-568}
}

@article{MTMT:1130343,
	title = {A Chomsky-Schützenberger-Stanley type characterization of the class of slender context-free languages},
	url = {https://m2.mtmt.hu/api/publication/1130343},
	author = {Dömösi, Pál Béla and Okawa, S},
	journal-iso = {ACTA CYBERN-SZEGED},
	journal = {ACTA CYBERNETICA},
	volume = {15},
	unique-id = {1130343},
	issn = {0324-721X},
	year = {2001},
	eissn = {2676-993X},
	pages = {25-32}
}

@inbook{MTMT:1130340,
	title = {Multiple keyword patterns in context-free languages},
	url = {https://m2.mtmt.hu/api/publication/1130340},
	author = {Dömösi, Pál Béla and Ito, M},
	booktitle = {Where mathematics, computer science, linguistics and biology meet. Essays in honour of Gheorghe Paun},
	unique-id = {1130340},
	year = {2001},
	pages = {237-241}
}

@{MTMT:1130335,
	title = {Some of my favourite unsolved problems},
	url = {https://m2.mtmt.hu/api/publication/1130335},
	author = {Dömösi, Pál Béla},
	booktitle = {Unsolved problems on mathematics for the 21st century},
	unique-id = {1130335},
	year = {2001},
	pages = {159-168}
}

@article{MTMT:1130344,
	title = {Unusual algorithms for lexicographical enumeration},
	url = {https://m2.mtmt.hu/api/publication/1130344},
	author = {Dömösi, Pál Béla},
	journal-iso = {ACTA CYBERN-SZEGED},
	journal = {ACTA CYBERNETICA},
	volume = {14},
	unique-id = {1130344},
	issn = {0324-721X},
	year = {2000},
	eissn = {2676-993X},
	pages = {461-468}
}

@article{MTMT:1130345,
	title = {A Chomsky and Stanley type homomorphic characterization of the class of linear languages},
	url = {https://m2.mtmt.hu/api/publication/1130345},
	author = {Dömösi, Pál Béla and Okawa, S and Hirose, S},
	journal-iso = {BULL EATCS},
	journal = {BULLETIN OF THE EUROPEAN ASSOCIATION FOR THEORETICAL COMPUTER SCIENCE},
	volume = {68},
	unique-id = {1130345},
	issn = {0252-9742},
	year = {1999},
	pages = {151-152}
}

@article{MTMT:1130207,
	title = {Strong iteration lemmata for regular, linear, context-free, and linear indexed languages},
	url = {https://m2.mtmt.hu/api/publication/1130207},
	author = {Dömösi, Pál Béla and Kudlek, M},
	journal-iso = {LECT NOTES COMPUT SC},
	journal = {LECTURE NOTES IN COMPUTER SCIENCE},
	volume = {1684},
	unique-id = {1130207},
	issn = {0302-9743},
	abstract = {New iteration lemmata are presented, generalizing most of the known
		iteration lemmata for regular, linear, context-free, and linear indexed
		languages.},
	year = {1999},
	eissn = {1611-3349},
	pages = {226-233}
}

@inbook{MTMT:1130349,
	title = {Characterization of languages by lengths of their subwords},
	url = {https://m2.mtmt.hu/api/publication/1130349},
	author = {Dömösi, Pál Béla and Ito, M},
	booktitle = {Semigroups : Papers from the international conference on semigroups and its related topics},
	unique-id = {1130349},
	year = {1998},
	pages = {117-129}
}

@inbook{MTMT:1130352,
	title = {A new pumping property of context-free languages},
	url = {https://m2.mtmt.hu/api/publication/1130352},
	author = {Dömösi, Pál Béla and Ito, M and Katsura, M and Nehaniv, C L},
	booktitle = {Combinatorics, complexity, and logic : Proceedings of the 1st international conference on discrete mathematics and theoretical computer science, DMTCS ’96},
	unique-id = {1130352},
	year = {1997},
	pages = {187-193}
}

@article{MTMT:3323827,
	title = {On Subwords of Languages},
	url = {https://m2.mtmt.hu/api/publication/3323827},
	author = {Dömösi, Pál Béla and ITO, Masami},
	journal-iso = {RIMS KOKYUROKU},
	journal = {SURIKAISEKIKENKYUSHO KOKYUROKU / RIMS KOKYUROKU},
	volume = {910},
	unique-id = {3323827},
	issn = {1880-2818},
	year = {1995},
	pages = {1-4}
}

@inbook{MTMT:1130356,
	title = {Some combinatorial properties of words, and the Chomsky-hierarchy},
	url = {https://m2.mtmt.hu/api/publication/1130356},
	author = {Dömösi, Pál Béla and Horváth, S and Ito, M and Kászonyi, L and Katsura, M},
	booktitle = {Words, languages and combinatorics, II},
	unique-id = {1130356},
	year = {1994},
	pages = {105-123}
}

@article{MTMT:1130206,
	title = {FORMAL LANGUAGES AND PRIMITIVE WORDS},
	url = {https://m2.mtmt.hu/api/publication/1130206},
	author = {Dömösi, Pál Béla and Horváth, S and Ito, M},
	journal-iso = {PUBL MATH DEBRECEN},
	journal = {PUBLICATIONES MATHEMATICAE DEBRECEN},
	volume = {42},
	unique-id = {1130206},
	issn = {0033-3883},
	abstract = {The mathematical theory of formal languages has a very important role
		in theoretical computer science, In this paper we study various formal
		language problems related to the class of all primitive words over a
		fixed alphabet. Some results and problems are presented.},
	year = {1993},
	eissn = {2064-2849},
	pages = {315-321}
}

@inbook{MTMT:1130369,
	title = {Formal languages consisting of primitive words},
	url = {https://m2.mtmt.hu/api/publication/1130369},
	author = {Dömösi, Pál Béla and Horváth, S and Ito, M and Kászonyi, L and Katsura, M},
	booktitle = {Fundamentals of Computation Theory},
	doi = {10.1007/3-540-57163-9_15},
	unique-id = {1130369},
	year = {1993},
	pages = {194-203}
}