We formalize a unified framework for verified decision procedures for regular expression equivalence. Five recently published formalizations of such decision procedures (three based on derivatives, two on marked regular expressions) can be obtained as instances of the framework. We discover that the two approaches based on marked regular expressions, which were previously thought to be the same...

An associate inverse subsemigroup of a regular semigroup S is a subsemigroup T of S containing a least associate x∗ of each x ∈ S, in relation to the natural partial order ≤S in S. In [1] the authors describe the structure of regular semigroups with an associate inverse subsemigroup, satisfying two natural conditions. In this paper we describe all ∗-congruences on such class of semigroups.

This theory defines deterministic and nondeterministic automata in a functional representation: the transition function/relation and the finality predicate are just functions. Hence the state space may be infinite. It is shown how to convert regular expressions into such automata. A scanner (generator) is implemented with the help of functional automata: the scanner chops the input up into long...

The relationship between space vector modulation and regular-sampled PWM techniques for hard-switching PWM inverters and rectifiers are reexamined in this paper. Space vector modulation with optimized apportioning of null vector time that results in minimum current THD is investigated and is compared with previously known methods. The conventional optimal regular-sampled PWM method and its rela...

The tree automaton completion is an algorithm used for proving safety properties on systems which can be modeled by a term rewriting system. This representation and verification technique works well for proving properties on infinite systems like cryptographic protocols or more recently on Java Bytecode programs. This algorithm computes a tree automaton which represents a (regular) over approxi...

This paper discusses on several variants of a fascinating problem of deciding whether two nite substitutions are equivalent on a regular language, as well as its relations to the equivalence problems of sequential transducers. Among other things it is proved to be decidable whether for a regular language L and two substitutions ' and , the latter one being a pre x substitution, the relation '(w...

A b s t r a c t. The paper deals with functional properties of three-valued logics. We consider the family of regular three-valued Kleene's logics (strong, weak, intermediate) and it's extensions by adding an implicative connectives (" natural " implications). The main result of our paper is the lattice that describes the relations between implicative extensions of regular logics. In this paper...

We consider the problem of recurrent reachability over infinite systems given by regular relations on words and trees, i.e, whether a given regular set of states can be reached infinitely often from a given initial state in the given transition system. Under the condition that the transitive closure of the transition relation is regular, we show that the problem is decidable, and the set of all...