Incremental DFA minimisation

DOI10.1051/ITA/2013045zbMATH Open1366.68132OpenAlexW2155765172MaRDI QIDQ5166502FDOQ5166502

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/

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

zbMATH Keywords

finite automataregular languagesminimisation algorithms

Mathematics Subject Classification ID

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

Cited In (11)

• Incremental NFA minimization
• Minimization of Finite State Automata Through Partition Aggregation
• Incremental DFA minimisation
• A note on mc-DFA and its minimization
• Description and analysis of a bottom-up DFA minimization algorithm
• Aggregation-based minimization of finite state automata
• A split-based incremental deterministic automata minimization algorithm
• Efficient algorithms for the inference of minimum size DFAs
• Efficient minimization of DFAs with partial transition
• A minimized automaton representation of reachable states
• Comments on ``Incremental construction and maintenance of minimal finite-state automata

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)