Výsledky vyhľadávania - Brzozowski's algorithm

  1. 1
  2. 2

    Nondeterministic Moore automata and Brzozowski’s minimization algorithm Autor Castiglione, G., Restivo, A., Sciortino, M.

    ISSN: 0304-3975, 1879-2294
    Vydavateľské údaje: Elsevier B.V 07.09.2012
    Vydané v 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…”
    Získať plný text
    Journal Article
  3. 3

    Polynomial crisp-minimization algorithm for fuzzy deterministic automata Autor de Mendívil Grau, Aitor González, Fariña, Federico, Stanimirović, Stefan, Micić, Ivana, de Mendívil, José Ramón González

    ISSN: 0165-0114
    Vydavateľské údaje: Elsevier B.V 01.11.2024
    Vydané v Fuzzy sets and systems (01.11.2024)
    “…Designing automata minimization algorithms is a significant topic in Automata Theory and Languages with practical applications…”
    Získať plný text
    Journal Article
  4. 4

    Automata Minimization: a Functorial Approach Autor Colcombet, Thomas, Petrişan, Daniela

    ISSN: 1860-5974, 1860-5974
    Vydavateľské údaje: Logical Methods in Computer Science Association 23.03.2020
    Vydané v 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…”
    Získať plný text
    Journal Article
  5. 5

    Standard Sturmian words and automata minimization algorithms Autor Castiglione, G., Sciortino, M.

    ISSN: 0304-3975, 1879-2294
    Vydavateľské údaje: Elsevier B.V 11.10.2015
    Vydané v 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…”
    Získať plný text
    Journal Article
  6. 6

    A polynomial double reversal minimization algorithm for deterministic finite automata Autor Vázquez de Parga, Manuel, García, Pedro, López, Damián

    ISSN: 0304-3975, 1879-2294
    Vydavateľské údaje: Elsevier B.V 27.05.2013
    Vydané v 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…”
    Získať plný text
    Journal Article
  7. 7

    Minimal Determinization Algorithm for Fuzzy Automata Autor Grau, Aitor G. de Mendivil, Stanimirovic, Stefan, Farina, Federico

    ISSN: 1063-6706, 1941-0034
    Vydavateľské údaje: New York IEEE 01.11.2023
    Vydané v 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…”
    Získať plný text
    Journal Article
  8. 8

    Further improvements of determinization methods for fuzzy finite automata Autor Jančić, Zorana, Micić, Ivana, Ignjatović, Jelena, Ćirić, Miroslav

    ISSN: 0165-0114, 1872-6801
    Vydavateľské údaje: Elsevier B.V 15.10.2016
    Vydané v 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…”
    Získať plný text
    Journal Article
  9. 9

    Canonization of max-min fuzzy automata Autor González de Mendívil, José R., Fariña Figueredo, Federico

    ISSN: 0165-0114, 1872-6801
    Vydavateľské údaje: Elsevier B.V 01.12.2019
    Vydané v Fuzzy sets and systems (01.12.2019)
    “… The canonization method is derived from the well-known Brzozowski's algorithm for ordinary nondeterministic automata…”
    Získať plný text
    Journal Article
  10. 10
  11. 11

    Partial derivatives of regular expressions and finite automaton constructions Autor Antimirov, Valentin

    ISSN: 0304-3975, 1879-2294
    Vydavateľské údaje: Elsevier B.V 11.03.1996
    Vydané v 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…”
    Získať plný text
    Journal Article
  12. 12

    On the Power of Automata Minimization in Reactive Synthesis Autor Zhu, Shufang, Tabajara, Lucas M, Pu, Geguang, Vardi, Moshe Y

    ISSN: 2331-8422
    Vydavateľské údaje: Ithaca Cornell University Library, arXiv.org 17.09.2021
    Vydané v arXiv.org (17.09.2021)
    “… Here, we present a thorough investigation on two classical minimization algorithms, namely, the Hopcroft and Brzozowski algorithms…”
    Získať plný text
    Paper
  13. 13

    Extension of Brzozowski’s derivation calculus of rational expressions to series over the free partially commutative monoids Autor Berstel, Jean, Reutenauer, Christophe

    ISSN: 0304-3975, 1879-2294
    Vydavateľské údaje: Amsterdam Elsevier B.V 09.06.2008
    Vydané v 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…”
    Získať plný text
    Journal Article
  14. 14

    Position Automata for Kleene Algebra with Tests Autor Silva, Alexandra

    ISSN: 1843-8121, 2248-2695
    Vydavateľské údaje: Iasi Alexandru Ioan Cuza University of Iasi 01.01.2012
    Vydané v 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…”
    Získať plný text
    Journal Article
  15. 15

    Coalgebraic trace semantics via forgetful logics Autor Klin, Bartek, Rot, Jurriaan

    ISSN: 1860-5974, 1860-5974
    Vydavateľské údaje: Logical Methods in Computer Science e.V 27.04.2017
    Vydané v Logical methods in computer science (27.04.2017)
    “… That procedure is closely related to Brzozowski's minimization algorithm…”
    Získať plný text
    Journal Article
  16. 16

    Finite determinization of fuzzy automata using a parametric product-based t-norm Autor Micić, Ivana, Stanimirović, Stefan, González de Mendívil, José Ramón, Ćirić, Miroslav, Jančić, Zorana

    ISSN: 0165-0114, 1872-6801
    Vydavateľské údaje: Elsevier B.V 15.07.2024
    Vydané v 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…”
    Získať plný text
    Journal Article
  17. 17

    Automata Minimization: a Functorial Approach Autor Colcombet, Thomas, Petrişan, Daniela

    ISSN: 2331-8422
    Vydavateľské údaje: Ithaca Cornell University Library, arXiv.org 20.03.2020
    Vydané v 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…”
    Získať plný text
    Paper
  18. 18

    Certified Parsing of Dependent Regular Grammars Autor Sarracino, John, Tan, Gang, Morrisett, Greg

    ISSN: 2770-8411
    Vydavateľské údaje: IEEE 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…”
    Získať plný text
    Konferenčný príspevok..
  19. 19

    POSIX Lexing with Derivatives of Regular Expressions Autor Urban, Christian

    ISSN: 0168-7433, 1573-0670
    Vydavateľské údaje: Dordrecht Springer Netherlands 01.09.2023
    Vydané v 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…”
    Získať plný text
    Journal Article
  20. 20

    Experimental evaluation of explicit and symbolic automata-theoretic algorithms Autor Tabakov, Deian

    ISBN: 0542673088, 9780542673085
    Vydavateľské údaje: 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…”
    Získať plný text
    Dissertation