Daniel Reidenbach

Theor. Comput. Sci., 2023

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

Reducing the ambiguity of Parikh matrices.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 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

2017

Closure properties of pattern languages.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2017

2015

Periodicity forcing words.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 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

Regular and context-free pattern languages over small alphabets.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2014

Automata with modulo counters and nondeterministic counter bounds.

[BibT_eX]

[DOI]

Kybernetika, 2014

On the Dual Post Correspondence Problem.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2014

Patterns with bounded treewidth.

[BibT_eX]

[DOI]

Inf. Comput., 2014

Report on BCTCS 2014.

[BibT_eX]

[DOI]

Paul Bell

Bull. EATCS, 2014

2013

Unambiguous 1-uniform morphisms.

[BibT_eX]

[DOI]

Hossein Nevisi

Theor. Comput. Sci., 2013

Inferring descriptive generalisations of formal languages.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2013

Finding shuffle words that represent optimal scheduling of shared memory access.

[BibT_eX]

[DOI]

Int. J. Comput. Math., 2013

2012

Weakly unambiguous morphisms.

[BibT_eX]

[DOI]

Hossein Nevisi

Theor. Comput. Sci., 2012

On multi-head automata with restricted nondeterminism.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2012

Morphic Primitivity and Alphabet Reductions.

[BibT_eX]

[DOI]

Hossein Nevisi

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

2011

Restricted ambiguity of erasing morphisms.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2011

2010

Existence and nonexistence of descriptive patterns.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2010

Bad news on decision problems for patterns.

[BibT_eX]

[DOI]

Inf. Comput., 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

2009

Morphically primitive words.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2009

The unambiguity of segmented morphisms.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2009

2008

Discontinuities in pattern inference.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 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

2006

A non-learnable class of E-pattern languages.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2006

Unambiguous Morphic Images of Strings.

[BibT_eX]

[DOI]

Int. J. Found. 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

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]