All Outputs (15)

Unambiguous Injective Morphisms in Free Groups (2022)
Journal Article
Reidenbach, D., & Day, J. D. (2022). Unambiguous Injective Morphisms in Free Groups. Information and Computation, 289(Part A), https://doi.org/10.1016/j.ic.2022.104946

A morphism g is ambiguous with respect to a word u if there exists a second morphism h 6= g such that g(u) = h(u). Otherwise g is unambiguous with respect to u. Thus unambiguous morphisms are those for which the structure of the morphism is preserved... Read More about Unambiguous Injective Morphisms in Free Groups.

On Billaud words and their companions (2022)
Journal Article
Łopaciuk, S., & Reidenbach, D. (2023). On Billaud words and their companions. Theoretical Computer Science, 940, 231-253. https://doi.org/10.1016/j.tcs.2022.11.004

A Toolkit for Parikh Matrices (2022)
Journal Article
Hutchinson, R. K., Mercas, R., & Reidenbach, D. (2022). A Toolkit for Parikh Matrices. Lecture notes in computer science, 13266, 116-127. https://doi.org/10.1007/978-3-031-07469-1_9

The Billaud Conjecture for vertical bar Sigma vertical bar=4, and Beyond (2022)
Journal Article
Lopaciuk, S., & Reidenbach, D. (2022). The Billaud Conjecture for vertical bar Sigma vertical bar=4, and Beyond. Lecture notes in computer science, 13257, 213-225. https://doi.org/10.1007/978-3-031-05578-2_17

Reducing the ambiguity of Parikh matrices (2021)
Journal Article
Dick, J., Hutchinson, L. K., Mercas, R., & Reidenbach, D. (2021). Reducing the ambiguity of Parikh matrices. Theoretical Computer Science, 860, 23-40. https://doi.org/10.1016/j.tcs.2021.01.025

On the Prefix–Suffix Duplication Reduction (2020)
Journal Article
Fazekas, S. Z., Mercaş, R., & Reidenbach, D. (2020). On the Prefix–Suffix Duplication Reduction. International Journal of Foundations of Computer Science, 31(01), 91-102. https://doi.org/10.1142/s0129054120400067

Unique decipherability in formal languages (2019)
Journal Article
Bell, P. C., Reidenbach, D., & Shallit, J. O. (2020). Unique decipherability in formal languages. Theoretical Computer Science, 804, 149 - 160. https://doi.org/10.1016/j.tcs.2019.11.022

We consider several language-theoretic aspects of various notions of unique decipherability (or unique factorization) in formal languages. Given a language L at some position within the Chomsky hierarchy, we investigate the language of words UD(L) in... Read More about Unique decipherability in formal languages.

Closure properties of pattern languages (2017)
Journal Article
Day, J. D., Reidenbach, D., & Schmid, M. L. (2017). Closure properties of pattern languages. Journal of Computer and System Sciences, 84, 11-31. https://doi.org/10.1016/j.jcss.2016.07.003

Periodicity forcing words (2015)
Journal Article
Day, J. D., Reidenbach, D., & Schneider, J. C. (2015). Periodicity forcing words. Theoretical Computer Science, 601, 2-14. https://doi.org/10.1016/j.tcs.2015.08.033

ON THE DUAL POST CORRESPONDENCE PROBLEM (2014)
Journal Article
DAY, J. D., REIDENBACH, D., & SCHNEIDER, J. C. (2014). ON THE DUAL POST CORRESPONDENCE PROBLEM. International Journal of Foundations of Computer Science, 25(08), 1033-1048. https://doi.org/10.1142/s012905411440022x

Patterns with bounded treewidth (2014)
Journal Article
Reidenbach, D., & Schmid, M. L. (2014). Patterns with bounded treewidth. Information and Computation, 239, 87-99. https://doi.org/10.1016/j.ic.2014.08.010

Regular and context-free pattern languages over small alphabets (2014)
Journal Article
Reidenbach, D., & Schmid, M. L. (2014). Regular and context-free pattern languages over small alphabets. Theoretical Computer Science, 518, 80-95. https://doi.org/10.1016/j.tcs.2013.07.035

Inferring descriptive generalisations of formal languages (2013)
Journal Article
Freydenberger, D. D., & Reidenbach, D. (2013). Inferring descriptive generalisations of formal languages. Journal of Computer and System Sciences, 79(5), 622-639. https://doi.org/10.1016/j.jcss.2012.10.001

Finding shuffle words that represent optimal scheduling of shared memory access (2013)
Journal Article
Reidenbach, D., & Schmid, M. L. (2013). Finding shuffle words that represent optimal scheduling of shared memory access. International Journal of Computer Mathematics, 90(6), 1292-1309. https://doi.org/10.1080/00207160.2012.698007

Unambiguous 1-uniform morphisms (2013)
Journal Article
Nevisi, H., & Reidenbach, D. (2013). Unambiguous 1-uniform morphisms. Theoretical Computer Science, 478, 101-117. https://doi.org/10.1016/j.tcs.2012.11.023