Incremental NFA minimization

DOI10.1016/J.TCS.2024.114621MaRDI QIDQ6558632

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

Publication date: 19 June 2024

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

zbMATH Keywords

automataminimizationbisimulation

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

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

Related Items (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)