Computing All ℓ-Cover Automata Fast

DOI10.1007/978-3-642-22256-6_19zbMath1297.68142OpenAlexW8752349MaRDI QIDQ5200065

Artur Jeż, Andreas Maletti

Publication date: 29 July 2011

Published in: Implementation and Application of Automata (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-22256-6_19

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (1)

More on deterministic and nondeterministic finite cover automata

Cites Work

• Hierarchical clustering schemes
• The structure and construction of taxonomic hierarchies
• Describing an algorithm by Hopcroft
• Beyond Hyper-Minimisation--Minimising DBAs and DPAs is NP-Complete
• AN EFFICIENT ALGORITHM FOR CONSTRUCTING MINIMAL COVER AUTOMATA FOR FINITE LANGUAGES
• On Minimising Automata with Errors
• Hyper-minimisation Made Efficient
• Hyper-minimizing minimized deterministic finite state automata
• Similarity relations and cover automata
• A TIME AND SPACE EFFICIENT ALGORITHM FOR MINIMIZING COVER AUTOMATA FOR FINITE LANGUAGES
• Minimal cover-automata for finite languages

This page was built for publication: Computing All ℓ-Cover Automata Fast