8 citations · 8 across the 2 of their papers we have counts for
2 papers
cs.FL2014
More Structural Characterizations of Some Subregular Language Families by Biautomata
Markus Holzer, Sebastian Jakobi
We study structural restrictions on biautomata such as, e.g., acyclicity, permutation-freeness, strongly permutation-freeness, and orderability, to mention a few. We compare the ob…
cs.FL2010★ 8 cited
The Magic Number Problem for Subregular Language Families
Markus Holzer, Sebastian Jakobi, Martin Kutrib
We investigate the magic number problem, that is, the question whether there exists a minimal n-state nondeterministic finite automaton (NFA) whose equivalent minimal deterministic…