A Compact Proof of Decidability for Regular Expression Equivalence
نویسنده
چکیده
The article describes a compact formalization of the relation between regular expressions and deterministic finite automata, and a formally verified, efficient algorithm for testing regular expression equivalence, both based on the notion of pointed regular expression [8].
منابع مشابه
Decidability of Split Equivalence
We show that the following problem is decidable: given expressions E1 and E2 constructed from variables by the regular operations and shuffle, is the identity E1 = E2 true for all instantiations of its variables by strings? Our proof uses the notations developed in the causal approach to concurrency. As a byproduct we obtain decidability of similar equivalence for other formalisms. In particula...
متن کاملWeak mu-equality is decidable
In this paper we consider the set T T µ of µ-types, an extension of the set T T of simple types freely generated from a set A of atomic types and the type constructor → , by a new operator µ, to explicitly denote solutions of recursive equations like A = µ A → β. We show that this so-called weak µ-equality for µ-types is decidable by defining a derivation system for weak µ-equality based on sta...
متن کاملDecidability of Bisimulation Equivalence for First-Order Grammars
A self-contained proof of the decidability of bisimulation equivalence for first-order grammars is given. This provides an alternative for Sénizergues’ decidability proof (1998,2005) for nondeterministic pushdown automata with deterministic popping ε-steps, which generalized his decidability proof for language equivalence of deterministic pushdown automata.
متن کاملSchema Revisited
Two schema problems from the 1970s are examined, monadic recursion schemes and first-order recursion schemas. Research on these problems halted because they were shown to be equivalent to the problem of decidability of language equivalence between DPDA (deterministic pushdown automata). Recently a decidability proof for equivalence of DPDA was given by Sénizergues [10, 11], which therefore also...
متن کاملDecidability Properties of Recursive Types
In this paper we study decision problems and invertibility for two notions of equivalence of recursive types. In particular, for recursive types presented by means of a recursion operator μ, we describe an algorithm showing that the natural equivalence generated by finitely many steps of folding and unfolding of μ-types is decidable. For recursive types presented by finite systems of recursive ...
متن کامل