Zobrazeno 1 - 10
of 51
pro vyhledávání: '"Robert Mercaş"'
Autor:
Christian Choffrut, Robert Mercas
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol Vol. 12 no. 4 (2010)
special issue dedicated to the second edition of the conference AutoMathA: from Mathematics to Applications
Externí odkaz:
https://doaj.org/article/45d44201303244b3988a71ef491a377a
Publikováno v:
ACM Transactions on Computation Theory. 12:1-37
A pattern ɑ (i.e., a string of variables and terminals) matches a word w , if w can be obtained by uniformly replacing the variables of ɑ by terminal words. The respective matching problem, i.e., deciding whether or not a given pattern matches a gi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::af8d234de1390827d2f56726b491bbda
https://doi.org/10.1145/3369935
https://doi.org/10.1145/3369935
Publikováno v:
Language and Automata Theory and Applications
The Parikh matrix mapping allows us to describe words using matrices. Although compact, this description comes with a level of ambiguity since a single matrix may describe multiple words. This work looks at how considering the Parikh matrices of vari
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c900c64ce060803ff57965e88d07ae8d
http://europepmc.org/articles/PMC7206623
http://europepmc.org/articles/PMC7206623
Publikováno v:
International Journal of Foundations of Computer Science. 31:91-102
This work answers some questions proposed by Bottoni, Labella, and Mitrana (Theoretical Computer Science 682, 2017) regarding the prefix–suffix reduction on words. The operation is defined as a reduction by one half of every square that is present
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b68f55bc5b42746e2227db585753f02d
https://doi.org/10.1142/s0129054120400067
https://doi.org/10.1142/s0129054120400067
Publikováno v:
Implementation and Application of Automata ISBN: 9783031074684
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8c635d62305ab336d29fb40dc5203557
https://doi.org/10.1007/978-3-031-07469-1_9
https://doi.org/10.1007/978-3-031-07469-1_9
Autor:
Szilárd Zsolt Fazekas, Robert Mercaş
Publikováno v:
Descriptional Complexity of Formal Systems ISBN: 9783031132568
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::84035d6c4dca4aec65bfbc3c23f3f73a
https://doi.org/10.1007/978-3-031-13257-5_4
https://doi.org/10.1007/978-3-031-13257-5_4
Publikováno v:
Journal of Computer and System Sciences. 101:42-67
Pseudo-repetitions are a natural generalization of the classical notion of repetitions in sequences: they are the repeated concatenation of a word and its encoding under a certain morphism or antimorphism. Thus, such occurrences can be regarded as hi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b1235728f0b00e33bec685f8c4770763
https://doi.org/10.1016/j.jcss.2018.10.004
https://doi.org/10.1016/j.jcss.2018.10.004
Autor:
Robert Mercaş, Szilárd Zsolt Fazekas
Publikováno v:
SOFSEM 2021: Theory and Practice of Computer Science ISBN: 9783030677305
SOFSEM
SOFSEM
This work proposes a new approach towards solving an over 20 years old conjecture regarding the maximum number of distinct squares that a word can contain. To this end we look at clusters of repetition roots, that is, the set of positions where the r
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e251f3f10da63f2565c1e663d1974b6a
https://doi.org/10.1007/978-3-030-67731-2_29
https://doi.org/10.1007/978-3-030-67731-2_29
Autor:
Anna Frid, Robert Mercaş
This book constitutes the refereed proceedings of the 14th International Conference on Combinatorics on Words, WORDS 2023, held in Umeå, Sweden, during June 12–16, 2023.The 19 contributed papers presented in this book were carefully reviewed and s
Publikováno v:
Language and Automata Theory and Applications ISBN: 9783030406073
LATA
LATA
The Parikh matrix mapping allows us to describe words using matrices. Although compact, this description comes with a level of ambiguity since a single matrix may describe multiple words. This work looks at how considering the Parikh matrices of vari
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::72b602a28394c039e12c3f7aaaa57dd3
https://doi.org/10.1007/978-3-030-40608-0_28
https://doi.org/10.1007/978-3-030-40608-0_28