From Finite Automata to Regular Expressions and Back-A Summary on Descriptional Complexity

  title={From Finite Automata to Regular Expressions and Back-A Summary on Descriptional Complexity},
  author={Hermann Gruber and 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 tour a fragment of the literature and summarize results on upper and lower bounds on the conversion of finite automata to regular expressions and vice versa. We also briefly recall the known bounds for the removal of spontaneous transitions (epsilon-transitions) on non-epsilon-free nondeterministic devices. Moreover… 

Figures and Tables from this paper

Conversion of Deterministic and Non-Deterministic Finite Automata to Regular Expression using Brzozowski Algebraic Method

For conversion of deterministic and nondeterministic finite automata to regular expression, Brzozowski Algebraic method, also known as Arden's Theorem is used in this paper because of its simplicity and straight forwardness.

Constrained Expressions and their Derivatives

This paper proposes an extension to classical regular expressions by the addition of two operators allowing the inclusion of boolean formulae from the zeroth order logic called constrained expressions, and shows that the language associated when both interpretation and realization are fixed is stricly regular and can be not regular otherwise.

The Formal Language Theory Column

This work states that by suitably restricting more general models such as context-free grammars, pushdown automata, and Turing machines, that characterize wider classes of languages, it is possible to obtain formal models that generate or recognize regular languages only.

On the Mother of All Automata: The Position Automaton

New relations to the taxonomy of different conversions from regular expressions to equivalent finite automata are contributed and it turns out that although the conversion of regular expressions and reversal of regular Expression to finite Automata seems quite similar, there are significant differences.

Solving of Regular Equations Revisited (extended version)

It is shown that operations such as subtraction and shuffling can be expressed via some appropriate set of regular equations and obtained direct (algebraic) methods without having to convert to and from finite automaton.

State complexity of permutation on finite languages over a binary alphabet

A deterministic parsing algorithm for ambiguous regular expressions

A new parser generator, called Berry–Sethi Parser (BSP), is introduced, for ambiguous regular expressions (RE), which constructs a deterministic finite-state transducer that recognizes an input string and additionally outputs a linear representation of all the syntax trees of the string.

Regular Expression Length via Arithmetic Formula Complexity

Lower bounds on the length of regular expressions for finite languages by methods from arithmetic circuit complexity and a lower bound method for multilinear arithmetic formulas by so-called log-product polynomials to regular expressions are proved.

Monitoring Constraints and Metaconstraints with Temporal Logics on Finite Traces

It is shown that ldlf is able to declaratively express, in the logic itself, not only the constraints to be monitored, but also the de facto standard rv-LTL monitors, which enables the standard characterization of ldl based on finite-state automata to monitor constraints in a fine-grained way.

Learning Interpretable Models in the Property Specification Language

This work develops a learning algorithm for formulas in the IEEE standard temporal logic PSL (Property Specification Language), motivated by the fact that many natural properties cannot be expressed in LTL, whereas it is easy to express such properties in PSL.



Nondeterministic Finite Automata-Recent Results on the Descriptional and Computational Complexity

This paper discusses recent developments relevant to NFAs related problems like, for example, simulation of and by several types of finite automata, minimization and approximation, size estimation of minimal NFAs, and state complexity of language operations.

Descriptional Complexity of (Un)ambiguous Finite State Machines and Pushdown Automata

This paper summarizes and discusses developments relevant to (un)ambiguous finite automata and pushdown automata problems from the descriptional complexity point of view and draws attention to the big picture and some of the main ideas involved.

Informatik Regular Expressions From Deterministic Finite Automata , Revisited

This work significantly improves the upper bound on the conversion of deterministic finite automata to equivalent regular expressions, proving that every digraph with bounded average outdegree has a large induced subdigraph of small cycle rank, which can be advantageously transformed.

Incomplete Transition Complexity of Basic Operations on Finite Languages

This paper corrects the published state complexity of concatenation for complete DFAs and provides a tight upper bound for the case when the right automaton is larger than the left one.

Series-Parallel Automata and Short Regular Expressions

This work presents 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) and presents an algorithm for the generation of automata of this class and an enumerative formula for the underlying digraphs with a given number of vertices.

Short Regular Expressions from Finite Automata: Empirical Results

It is shown that the problem of finding optimal elimination orderings can be used to estimate the cycle rank of the underlying automata and a simple greedy heuristic by [M. Delgado, J. Morais]: Approximation to the smallest regular expression for a given regular language almost always outperforms all other strategies, including those with a provable performance guarantee.

Provably Shorter Regular Expressions from Deterministic Finite Automata

It is shown that there is an elimination ordering such that every language over a binary alphabet accepted by an n-state deterministicfinite automaton has alphabetic width at most O(1.742n), which is, to the knowledge, the algorithm with currently the best known performance guarantee.

Translation of binary regular expressions into nondeterministic ε-free automata with transitions

  • V. Geffert
  • Computer Science
    J. Comput. Syst. Sci.
  • 2003