Canonical Nondeterministic Automata - Coalgebraic Methods in Computer Science Access content directly
Conference Papers Year : 2014

Canonical Nondeterministic Automata

Abstract

For each regular language L we describe a family of canonical nondeterministic acceptors (nfas). Their construction follows a uniform recipe: build the minimal dfa for L in a locally finite variety V , and apply an equivalence between the finite V -algebras and a category of finite structured sets and relations. By instantiating this to different varieties we recover three well-studied canonical nfas (the átomaton, the jiromaton and the minimal xor automaton) and obtain a new canonical nfa called the distromaton. We prove that each of these nfas is minimal relative to a suitable measure, and give conditions for state-minimality. Our approach is coalgebraic, exhibiting additional structure and universal properties.
Fichier principal
Vignette du fichier
328263_1_En_11_Chapter.pdf (340.47 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01408760 , version 1 (05-12-2016)

Licence

Attribution

Identifiers

Cite

Robert R. Myers, Jiří Adámek, Stefan Milius, Henning Urbat. Canonical Nondeterministic Automata. 12th International Workshop on Coalgebraic Methods in Computer Science (CMCS), Apr 2014, Grenoble, France. pp.189-210, ⟨10.1007/978-3-662-44124-4_11⟩. ⟨hal-01408760⟩
65 View
289 Download

Altmetric

Share

Gmail Facebook X LinkedIn More