| 2013 | Robert George Mercas
Aleksi Saarela: 3-Abelian Cubes Are Avoidable on Binary Alphabets. In: Marie-Pierre Béal,
Olivier Carton
, Developments in Language Theory - 17th International Conference, DLT 2013, Lecture Notes in Computer Science 7907. Springer Berlin Heidelberg, 2013. 374-383 |
|---|
| 2013 | Szilárd Zsolt Fazekas, Robert Mercas
Robert George Mercas: A Note on the Decidability of subword inequalities)
. In: International Journal of Foundations of Computer Science
, 2013, 445-452 |
|---|
| 2013 | Pawel Gawrychowski,
Florin Manea,
Robert George Mercas,
Dirk Nowotka,
Catalin Tiseanu: Finding Pseudo-repetitions. In: Natacha Portier,
Thomas Wilke, 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013). Leibniz International Proceedings in Informatics, 2013. 257-268 |
|---|
| 2013 | Jürgen Dassow
Florin Manea
Robert George Mercas
Mike Müller: Inner Palindromic Closure. In: Marie-Pierre Béal
Olivier Carton, Developments in Language Theory - 17th International Conference, DLT 2013, Lecture Notes in Computer Science 7907
. Springer Berlin Heidelberg, 2013. 155-166 |
|---|
| 2013 | Robert George Mercas: The lexicographic cross-section of the plactic monoid is regular. In: Juhani Karhumäki, Arto Lepistö, Luca Zamboni, 9th International Conference, WORDS 2013, Lecture Notes in Computer Science 8079. Springer Berlin Heidelberg, 2013. 83-94 |
|---|
| 2012 | Jürgen Dassow,
Florin Manea,
Robert Mercas: Connecting Partial Words and Regular Languages. In: S. Barry Cooper,
Anuj Dawar,
Benedikt Löwe, How the World Computes
Turing Centenary Conference and 8th Conference on Computability in Europe, CiE 2012,
Lecture Notes in Computer Science Volume 7318. Springer-Verlag, 2012. 151-161 |
|---|
| 2012 | Florin Manea,
Robert George Mercas,
Dirk Nowotka: Fine and Wilf's Theorem and Pseudo-repetitions. In: Branislav Rovan,
Vladimiro Sassone,
Peter Widmayer, Mathematical Foundations of Computer Science,
37th International Symposium, MFCS 2012, Lecture Notes in Computer Science
Volume 7464. Springer Berlin Heidelberg, 2012. 668-680 |
|---|
| 2012 | Szilárd Zsolt Fazekas,
Robert George Mercas,
Kayoko Shikishima-Tsuji: Hairpin Completion with Bounded Stem-Loop. In: Hsu-Chun Yen, Oscar H. Ibarra, Developments in Language Theory
16th International Conference, DLT 2012, Lecture Notes in Computer Science
Volume 7410. Springer Berlin Heidelberg, 2012. 428-439 |
|---|
| 2012 | Florin Manea,
Robert George Mercas,
Victor Mitrana: Hairpin Lengthening and Shortening of Regular Languages. In: Henning Bordihn,
Martin Kutrib,
Bianca Truthe, Languages Alive ,Essays Dedicated to Jürgen Dassow on the Occasion of His 65th Birthday, Lecture Notes in Computer Science 7300. Springer Berlin Heidelberg, 2012. 145-159 |
|---|
| 2012 | F. Blanchet-Sadri,
Robert Mercas: The three-squares lemma for partial words with one hole. In: Theoretical Computer Science, 2012, 1-9 |
|---|
| 2011 | Florin Manea,
Robert Mercas,
Cătălin Tiseanu: Periodicity Algorithms for Partial Words. In: Filip Murlak,
Piotr Sankowski, Proceedings Mathematical Foundations of Computer Science 2011 - 36th International Symposium, MFCS 2011,
Lecture Notes in Computer Science Volume 6907. Springer-Verlag, 2011. 472-484 |
|---|
