23 citations · 59 across the 13 of their papers we have counts for
Showing 2014 · cs.FLShow all
3 papers · 2 filters
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.FL2014
Cooperating Distributed Grammar Systems of Finite Index Working in Hybrid Modes
Henning Fernau, Rudolf Freund, Markus Holzer
We study cooperating distributed grammar systems working in hybrid modes in connection with the finite index restriction in two different ways: firstly, we investigate cooperating…
cs.FL2014★ 5 cited
From Finite Automata to Regular Expressions and Back--A Summary on Descriptional Complexity
Hermann Gruber, Markus Holzer
The equivalence of finite automata and regular expressions dates back to the seminal paper of Kleene on events in nerve nets and finite automata from 1956. In the present paper we…