Fixing the state budget: approximation of regular languages with small DFAs

DOI10.1007/978-3-319-68167-2_5MaRDI QIDQ5096078zbMATH OpenOpenAlexFDO

Authors Graeme Gange, Pierre Ganty, Peter J. Stuckey

Publication date 12 August 2022

Published in Automated Technology for Verification and Analysis (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-68167-2_5

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Fast brief practical DFA minimization
• Smaller representation of finite state automata
• A minimized automaton representation of reachable states
• Smaller representation of finite state automata
• Minimizing nfa's and regular expressions

Cited in

(3)

• Certifying DFA bounds for recognition and separation
• Certifying inexpressibility
• Approximate automata for omega-regular languages

This page was built for publication: Fixing the state budget: approximation of regular languages with small DFAs

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