Incremental DFA minimisation

DOI10.1007/978-3-642-18098-9_5MaRDI QIDQ3073619zbMATH OpenOpenAlexFDO

Authors Marco Almeida, Nelma Moreira, Rogério Reis

Publication date 11 February 2011

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

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

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

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

Cites work

• Efficiency of a Good But Not Linear Set Union Algorithm
• Enumeration and generation with a string automata representation
• scientific article; zbMATH DE number 1517989 (Why is no real title available?)
• scientific article; zbMATH DE number 3189697 (Why is no real title available?)
• Introduction to algorithms.

Cited in

(11)

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

Describes a project that uses

Uses Software

• FAdo
• GUItar

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 Q3073619)