Incremental DFA minimisation

DOI10.1051/ITA/2013045MaRDI QIDQ5166502zbMATHOpenAlexFDO

Authors Marco Almeida, Nelma Moreira, Rogério Reis

Publication date 27 June 2014

Published in RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL http://www.numdam.org/item?id=ITA_2014__48_2_173_0/

zbMATH Keywords

finite automataregular languagesminimisation algorithms

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Incremental DFA minimisation
• A split-based incremental deterministic automata minimization algorithm
• scientific article; zbMATH DE number 6300100
• Fast brief practical DFA minimization
• Comments on ``Incremental construction and maintenance of minimal finite-state automata

Cited in

(13)

• Incremental DFA minimisation
• Cycle-aware minimization of acyclic deterministic finite-state automata
• Incremental NFA minimization
• Description and analysis of a bottom-up DFA minimization algorithm
• Efficient minimization of DFAs with partial transition
• Efficient algorithms for the inference of minimum size DFAs
• A note on mc-DFA and its minimization
• Comments on ``Incremental construction and maintenance of minimal finite-state automata
• Minimization of finite state automata through partition aggregation
• Aggregation-based minimization of finite state automata
• A minimized automaton representation of reachable states
• From diagnosis of active systems to incremental determinization of finite acyclic automata
• A split-based incremental deterministic automata minimization algorithm

This page was built for publication: Incremental DFA minimisation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5166502)