TY - GEN AU - Gabric, Daniel AU - Shallit, Jeffrey TI - Avoidance of split overlaps PY - 2020 UR - https://m2.mtmt.hu/api/publication/31187488 ID - 31187488 LA - English DB - MTMT ER - TY - JOUR AU - Kumari, R. Krishna AU - Arulprakasam, R. AU - Dare, V. R. TI - Language of Lyndon Partial Words JF - INTERNATIONAL JOURNAL OF MATHEMATICS AND COMPUTER SCIENCE J2 - Int J Math Comp Sci VL - 15 PY - 2020 IS - 4 SP - 1173 EP - 1177 PG - 5 SN - 1814-0424 UR - https://m2.mtmt.hu/api/publication/31635972 ID - 31635972 AB - 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. LA - English DB - MTMT ER - TY - CHAP AU - Mahalingam, Kalpana AU - Ravi, Hirapra ED - Martín-Vide, Carlos ED - Pond, Geoffrey ED - Vega-Rodríguez, Miguel A. TI - Operation Insertion on the Conjugacy and Commutativity of Words T2 - Theory and Practice of Natural Computing PB - Springer Netherlands CY - Cham SN - 9783030344993 T3 - Lecture Notes in Computer Science, ISSN 0302-9743 ; 11934. PY - 2019 SP - 70 EP - 81 PG - 12 DO - 10.1007/978-3-030-34500-6_4 UR - https://m2.mtmt.hu/api/publication/31014156 ID - 31014156 AB - 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 . LA - English DB - MTMT ER - TY - THES AU - Nayak, Ananda Chandra TI - Study of primitive and pseudo-bordered partial words PY - 2019 SP - 130 UR - https://m2.mtmt.hu/api/publication/31187439 ID - 31187439 LA - English DB - MTMT ER - TY - THES AU - Bauer, Sabine TI - Decidability of linear tree constraints for resource analysis of object-oriented programs PB - Ludwig-Maximilians-Universität (LMU) PY - 2018 SP - 165 UR - https://m2.mtmt.hu/api/publication/30812970 ID - 30812970 LA - English DB - MTMT ER - TY - JOUR AU - Sin’ya, Ryoma TI - On Primitive Words and Context-Free Languages JF - Scientific and technical reports of Graduate School of Engineering Science, Akita University J2 - Scientific and technical reports of Graduate School of Engineering Science VL - 39 PY - 2018 SP - 15 EP - 22 PG - 8 SN - 2432-4108 DO - 10.20569/00003687 UR - https://m2.mtmt.hu/api/publication/30812972 ID - 30812972 LA - Japanese DB - MTMT ER - TY - JOUR AU - Echi, Othman TI - Non-primitive words of the form pqm JF - RAIRO-THEORETICAL INFORMATICS AND APPLICATIONS J2 - RAIRO-INF THEOR APPL VL - 51 PY - 2017 IS - 3 SP - 141 EP - 166 PG - 26 SN - 0988-3754 DO - 10.1051/ita/2017012 UR - https://m2.mtmt.hu/api/publication/27254018 ID - 27254018 AB - 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. LA - English DB - MTMT ER - TY - CHAP AU - Henning, Bordihn ED - Erzsebet, Csuhaj-Varju ED - Pál, Dömösi ED - György, Vaszil TI - Representation of Information in Automata T2 - Proceedings of the 15th International Conference on Automata and Formal Languages PB - Electronic Proceedings in Theoretical Computer Science (EPTCS) CY - Sydney PB - Electronic Proceedings in Theoretical Computer Science (EPTCS) PY - 2017 SP - 3 EP - 4 PG - 234 DO - 10.4204/EPTCS.252 UR - https://m2.mtmt.hu/api/publication/27133688 ID - 27133688 LA - English DB - MTMT ER - TY - JOUR AU - SIN'YA, Ryoma TI - Automata Theory Revised JF - KONPYUTA SOFUTOWEA / COMPUTER SOFTWARE J2 - COMPUT SOFT VL - 34 PY - 2017 IS - 3 SP - 3 EP - 35 PG - 33 SN - 0289-6540 DO - 10.11309/jssst.34.3_3 UR - https://m2.mtmt.hu/api/publication/27125706 ID - 27125706 LA - Japanese DB - MTMT ER - TY - JOUR AU - Chak, CH AU - Freivalds, R AU - Stephan, F AU - Yik, HTW TI - On block pumpable languages JF - THEORETICAL COMPUTER SCIENCE J2 - THEOR COMPUT SCI VL - 609 PY - 2016 SP - 272 EP - 285 PG - 14 SN - 0304-3975 DO - 10.1016/j.tcs.2015.10.008 UR - https://m2.mtmt.hu/api/publication/27125701 ID - 27125701 N1 - PN 1 LA - English DB - MTMT ER - TY - CHAP AU - Nayak, Ananda Chandra AU - Srivastava, Amit Kumar AU - Kapoor, Kalpesh TI - On Exchange-Robust and Subst-Robust Primitive Partial Words T2 - ICTCS 2016, Proceedings of the 17th Italian Conference on Theoretical Computer Science PB - n CEUR Workshop Proceedins CY - Lecce PB - n CEUR Workshop Proceedins PY - 2016 SP - 190 EP - 202 UR - https://m2.mtmt.hu/api/publication/27125705 ID - 27125705 LA - English DB - MTMT ER - TY - JOUR AU - Blanchet-Sadri, F AU - Bodnar, M AU - Nikkel, J AU - Quigley, JD AU - Zhang, XF TI - Squares and primitivity in partial words JF - DISCRETE APPLIED MATHEMATICS J2 - DISCRETE APPL MATH VL - 185 PY - 2015 SP - 26 EP - 37 PG - 12 SN - 0166-218X DO - 10.1016/j.dam.2014.12.003 UR - https://m2.mtmt.hu/api/publication/27125702 ID - 27125702 LA - English DB - MTMT ER - TY - CHAP AU - Blanchet-Sadri, Francine AU - Bodnar, Michelle AU - Fox, Nathan AU - Hidakatsu, Joe TI - A graph polynomial approach to primitivity T2 - 7th International Conference on Language and Automata Theory and Applications PB - Springer Netherlands CY - New York, New York CY - Berlin CY - Heidelberg SN - 9783642370632 T3 - Lecture Notes in Computer Science, ISSN 0302-9743 ; 7810. PB - Springer Netherlands PY - 2014 SP - 153 EP - 164 PG - 12 DO - 10.1007/978-3-642-37064-9_15 UR - https://m2.mtmt.hu/api/publication/27125707 ID - 27125707 LA - English DB - MTMT ER - TY - JOUR AU - Blanchet-Sadri, F AU - Fox, N TI - Abelian-primitive partial words JF - THEORETICAL COMPUTER SCIENCE J2 - THEOR COMPUT SCI VL - 485 PY - 2013 SP - 16 EP - 37 PG - 22 SN - 0304-3975 DO - 10.1016/j.tcs.2013.03.007 UR - https://m2.mtmt.hu/api/publication/27125694 ID - 27125694 LA - English DB - MTMT ER - TY - CHAP AU - Blanchet-Sadri, Francine AU - Nelson, Sarah AU - Tebbe, Amelia ED - Pál, Dömösi ED - Zoltán, Ésik TI - On Operations Preserving Primitivity of Partial Words with One Hole. T2 - Automata and Formal Languages, 13th International Conference, AFL 2011 PB - World Scientific Publishing CY - Singapore SN - 9786155097195 T3 - International Journal of Foundations of Computer Science ; 23. PB - World Scientific Publishing PY - 2012 SP - 93 EP - 107 PG - 15 UR - https://m2.mtmt.hu/api/publication/27125704 ID - 27125704 LA - English DB - MTMT ER -