A congruence-based perspective on automata minimization algorithms

DOI10.4230/LIPIcs.MFCS.2019.77OpenAlexW2970558699MaRDI QIDQ5092441

Pierre Ganty, Pedro Valero, Elena Gutiérrez

Publication date: 21 July 2022

Full work available at URL: https://arxiv.org/abs/1906.06194

zbMATH Keywords

automatacongruencesminimizationregular languagesdouble-reversal method

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (2)

Unnamed Item ⋮ A Congruence-Based Perspective on Finite Tree Automata

Cites Work

• A polynomial double reversal minimization algorithm for deterministic finite automata
• Theory of átomata
• A Coalgebraic Perspective on Minimization and Determinization
• A First Investigation of Sturmian Trees
• Algebra-coalgebra duality in brzozowski's minimization algorithm
• Automata theory and its applications
• Complexity of atoms, combinatorially
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A congruence-based perspective on automata minimization algorithms