This contribution presents an alternative simple algorithm with running time , in which the computation is split into three phases. First, a compact ...
Given a language L and a number l, an l-cover automaton for L is a DFA M such that its language coincides with L on all words of length at most l.
[PDF] Computing all `-cover automata fast - Universität Stuttgart
www.ims.uni-stuttgart.de › jezmal11
Abstract. Given a language L and a number `, an `-cover automaton for L is a DFA M such that its language coincides with L on all words of length at most `.
This contribution presents an alternative simple algorithm with running time O(n log n), in which the computation is split into three phases that allows the ...
#automaton · #performance · Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
An algorithm for searching all covers un- der Hamming, Levenshtein, and Damerau distance using finite automata was introduced by Guth [5], optimized al- gorithm ...
Oct 22, 2024 · Cover automata have been studied as an efficient representation of finite languages. In (*), an algorithm was given to transform a DFA that ...
An algorithm using finite automata approach to computation of all exact covers was intro- duced in [5]. The algorithm presented in [2] searches for one re-.
This paper presents an algorithm which converts an n–state DFA for some finite language L into a corresponding minimal DFCA, using only O(n log n) time and ...
The currently fastest algorithm [12] for calculating minimal cover automata uses ∼ , which in general is not an equivalence relation, but only a compatibility ...