Compression of finite-state automata through failure transitions
From MaRDI portal
Publication:300258
DOI10.1016/j.tcs.2014.09.007zbMath1338.68139OpenAlexW2118877442MaRDI QIDQ300258
Niklas Zechner, Johanna Björklund, Henrik Björklund
Publication date: 27 June 2016
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2014.09.007
Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Cites Work
- The tractability frontier for NFA minimization
- Bisimulation relations for weighted automata
- Three Partition Refinement Algorithms
- Efficient string matching
- Fast Pattern Matching in Strings
- Finding optimum branchings
- Minimal NFA Problems are Hard
- A Uniform (Bi-)Simulation-Based Framework for Reducing Tree Automata
- Optimum branchings
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Compression of finite-state automata through failure transitions
