Suchergebnisse - "Brzozowski’s minimization algorithm"
-
1
Nondeterministic Moore automata and Brzozowski’s minimization algorithm
ISSN: 0304-3975, 1879-2294Veröffentlicht: Elsevier B.V 07.09.2012Veröffentlicht in Theoretical computer science (07.09.2012)“… We propose an algorithm that is a variant of Brzozowski’s minimization algorithm in the sense that it is essentially structured as reverse operation and subset construction performed twice …”
Volltext
Journal Article -
2
Automata Minimization: a Functorial Approach
ISSN: 1860-5974, 1860-5974Veröffentlicht: Logical Methods in Computer Science Association 23.03.2020Veröffentlicht in Logical methods in computer science (23.03.2020)“… In this paper we regard languages and their acceptors - such as deterministic or weighted automata, transducers, or monoids - as functors from input categories …”
Volltext
Journal Article -
3
Standard Sturmian words and automata minimization algorithms
ISSN: 0304-3975, 1879-2294Veröffentlicht: Elsevier B.V 11.10.2015Veröffentlicht in Theoretical computer science (11.10.2015)“… The study of some close connections between the combinatorial properties of words and the performance of the automata minimization process constitutes the main …”
Volltext
Journal Article -
4
Coalgebraic trace semantics via forgetful logics
ISSN: 1860-5974, 1860-5974Veröffentlicht: Logical Methods in Computer Science e.V 27.04.2017Veröffentlicht in Logical methods in computer science (27.04.2017)“… That procedure is closely related to Brzozowski's minimization algorithm …”
Volltext
Journal Article -
5
Automata Minimization: a Functorial Approach
ISSN: 2331-8422Veröffentlicht: Ithaca Cornell University Library, arXiv.org 20.03.2020Veröffentlicht in arXiv.org (20.03.2020)“… In this paper we regard languages and their acceptors - such as deterministic or weighted automata, transducers, or monoids - as functors from input categories …”
Volltext
Paper -
6
Coalgebraic trace semantics via forgetful logics
ISSN: 2331-8422Veröffentlicht: Ithaca Cornell University Library, arXiv.org 27.12.2016Veröffentlicht in arXiv.org (27.12.2016)“… That procedure is closely related to Brzozowski's minimization algorithm …”
Volltext
Paper -
7
Varieties and Covarieties of Languages (Extended Abstract)
ISSN: 1571-0661, 1571-0661Veröffentlicht: Elsevier B.V 04.11.2013Veröffentlicht in Electronic notes in theoretical computer science (04.11.2013)“… Because of the isomorphism (X×A)→X≅X→(A→X), the transition structure of a deterministic automaton with state set X and with inputs from an alphabet A can be …”
Volltext
Journal Article -
8
Automata Minimization: a Functorial Approach
ISSN: 2331-8422Veröffentlicht: Ithaca Cornell University Library, arXiv.org 08.11.2017Veröffentlicht in arXiv.org (08.11.2017)“… In this paper we regard languages and their acceptors -- such as deterministic or weighted automata, transducers, or monoids -- as functors from input …”
Volltext
Paper -
9
A Formalisation of Finite Automata using Hereditarily Finite Sets
ISSN: 2331-8422Veröffentlicht: Ithaca Cornell University Library, arXiv.org 07.05.2015Veröffentlicht in arXiv.org (07.05.2015)“… Its utility is demonstrated through a formalisation of the theory of regular languages and finite automata, including the Myhill-Nerode theorem and Brzozowski's minimisation algorithm …”
Volltext
Paper