Daniel Reidenbach

Inf. Comput., 2025

2022

Unambiguous injective morphisms in free groups.

[BibT_eX]

[DOI]

Inf. Comput., 2022

A Toolkit for Parikh Matrices.

[BibT_eX]

[DOI]

Laura K. Hutchinson

Robert Mercas

Proceedings of the Implementation and Application of Automata, 2022

The Billaud Conjecture for ${|{\varSigma } |} = 4$, and Beyond.

[BibT_eX]

[DOI]

Szymon Lopaciuk

Proceedings of the Developments in Language Theory - 26th International Conference, 2022

2021

On Billaud Words and Their Companions.

[BibT_eX]

[DOI]

Szymon Lopaciuk

Proceedings of the Combinatorics on Words - 13th International Conference, 2021

2020

Unique decipherability in formal languages.

[BibT_eX]

[DOI]

Paul C. Bell

Jeffrey O. Shallit

Theor. Comput. Sci., 2020

On the Prefix-Suffix Duplication Reduction.

[BibT_eX]

[DOI]

Szilárd Zsolt Fazekas

Robert Mercas

Int. J. Found. Comput. Sci., 2020

Reducing the Ambiguity of Parikh Matrices.

[BibT_eX]

[DOI]

Proceedings of the Language and Automata Theory and Applications, 2020

2015

Factorization in Formal Languages.

[BibT_eX]

[DOI]

Paul C. Bell

Jeffrey O. Shallit

Proceedings of the Developments in Language Theory - 19th International Conference, 2015

Ambiguity of Morphisms in a Free Group.

[BibT_eX]

[DOI]

Proceedings of the Combinatorics on Words - 10th International Conference, 2015

2014

Report on BCTCS 2014.

[BibT_eX]

[DOI]

Paul Bell

Bull. EATCS, 2014

Closure Properties of Pattern Languages.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory - 18th International Conference, 2014

2013

Unambiguous 1-uniform morphisms.

[BibT_eX]

[DOI]

Hossein Nevisi

Theor. Comput. Sci., 2013

On the Dual Post Correspondence Problem.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory - 17th International Conference, 2013

Periodicity Forcing Words.

[BibT_eX]

[DOI]

Proceedings of the Combinatorics on Words - 9th International Conference, 2013

2012

On multi-head automata with restricted nondeterminism.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2012

Automata with Modulo Counters and Nondeterministic Counter Bounds.

[BibT_eX]

[DOI]

Proceedings of the Implementation and Application of Automata, 2012

Patterns with Bounded Treewidth.

[BibT_eX]

[DOI]

Proceedings of the Language and Automata Theory and Applications, 2012

Regular and Context-Free Pattern Languages over Small Alphabets.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory - 16th International Conference, 2012

Morphic Primitivity and Alphabet Reductions.

[BibT_eX]

[DOI]

Hossein Nevisi

Proceedings of the Developments in Language Theory - 16th International Conference, 2012

2011

Weakly Unambiguous Morphisms.

[BibT_eX]

[DOI]

Hossein Nevisi

Proceedings of the 28th International Symposium on Theoretical Aspects of Computer Science, 2011

Finding Shuffle Words That Represent Optimal Scheduling of Shared Memory Access.

[BibT_eX]

[DOI]

Proceedings of the Language and Automata Theory and Applications, 2011

2010

A Polynomial Time Match Test for Large Classes of Extended Regular Expressions.

[BibT_eX]

[DOI]

Proceedings of the Implementation and Application of Automata, 2010

Restricted Ambiguity of Erasing Morphisms.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory, 14th International Conference, 2010

Inferring Descriptive Generalisations of Formal Languages.

[BibT_eX]

[DOI]

Proceedings of the COLT 2010, 2010

2009

Morphically primitive words.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2009

Existence and Nonexistence of Descriptive Patterns.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory, 13th International Conference, 2009

2008

Discontinuities in pattern inference.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2008

Bad News on Decision Problems for Patterns.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory, 12th International Conference, 2008

2007

An Examination of Ohlebusch and Ukkonen's Conjecture on the Equivalence Problem for E-Pattern Languages.

[BibT_eX]

[DOI]

J. Autom. Lang. Comb., 2007

The Unambiguity of Segmented Morphisms.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory, 11th International Conference, 2007

2006

A non-learnable class of E-pattern languages.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2006

The ambiguity of morphisms in free monoids and its impact on algorithmic properties of pattern languages.

[BibT_eX]

[DOI]

Proceedings of the Ausgezeichnete Informatikdissertationen 2006, 2006

The ambiguity of morphisms in free monoids and its impact on algorithmic properties of pattern languages.

[BibT_eX]

[DOI]

PhD thesis, 2006

2005

Unambiguous Morphic Images of Strings.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory, 9th International Conference, 2005

2004

A Discontinuity in Pattern Inference.

[BibT_eX]

[DOI]

Proceedings of the STACS 2004, 2004

On the Equivalence Problem for E-pattern Languages over Small Alphabets.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory, 2004

On the Learnability of E-pattern Languages over Small Alphabets.

[BibT_eX]

[DOI]

Proceedings of the Learning Theory, 17th Annual Conference on Learning Theory, 2004

2002

A Negative Result on Inductive Inference of Extended Pattern Languages.

[BibT_eX]

[DOI]