Testing the Equivalence of Regular Languages

@inproceedings{Almeida2009TestingTE,
  title={Testing the Equivalence of Regular Languages},
  author={Marco Almeida and Nelma Moreira and Rog{\'e}rio Reis},
  booktitle={DCFS},
  year={2009}
}
The minimal deterministic finite automaton is generally used to determine regular languages equality. Antimirov and Mosses proposed a rewrite system for deciding regular expressions equivalence of which Almeida et al. presented an improved variant. Hopcroft and Karp pro- posed an almost linear algorithm for testing the equivalence of two de- terministic finite automata that avoids minimisation. In this paper we improve the best-case running time, present an extension of this algo- rithm to non… 

Tables from this paper

Deciding Regular Expressions (In-)Equivalence in Coq
TLDR
This work presents a mechanically verified implementation of an algorithm for deciding regular expression (in-)equivalence within the Coq proof assistant through an iterated process of testing the equivalence of their partial derivatives and also does not construct the underlying automata.
On the Equivalence of Automata for KAT-expressions
TLDR
A decision procedure is obtained where the extra burden of dealing with boolean expressions avoids the explicit use of all possible assignments to the boolean variables, and the decision procedure for testing KAT expressions equivalence without explicitly constructing the automata is specialization.
Formalization of closure properties for context-free grammars
TLDR
The results obtained so far include the representation of context-free grammars, the description of algorithms for some operations on them and the proof of related theorems (e.g. the correctness of these algorithms).
Partial Derivative Automata Formalized in Coq
TLDR
A computer assisted proof of the correctness of a partial derivative automata construction from a regular expression within the Coq proof assistant is presented.
Formalization of simplification for context-free grammars
TLDR
This paper presents a formalization, using the Coq proof assistant, of the fact that general context-free grammars generate languages that can be also generated by simpler and equivalent context- Free Grammars.
ReGiS: Regular Expression Simplification via Rewrite-Guided Synthesis
TLDR
This work presents a new approach called rewrite-guided synthesis (ReGiS), in which a unique interplay between SyGuS and equality saturation-based rewriting helps to overcome problems, resulting in an efficient, scalable framework for expression simplification.
On the semantics of regular expression parsing in the wild
Interface protocol inference to aid understanding legacy software components
TLDR
An approach to infer the interface protocols of software components from the behavioral models of those components, learned by a blackbox technique called active (automata) learning is presented and validated by applying active learning on 202 industrial software components.
Context-Free Grammars: Exercise Generation and Probabilistic Assessment
TLDR
A metagrammar based algorithm for exercise generation in the domain of context-free grammars and a probabilistic assessment algorithm based on a new identity theorem for formal series, a matrix version of the well-known identity theorem from the theory of analytic functions are presented.
...
1
2
...

References

SHOWING 1-10 OF 37 REFERENCES
Antimirov and Mosses's Rewrite System Revisited
TLDR
An improved functional version of Antimirov and Mosses's algorithm for deciding the equivalence of two (extended) regular expressions is presented, and preliminary results lead to the conclusion that these methods are feasible and, most of the time, faster than the classical methods.
On the Representation of Finite Automata
TLDR
An unique string representation, up to isomorphism, for initially connected deterministic finite automata (ICDFA’s) with n states over an alphabet of k symbols is given and how its enumeration provides an alternative way to obtain the exact number of ICDFA”s is shown.
Automata and Computability
  • D. Kozen
  • Computer Science
    Undergraduate Texts in Computer Science
  • 1997
TLDR
This introduction to the basic theoretical models of computability develops their rich and varied structure and culminates in discussions of effective computability, decidability, and Godel's incompleteness theorems.
Antimirov and Mosses's Rewrite System Revisited
TLDR
A functional approach to Antimirov and Mosses's rewrite system for deciding the equivalence of two (extended) regular expressions is presented, and it is concluded that these methods are feasible and, generally, faster than the classical methods.
An Introduction to Automata Theory
Great Aunt Eugenia and other automata Sundry machines Implementing finite automata Implementation and realization Behavioural equivalence, SP partitions and reduced machines Parallel and serial
A Linear Algorithm for Testing Equivalence of Finite Automata.
Abstract : An algorithm is given for determining if two finite automata with start states are equivalent. The asymptotic running time of the algorithm is bounded by a constant times the product of
On the performance of automata minimization algorithms
TLDR
This paper compares the running time of four minimization algorithms based on experimental results and applies these algorithms to both deterministic and nondeterministic random automata.
...
1
2
3
4
...