Incremental NFA minimization

DOI10.1016/J.TCS.2024.114621MaRDI QIDQ6558632zbMATH OpenFDO

Authors Christian Bianchini, Alberto Policriti, Brian Riccardi, R. Romanello

Publication date 19 June 2024

Published in Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

minimizationautomatabisimulation

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Incremental DFA minimisation
• Incremental DFA minimisation
• A split-based incremental deterministic automata minimization algorithm
• scientific article; zbMATH DE number 6300100
• Aggregation-based minimization of finite state automata

Cites work

• scientific article; zbMATH DE number 3124495 (Why is no real title available?)
• scientific article; zbMATH DE number 3460178 (Why is no real title available?)
• scientific article; zbMATH DE number 1517989 (Why is no real title available?)
• scientific article; zbMATH DE number 798342 (Why is no real title available?)
• Aggregation-based minimization of finite state automata
• An introduction to (co)algebra and (co)induction
• Efficiency of a Good But Not Linear Set Union Algorithm
• Incremental DFA minimisation
• Introduction to algorithms.
• Lowerbounds for Bisimulation by Partition Refinement
• Minimization of finite state automata through partition aggregation
• Partitioning a graph in \(O(|A|\log_ 2|V|)\)
• Three Partition Refinement Algorithms

Cited in

(1)

• Preface

This page was built for publication: Incremental NFA minimization

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