Suchergebnisse - Brzozowski's algorithm
-
1
On Brzozowski’s algorithm, pumping lemma, and monoid representation for a typical hesitant fuzzy multiset language
ISSN: 2511-2104, 2511-2112Veröffentlicht: 31.07.2025Veröffentlicht in International journal of information technology (Singapore. Online) (31.07.2025)Volltext
Journal Article -
2
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 -
3
Polynomial crisp-minimization algorithm for fuzzy deterministic automata
ISSN: 0165-0114Veröffentlicht: Elsevier B.V 01.11.2024Veröffentlicht in Fuzzy sets and systems (01.11.2024)“… Designing automata minimization algorithms is a significant topic in Automata Theory and Languages with practical applications …”
Volltext
Journal Article -
4
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 -
5
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)“… These relationships have been, in fact, the basis of the study of the tightness and the extremal cases of Hopcroft's algorithm, that is, up to now, the most efficient minimization method …”
Volltext
Journal Article -
6
A polynomial double reversal minimization algorithm for deterministic finite automata
ISSN: 0304-3975, 1879-2294Veröffentlicht: Elsevier B.V 27.05.2013Veröffentlicht in Theoretical computer science (27.05.2013)“… from Brzozowski’s double reversal algorithm. To do so, we take into account the framework by Brzozowski and Tamm, to propose an atomization algorithm that allows us to achieve …”
Volltext
Journal Article -
7
Minimal Determinization Algorithm for Fuzzy Automata
ISSN: 1063-6706, 1941-0034Veröffentlicht: New York IEEE 01.11.2023Veröffentlicht in IEEE transactions on fuzzy systems (01.11.2023)“… The determinization of fuzzy automata is a well-studied problem in theoretical computer science celebrated for its practical applications. Indeed, in the …”
Volltext
Journal Article -
8
Further improvements of determinization methods for fuzzy finite automata
ISSN: 0165-0114, 1872-6801Veröffentlicht: Elsevier B.V 15.10.2016Veröffentlicht in Fuzzy sets and systems (15.10.2016)“… ], in the sense that they produce smaller automata, while require the same computation time. The only exception is the Brzozowski type determinization algorithm developed recently by Jančić and Ćirić [34 …”
Volltext
Journal Article -
9
Canonization of max-min fuzzy automata
ISSN: 0165-0114, 1872-6801Veröffentlicht: Elsevier B.V 01.12.2019Veröffentlicht in Fuzzy sets and systems (01.12.2019)“… The canonization method is derived from the well-known Brzozowski's algorithm for ordinary nondeterministic automata …”
Volltext
Journal Article -
10
On the Power of Automata Minimization in Reactive Synthesis
ISSN: 2075-2180, 2075-2180Veröffentlicht: 17.09.2021Veröffentlicht in Electronic proceedings in theoretical computer science (17.09.2021)Volltext
Journal Article -
11
Partial derivatives of regular expressions and finite automaton constructions
ISSN: 0304-3975, 1879-2294Veröffentlicht: Elsevier B.V 11.03.1996Veröffentlicht in Theoretical computer science (11.03.1996)“… The notion is a generalization of the known notion of word derivative due to Brzozowski: partial derivatives are related to non-deterministic finite automata (NFA's …”
Volltext
Journal Article -
12
On the Power of Automata Minimization in Reactive Synthesis
ISSN: 2331-8422Veröffentlicht: Ithaca Cornell University Library, arXiv.org 17.09.2021Veröffentlicht in arXiv.org (17.09.2021)“… Here, we present a thorough investigation on two classical minimization algorithms, namely, the Hopcroft and Brzozowski algorithms …”
Volltext
Paper -
13
Extension of Brzozowski’s derivation calculus of rational expressions to series over the free partially commutative monoids
ISSN: 0304-3975, 1879-2294Veröffentlicht: Amsterdam Elsevier B.V 09.06.2008Veröffentlicht in Theoretical computer science (09.06.2008)“… We introduce an extension of the derivatives of rational expressions to expressions denoting formal power series over partially commuting variables. The …”
Volltext
Journal Article -
14
Position Automata for Kleene Algebra with Tests
ISSN: 1843-8121, 2248-2695Veröffentlicht: Iasi Alexandru Ioan Cuza University of Iasi 01.01.2012Veröffentlicht in Scientific annals of computer science (01.01.2012)“… This algorithm generalizes Brzozowski's algorithm for regular expressions and inherits its inefficiency arising from the explicit computation …”
Volltext
Journal Article -
15
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 -
16
Finite determinization of fuzzy automata using a parametric product-based t-norm
ISSN: 0165-0114, 1872-6801Veröffentlicht: Elsevier B.V 15.07.2024Veröffentlicht in Fuzzy sets and systems (15.07.2024)“… However, using the parametric t-norm, we obtain an algorithm that outputs a finite minimal deterministic fuzzy automaton whose behavior differs from the starting fuzzy automaton described above …”
Volltext
Journal Article -
17
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 -
18
Certified Parsing of Dependent Regular Grammars
ISSN: 2770-8411Veröffentlicht: IEEE 01.05.2022Veröffentlicht in Proceedings (IEEE Security and Privacy Workshops. Online) (01.05.2022)“… bind.However, it is not obvious how to actually parse dependent regular grammars. We implement a Brzozowski derivative based matching algorithm, and we show how many …”
Volltext
Tagungsbericht -
19
POSIX Lexing with Derivatives of Regular Expressions
ISSN: 0168-7433, 1573-0670Veröffentlicht: Dordrecht Springer Netherlands 01.09.2023Veröffentlicht in Journal of automated reasoning (01.09.2023)“… Brzozowski introduced the notion of derivatives for regular expressions. They can be used for a very simple regular expression matching algorithm …”
Volltext
Journal Article -
20
Experimental evaluation of explicit and symbolic automata-theoretic algorithms
ISBN: 0542673088, 9780542673085Veröffentlicht: ProQuest Dissertations & Theses 01.01.2006“… I propose a probabilistic framework for testing the performance of automata-theoretic algorithms, and use it to compare empirically Brzozowski's and Hopcroft's minimization algorithms …”
Volltext
Dissertation

