Cycle-aware minimization of acyclic deterministic finite-state automata

DOI10.1016/j.dam.2013.08.003zbMath1329.68157OpenAlexW2081929761MaRDI QIDQ496535

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

zbMATH Keywords

minimizationalgorithmicdeterministic finite state automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (2)

From tree automata to string automata minimization ⋮ Branching Measures and Nearly Acyclic NFAs

Uses Software

• fsm2

Cites Work

• Minimisation of acyclic deterministic automata in linear time
• Re-describing an algorithm by Hopcroft
• Describing an algorithm by Hopcroft
• Linear Automaton Transformations
• Incremental Construction of Minimal Acyclic Finite-State Automata
• fsm2 – A Scripting Language for Creating Weighted Finite-State Morphologies
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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