scientific article; zbMATH DE number 6917169

DOI10.4230/LIPICS.CALCO.2017.8zbMATH Open1433.68222arXiv1711.03063MaRDI QIDQ4580203FDOQ4580203

Thomas Colcombet, Daniela Petrişan

Publication date: 13 August 2018

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

Title of this publication is not available (Why is that?)

zbMATH Keywords

minimizationsubsequential transducersBrzozowskiś minimization algorithmChoffrut's minimization algorithmfunctor automata

Mathematics Subject Classification ID

Algebraic theory of languages and automata (68Q70) Adjoint functors (universal constructions, reflective subcategories, Kan extensions, etc.) (18A40) Functor categories, comma categories (18A25) Categories of machines, automata (18B20)

Cited In (7)

• Coalgebraic minimization of automata by initiality and finality
• Minimization of automata for liveness languages
• Minimizing Generalized Büchi Automata
• Minimisation in logical form
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Recommendations

• A graph theoretic approach to automata minimality 👍 👎
• Minimization of symbolic automata 👍 👎
• Minimisation of automata 👍 👎
• 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?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎

This page was built for publication:

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