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.2017.52
URN: urn:nbn:de:0030-drops-81324
URL: https://drops.dagstuhl.de/opus/volltexte/2017/8132/
Colcombet, Thomas ; Petrisan, Daniela
Automata in the Category of Glued Vector Spaces
| pdf-format: |
|
Abstract
In this paper we adopt a category-theoretic approach to the conception of automata classes enjoying minimization by design. The main instantiation of our construction is a new class of automata that are hybrid between deterministic automata and automata weighted over a field.
BibTeX - Entry
@InProceedings{colcombet_et_al:LIPIcs:2017:8132,
author = {Thomas Colcombet and Daniela Petrisan},
title = {{Automata in the Category of Glued Vector Spaces}},
booktitle = {42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017)},
pages = {52:1--52:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-046-0},
ISSN = {1868-8969},
year = {2017},
volume = {83},
editor = {Kim G. Larsen and Hans L. Bodlaender and Jean-Francois Raskin},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2017/8132},
URN = {urn:nbn:de:0030-drops-81324},
doi = {10.4230/LIPIcs.MFCS.2017.52},
annote = {Keywords: hybrid set-vector automata, automata minimization in a category}
}
| Keywords: | hybrid set-vector automata, automata minimization in a category | |
| Seminar: | 42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017) | |
| Issue date: | 2017 | |
| Date of publication: | 01.12.2017 |
