2014
DOI: 10.1016/j.tcs.2014.09.007
|View full text |Cite
|
Sign up to set email alerts
|

Compression of finite-state automata through failure transitions

Abstract: This is a PDF file of an unedited manuscript that has been accepted for publication. As a service to our customers we are providing this early version of the manuscript. The manuscript will undergo copyediting, typesetting, and review of the resulting proof before it is published in its final form. Please note that during the production process errors may be discovered which could affect the content, and all legal disclaimers that apply to the journal pertain. Compression of finite AbstractSeveral linear-time… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
8
0

Year Published

2014
2014
2024
2024

Publication Types

Select...
2
2
1

Relationship

0
5

Authors

Journals

citations
Cited by 6 publications
(8 citation statements)
references
References 21 publications
0
8
0
Order By: Relevance
“…It is very well conceivable however that such approaches are better applied ex post facto to a classical factor oracle, i.e. in the course of applying one of the DFA-to-FDFA algorithms described in [13,14].…”
Section: Discussionmentioning
confidence: 99%
See 1 more Smart Citation
“…It is very well conceivable however that such approaches are better applied ex post facto to a classical factor oracle, i.e. in the course of applying one of the DFA-to-FDFA algorithms described in [13,14].…”
Section: Discussionmentioning
confidence: 99%
“…The FDFA construction algorithm given in [13] takes a complete DFA as input, and uses a heuristic involving the construction of a formal concept lattice to replace sets of symbol transitions by failure arcs. Björklund et al [14] recently showed that even without changing the state set from DFA to FDFA, the problem of minimizing the number of transitions by replacing symbol transitions by failure transitions is NP-complete, but can be approximated efficiently within a factor of 2 3 . Due to the above results, a different approach from ex post facto replacement of sets of symbol transitions by failure transitions was taken by the authors of [15].…”
Section: Introductionmentioning
confidence: 99%
“…However, unlike AC-fail, the resulting FDFA may not necessarily be transition-minimal with respect to the language that is defined. Indeed, Björklund, Björklund, and Zechner (2014) have shown that it is computationally hard to derive a language-equivalent transition minimal FDFA from an arbitrary DFA.…”
Section: Brief History Of Fdfasmentioning
confidence: 99%
“…How should one determine the effectiveness of algorithms that generate language-equivalent FDFAs since Björklund et al (2014) have proved that it is computationally hard to determine whether a given FDFA has maximally reduced the number of transitions? Starting with some randomly generated complete DFA, there is no self-evident way of deciding how well or badly DHA has performed.…”
Section: Generating Generalised Datamentioning
confidence: 99%
“…A wellknown technique for reducing the size of large finite-state automata is the use of failure transitions (Aho and Corasick, 1975;Mohri, 1995;Crochemore and Hancart, 1997;Kourie et al, 2012;Björklund et al, 2014). While automata help to find strings in text, more advanced text processing tasks are often based on knowledge bases that provide information on characteristic portions of input texts (endings, words, phrases, etc.).…”
Section: Introductionmentioning
confidence: 99%