Cycle-aware minimization of acyclic deterministic finite-state automata

DOI10.1016/J.DAM.2013.08.003zbMATH Open1329.68157OpenAlexW2081929761MaRDI QIDQ496535FDOQ496535

Authors: Johannes Bubenzer 

Publication date: 22 September 2015

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2013.08.003

Recommendations

• Minimisation of acyclic deterministic automata in linear time
• Description and analysis of a bottom-up DFA minimization algorithm
• A fast and simple algorithm for constructing minimal acyclic deterministic finite automata
• Fast brief practical DFA minimization
• Incremental DFA minimisation

zbMATH Keywords

minimizationalgorithmicdeterministic finite state automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• \(fsm2\) --- A scripting language for creating weighted finite-state morphologies
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Incremental Construction of Minimal Acyclic Finite-State Automata
• Re-describing an algorithm by Hopcroft
• Describing an algorithm by Hopcroft
• Minimisation of acyclic deterministic automata in linear time
• Linear Automaton Transformations
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (4)

• From tree automata to string automata minimization
• Branching measures and nearly acyclic NFAs
• A fast and simple algorithm for constructing minimal acyclic deterministic finite automata
• Minimisation of acyclic deterministic automata in linear time

Uses Software

• fsm2

This page was built for publication: Cycle-aware minimization of acyclic deterministic finite-state automata

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