7 citations · 19 across the 5 of their papers we have counts for
Showing cs.FLShow all
3 papers · 1 filter
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…
cs.FL2012
Enumerating regular expressions and their languages
Hermann Gruber, Jonathan Lee, Jeffrey Shallit
In this chapter we discuss the problem of enumerating distinct regular expressions by size and the regular languages they represent. We discuss various notions of the size of a reg…
cs.FL2009★ 3 cited
On Measuring Non-Recursive Trade-Offs
Hermann Gruber, Markus Holzer, Martin Kutrib
We investigate the phenomenon of non-recursive trade-offs between descriptional systems in an abstract fashion. We aim at categorizing non-recursive trade-offs by bounds on their g…