Prefix and Right-Partial Derivative Automata
نویسندگان
چکیده
Recently, Yamamoto presented a new method for the conversion from regular expressions (REs) to non-deterministic finite automata (NFA) based on the Thompson ε-NFA (AT). The AT automaton has two quotients discussed: the suffix automaton Asuf and the prefix automaton, Apre. Eliminating ε-transitions in AT, the Glushkov automaton (Apos) is obtained. Thus, it is easy to see that Asuf and the partial derivative automaton (Apd) are the same. In this paper, we characterise the Apre automaton as a solution of a system of left RE equations and express it as a quotient of Apos by a specific left-invariant equivalence relation. We define and characterise the right-partial derivative automaton ( ←− Apd). Finally, we study the average size of all these constructions both experimentally and from an analytic combinatorics point of view.
منابع مشابه
Left Relations
Recently, Yamamoto presented a new method for the conversion from regular expressions (REs) to non-deterministic finite automata (NFA) based on the Thompson ε-NFA (AT ). The AT automaton has two quotients considered: the suffix automaton Asuf and the prefix automaton, Apre. Eliminating ε-transitions in AT , the Glushkov automaton (Apos) is obtained. Thus, it is easy to see that Asuf and the par...
متن کاملState Complexity of Prefix Distance of Subregular Languages
The neighbourhood of a regular language of constant radius with respect to the prefix distance is always regular. We give upper bounds and matching lower bounds for the size of the minimal deterministic finite automaton (DFA) needed for the radius k prefix distance neighbourhood of an n state DFA that recognizes, respectively, a finite, a prefix-convex, a prefix-closed, a prefix-free, and a rig...
متن کاملMyhill-Nerode Fuzzy Congruences Corresponding to a General Fuzzy Automata
Myhill-Nerode Theorem is regarded as a basic theorem in the theories of languages and automata and is used to prove the equivalence between automata and their languages. The significance of this theorem has stimulated researchers to develop that on different automata thus leading to optimizing computational models. In this article, we aim at developing the concept of congruence in general fuzzy...
متن کاملPrefix function view of states and events
Prefix functions are thought as a unifying concept for different ways of looking at discrete processes. The idea of prefix function consists in establishing relations between events and states; different types of such relations correspond to different ways of understanding states being reached in the course of computation. This concept covers such concurrent systems description tools as finite ...
متن کاملPartial Derivative Automata Formalized in Coq
In this paper we present a computer assisted proof of the correctness of a partial derivative automata construction from a regular expression within the Coq proof assistant. This proof is part of a formalization of Kleene algebra and regular languages in Coq towards their usage in program certification.
متن کامل