Incremental NFA minimization

DOI10.1016/J.TCS.2024.114621MaRDI QIDQ6558632FDOQ6558632

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

Publication date: 19 June 2024

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

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

zbMATH Keywords

minimizationautomatabisimulation

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Introduction to algorithms.
• Efficiency of a Good But Not Linear Set Union Algorithm
• Title not available (Why is that?)
• Three Partition Refinement Algorithms
• Title not available (Why is that?)
• Title not available (Why is that?)
• An introduction to (co)algebra and (co)induction
• Aggregation-based minimization of finite state automata
• Minimization of finite state automata through partition aggregation
• Title not available (Why is that?)
• Partitioning a graph in \(O(|A|\log_ 2|V|)\)
• Incremental DFA minimisation
• Lowerbounds for Bisimulation by Partition Refinement

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)