Parallel recognition and decomposition of two terminal series parallel graphs
Information and Computation
Parallel recognition of series-parallel graphs
Information and Computation
SIAM Journal on Computing
Linear-time computability of combinatorial problems on series-parallel graphs
Journal of the ACM (JACM)
Characterization of Glushkov automata
Theoretical Computer Science
Programming Techniques: Regular expression search algorithm
Communications of the ACM
Introduction to Automata Theory, Languages and Computability
Introduction to Automata Theory, Languages and Computability
Parallel Algorithms for Series Parallel Graphs
ESA '96 Proceedings of the Fourth Annual European Symposium on Algorithms
The recognition of Series Parallel digraphs
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
A characterization of Thompson digraphs
Discrete Applied Mathematics
Obtaining shorter regular expressions from finite-state automata
Theoretical Computer Science
Enumeration and limit laws for series-parallel graphs
European Journal of Combinatorics
Regular expressions: new results and open problems
Journal of Automata, Languages and Combinatorics
Provably Shorter Regular Expressions from Deterministic Finite Automata
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
Digraphs: Theory, Algorithms and Applications
Digraphs: Theory, Algorithms and Applications
The language, the expression, and the (small) automaton
CIAA'05 Proceedings of the 10th international conference on Implementation and Application of Automata
Acyclic automata with easy-to-find short regular expressions
CIAA'05 Proceedings of the 10th international conference on Implementation and Application of Automata
| Hi-index | 0.00 |
Computing short regular expressions equivalent to a given finite automaton is a hard task. In this work we present a class of acyclic automata for which it is possible to obtain in time O(n$^{2}$ log n) an equivalent regular expression of size O(n). A characterisation of this class is made using properties of the underlying digraphs that correspond to the series-parallel digraphs class. Using this characterisation we present an algorithm for the generation of automata of this class and an enumerative formula for the underlying digraphs with a given number of vertices.