Creative Commons Attribution 3.0 Unported license (CC-BY 3.0)when quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.MFCS.2019.77
URN: urn:nbn:de:0030-drops-110214
URL: https://drops.dagstuhl.de/opus/volltexte/2019/11021/
Ganty, Pierre ; Gutiérrez, Elena ; Valero, Pedro
A Congruence-based Perspective on Automata Minimization Algorithms
| pdf-format: |
|
Abstract
In this work we use a framework of finite-state automata constructions based on equivalences over words to provide new insights on the relation between well-known methods for computing the minimal deterministic automaton of a language.
BibTeX - Entry
@InProceedings{ganty_et_al:LIPIcs:2019:11021,
author = {Pierre Ganty and Elena Guti{\'e}rrez and Pedro Valero},
title = {{A Congruence-based Perspective on Automata Minimization Algorithms}},
booktitle = {44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019)},
pages = {77:1--77:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-117-7},
ISSN = {1868-8969},
year = {2019},
volume = {138},
editor = {Peter Rossmanith and Pinar Heggernes and Joost-Pieter Katoen},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2019/11021},
URN = {urn:nbn:de:0030-drops-110214},
doi = {10.4230/LIPIcs.MFCS.2019.77},
annote = {Keywords: Double-Reversal Method, Minimization, Automata, Congruences, Regular Languages}
}
| Keywords: | Double-Reversal Method, Minimization, Automata, Congruences, Regular Languages | |
| Seminar: | 44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019) | |
| Issue date: | 2019 | |
| Date of publication: | 20.08.2019 |
