@misc{MTMT:31187488,
	title = {Avoidance of split overlaps},
	url = {https://m2.mtmt.hu/api/publication/31187488},
	author = {Gabric, Daniel and Shallit, Jeffrey},
	unique-id = {31187488},
	year = {2020}
}

@article{MTMT:31635972,
	title = {Language of Lyndon Partial Words},
	url = {https://m2.mtmt.hu/api/publication/31635972},
	author = {Kumari, R. Krishna and Arulprakasam, R. and Dare, V. R.},
	journal-iso = {Int J Math Comp Sci},
	journal = {INTERNATIONAL JOURNAL OF MATHEMATICS AND COMPUTER SCIENCE},
	volume = {15},
	unique-id = {31635972},
	issn = {1814-0424},
	abstract = {Combinatorial and algorithmic properties of Lyndon words have been investigated. Lyndon words have wide usage in algebra and pattern matching. In this paper, we introduce Lyndon partial words and show that the language of all Lyndon partial words over the binary alphabet is not context free.},
	year = {2020},
	eissn = {1814-0432},
	pages = {1173-1177}
}

@inproceedings{MTMT:31014156,
	title = {Operation Insertion on the Conjugacy and Commutativity of Words},
	url = {https://m2.mtmt.hu/api/publication/31014156},
	author = {Mahalingam, Kalpana and Ravi, Hirapra},
	booktitle = {Theory and Practice of Natural Computing},
	doi = {10.1007/978-3-030-34500-6_4},
	unique-id = {31014156},
	abstract = {In this paper, we do a theoretical study of some of the notions in combinatorics of words with respect to the insertion operation on words. We generalize the classical notions of conjugacy and commutativity of words to insertion-conjugacy and insertion-commutativity of words. We define and study properties of such words (i.e.) of words u, v and w such that   u←v=v←u  and   u←v=v←w .},
	year = {2019},
	pages = {70-81}
}

@mastersthesis{MTMT:31187439,
	title = {Study of primitive and pseudo-bordered partial words},
	url = {https://m2.mtmt.hu/api/publication/31187439},
	author = {Nayak, Ananda Chandra},
	unique-id = {31187439},
	year = {2019}
}

@mastersthesis{MTMT:30812970,
	title = {Decidability of linear tree constraints for resource analysis of object-oriented programs},
	url = {https://m2.mtmt.hu/api/publication/30812970},
	author = {Bauer, Sabine},
	publisher = {LMU München},
	unique-id = {30812970},
	year = {2018}
}

@article{MTMT:30812972,
	title = {On Primitive Words and Context-Free Languages},
	url = {https://m2.mtmt.hu/api/publication/30812972},
	author = {Sin’ya, Ryoma},
	doi = {10.20569/00003687},
	journal-iso = {Scientific and technical reports of Graduate School of Engineering Science},
	journal = {Scientific and technical reports of Graduate School of Engineering Science, Akita University},
	volume = {39},
	unique-id = {30812972},
	issn = {2432-4108},
	year = {2018},
	eissn = {2432-4116},
	pages = {15-22}
}

@article{MTMT:27254018,
	title = {Non-primitive words of the form pqm},
	url = {https://m2.mtmt.hu/api/publication/27254018},
	author = {Echi, Othman},
	doi = {10.1051/ita/2017012},
	journal-iso = {RAIRO-INF THEOR APPL},
	journal = {RAIRO-THEORETICAL INFORMATICS AND APPLICATIONS},
	volume = {51},
	unique-id = {27254018},
	issn = {0988-3754},
	abstract = {Let p, q be two distinct primitive words. According to Lentin-Schutzenberger [9], the language p(+) q(+) contains at most one non-primitive word and if pq(m) is not primitive, then m <= 2 vertical bar p vertical bar/vertical bar q vertical bar + 3. In this paper we give a sharper upper bound, namely, m <= left perpendicular vertical bar p vertical bar - 2/vertical bar q vertical bar + 2 right perpendicular , where left perpendicular x right perpendicular stands for the floor of x.},
	year = {2017},
	eissn = {1290-385X},
	pages = {141-166}
}

@inproceedings{MTMT:27133688,
	title = {Representation of Information in Automata},
	url = {https://m2.mtmt.hu/api/publication/27133688},
	author = {Henning, Bordihn},
	booktitle = {Proceedings of the 15th International Conference on Automata and Formal Languages},
	doi = {10.4204/EPTCS.252},
	publisher = {Electronic Proceedings in Theoretical Computer Science (EPTCS)},
	unique-id = {27133688},
	year = {2017},
	pages = {3-4}
}

@article{MTMT:27125706,
	title = {Automata Theory Revised},
	url = {https://m2.mtmt.hu/api/publication/27125706},
	author = {SIN'YA, Ryoma},
	doi = {10.11309/jssst.34.3_3},
	journal-iso = {COMPUT SOFT},
	journal = {KONPYUTA SOFUTOWEA / COMPUTER SOFTWARE},
	volume = {34},
	unique-id = {27125706},
	issn = {0289-6540},
	year = {2017},
	pages = {3-35}
}

@article{MTMT:27125701,
	title = {On block pumpable languages},
	url = {https://m2.mtmt.hu/api/publication/27125701},
	author = {Chak, CH and Freivalds, R and Stephan, F and Yik, HTW},
	doi = {10.1016/j.tcs.2015.10.008},
	journal-iso = {THEOR COMPUT SCI},
	journal = {THEORETICAL COMPUTER SCIENCE},
	volume = {609},
	unique-id = {27125701},
	issn = {0304-3975},
	year = {2016},
	eissn = {1879-2294},
	pages = {272-285}
}

@inproceedings{MTMT:27125705,
	title = {On Exchange-Robust and Subst-Robust Primitive Partial Words},
	url = {https://m2.mtmt.hu/api/publication/27125705},
	author = {Nayak, Ananda Chandra and Srivastava, Amit Kumar and Kapoor, Kalpesh},
	booktitle = {ICTCS 2016, Proceedings of the 17th Italian Conference on Theoretical Computer Science},
	publisher = {n CEUR Workshop Proceedins},
	unique-id = {27125705},
	year = {2016},
	pages = {190-202}
}

@article{MTMT:27125702,
	title = {Squares and primitivity in partial words},
	url = {https://m2.mtmt.hu/api/publication/27125702},
	author = {Blanchet-Sadri, F and Bodnar, M and Nikkel, J and Quigley, JD and Zhang, XF},
	doi = {10.1016/j.dam.2014.12.003},
	journal-iso = {DISCRETE APPL MATH},
	journal = {DISCRETE APPLIED MATHEMATICS},
	volume = {185},
	unique-id = {27125702},
	issn = {0166-218X},
	year = {2015},
	eissn = {1872-6771},
	pages = {26-37}
}

@inbook{MTMT:27125707,
	title = {A graph polynomial approach to primitivity},
	url = {https://m2.mtmt.hu/api/publication/27125707},
	author = {Blanchet-Sadri, Francine and Bodnar, Michelle and Fox, Nathan and Hidakatsu, Joe},
	booktitle = {7th International Conference on Language and Automata Theory and Applications},
	doi = {10.1007/978-3-642-37064-9_15},
	publisher = {Springer Netherlands},
	unique-id = {27125707},
	year = {2014},
	pages = {153-164}
}

@article{MTMT:27125694,
	title = {Abelian-primitive partial words},
	url = {https://m2.mtmt.hu/api/publication/27125694},
	author = {Blanchet-Sadri, F and Fox, N},
	doi = {10.1016/j.tcs.2013.03.007},
	journal-iso = {THEOR COMPUT SCI},
	journal = {THEORETICAL COMPUTER SCIENCE},
	volume = {485},
	unique-id = {27125694},
	issn = {0304-3975},
	year = {2013},
	eissn = {1879-2294},
	pages = {16-37}
}

@inproceedings{MTMT:27125704,
	title = {On Operations Preserving Primitivity of Partial Words with One Hole.},
	url = {https://m2.mtmt.hu/api/publication/27125704},
	author = {Blanchet-Sadri, Francine and Nelson, Sarah and Tebbe, Amelia},
	booktitle = {Automata and Formal Languages, 13th International Conference, AFL 2011},
	publisher = {World Scientific Publishing Company},
	unique-id = {27125704},
	year = {2012},
	pages = {93-107}
}