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

@inproceedings{Gruber2014FromFA,
  title={From Finite Automata to Regular Expressions and Back-A Summary on Descriptional Complexity},
  author={Hermann Gruber and Markus Holzer},
  booktitle={AFL},
  year={2014}
}
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
TLDR
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
TLDR
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
TLDR
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.
Regular Expression Length via Arithmetic Formula Complexity
TLDR
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
TLDR
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, and this enables us to directly employ the standard characterization of LDLf based on finite-state automata to monitor constraints in a fine-grained way.
Learning Interpretable Models in the Property Specification Language
TLDR
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.
Structured Algorithm for Software Behavior Model based on Finite State Automaton
TLDR
This paper analyzes the topology structure algorithm of software behavior model and proposes FSM Diff algorithm based on finite state automaton, which is more effective to select the key state nodes in the software running state diagram.
Subsequences With Gap Constraints: Complexity Bounds for Matching and Analysis Problems
TLDR
It is proved that tight (conditional on the orthogonal vectors (OV) hypothesis) complexity bounds for checking whether a given p is a gc -subsequence of a string w are proved.
Regularity of k-Abelian Equivalence Classes of Fixed Cardinality
TLDR
It is shown that, for any fixed integer \(r\ge 1\), the language of words representing equivalence classes of cardinality r is regular.
Binary Expression of Ancestors in the Collatz Graph
TLDR
This paper implements the algorithm which generates the regular expression, $\texttt{reg}_k(x)$ for any $x$ and $k, and gives a new exploratory tool for further study of the Collatz graph in binary.
...
...

References

SHOWING 1-10 OF 185 REFERENCES
Nondeterministic Finite Automata-Recent Results on the Descriptional and Computational Complexity
TLDR
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
TLDR
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
TLDR
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
TLDR
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
TLDR
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
TLDR
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
TLDR
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.
Obtaining shorter regular expressions from finite-state automata
...
...