Výsledky vyhľadávania - "Brzozowski’s minimization algorithm"

Nondeterministic Moore automata and Brzozowski’s minimization algorithm

Autori: CASTIGLIONE, Giuseppa RESTIVO, Antonio SCIORTINO, Marinella

Zdroj: Theoretical Computer Science. 450:81-91

Predmety: Nondeterministic Moore automata, Brzozowski's minimization algorithm, Automata minimization, 0202 electrical engineering, electronic engineering, information engineering, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Theoretical Computer Science, Computer Science(all)

Popis súboru: application/pdf

Prístupová URL adresa: https://core.ac.uk/display/53276872
https://iris.unipa.it/handle/10447/64506
https://www.sciencedirect.com/science/article/pii/S0304397512003842
https://dblp.uni-trier.de/db/journals/tcs/tcs450.html#CastiglioneRS12
https://pure.unipa.it/it/publications/nondeterministic-moore-automata-and-brzozowskis-minimization-algo-3
https://www.infona.pl/resource/bwmeta1.element.elsevier-af6f6a1a-2033-3b50-a0a6-c07b9eca109e?locale=en
https://hdl.handle.net/10447/64506
https://doi.org/10.1016/j.tcs.2012.04.029

Algebra-coalgebra duality in brzozowski's minimization algorithm

Autori: Bonchi, F. Bonsangue, M.M. Hansen, H.H. a ďalší

Prispievatelia: Bonchi, F. Bonsangue, M.M. Hansen, H.H. a ďalší

Zdroj: ACM Transactions on Computational Logic, 15, 1, pp. 3(1)-3(29)

Predmety: Algebra, [INFO.INFO-LO] Computer Science [cs]/Logic in Computer Science [cs.LO], automata, Automata, Coalgebra, Duality, Theoretical Computer Science, Computer Science (all), Logic, Computational Mathematics, Data Science, duality, Theory, 0102 computer and information sciences, 0101 mathematics, coalgebra, 16. Peace & justice, 01 natural sciences, Algorithms

Popis súboru: application/pdf

Prístupová URL adresa: http://repositorium.sdum.uminho.pt/bitstream/1822/34733/1/1996.pdf
https://repositorium.sdum.uminho.pt/bitstream/1822/34733/1/1996.pdf
https://dl.acm.org/doi/10.1145/2490818
https://hal.archives-ouvertes.fr/hal-00909426
https://hal.inria.fr/hal-00909426/
https://haslab.uminho.pt/xana/publications/algebra-coalgebra-duality-brzozowskis-minimization-algorithm
http://repository.ubn.ru.nl/handle/2066/127972
http://repository.ubn.ru.nl/handle/2066/127972
https://repository.ubn.ru.nl//bitstream/handle/2066/127972/127972.pdf
https://hal.science/hal-00909426v1
https://doi.org/10.1145/2490818
https://hdl.handle.net/11568/899014
https://doi.org/10.1145/2490818
https://hdl.handle.net/1822/34733

Brzozowski’s Minimization Algorithm—More Robust than Expected

Autori: Markus Holzer Sebastian Jakobi

Zdroj: Lecture Notes in Computer Science ISBN: 9783642392733

Prístupová URL adresa: https://dl.acm.org/citation.cfm?id=2526104
https://link.springer.com/content/pdf/10.1007/978-3-642-39274-0_17.pdf
https://link.springer.com/chapter/10.1007/978-3-642-39274-0_17
https://rd.springer.com/chapter/10.1007%2F978-3-642-39274-0_17

Algebra-coalgebra duality in Brzozowski's minimization algorithm

Autori: Bonchi, F. (Filippo) Bonsangue, M.M. (Marcello) Hansen, H.H. (Helle) a ďalší

Zdroj: ACM Transactions on Computational Logic vol. 15 no. 1

Témy: info:eu-repo/semantics/article

URL: http://ir.cwi.nl/pub/23090

Automata Minimization: a Functorial Approach

Autori: Colcombet, Thomas Petrişan, Daniela Thomas Colcombet and Daniela Petrisan

Prispievatelia: Colcombet, Thomas Petrişan, Daniela Thomas Colcombet and Daniela Petrisan

Zdroj: Logical Methods in Computer Science, Vol Volume 16, Issue 1 (2020)
Log. Methods Comput. Sci.

Predmety: FOS: Computer and information sciences, Computer Science - Logic in Computer Science, BC1-199, Logic, Formal Languages and Automata Theory (cs.FL), Computer Science - Formal Languages and Automata Theory, QA75.5-76.95, 0102 computer and information sciences, subsequential transducers, functor automata, 01 natural sciences, Logic in Computer Science (cs.LO), computer science - logic in computer science, computer science - formal languages and automata theory, Electronic computers. Computer science, minimization, Choffrut's minimization algorithm, ddc:004, 0101 mathematics, Brzozowski's minimization algorithm, [INFO.INFO-FL] Computer Science [cs]/Formal Languages and Automata Theory [cs.FL]

Popis súboru: application/pdf

Prístupová URL adresa: http://arxiv.org/abs/1712.07121
http://arxiv.org/abs/1711.03063
https://doaj.org/article/6932a9edc8f14ef7bcf8491c3a75b788
https://arxiv.org/abs/1711.03063
https://ui.adsabs.harvard.edu/abs/2017arXiv171207121C/abstract
https://arxiv.org/pdf/1711.03063.pdf
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CALCO.2017.8

Automata Minimization: a Functorial Approach

Autori: Colcombet, Thomas Petrisan, Daniela Thomas Colcombet and Daniela Petrisan

Prispievatelia: Colcombet, Thomas Petrisan, Daniela Thomas Colcombet and Daniela Petrisan

Predmety: functor automata, minimization, Choffrut's minimization algorithm, subsequential transducers, Brzozowski's minimization algorithm

Popis súboru: application/pdf

Relation: Is Part Of LIPIcs, Volume 72, 7th Conference on Algebra and Coalgebra in Computer Science (CALCO 2017); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CALCO.2017.8

Dostupnosť: https://doi.org/10.4230/LIPIcs.CALCO.2017.8
https://nbn-resolving.org/urn:nbn:de:0030-drops-80484
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CALCO.2017.8

A Algebra-Coalgebra Duality in Brzozowski’s Minimization Algorithm

Autori: F. Bonchi Ens Lyon Université De Lyon Lip (umr a ďalší

Prispievatelia: F. Bonchi Ens Lyon Université De Lyon Lip (umr a ďalší

Zdroj: http://www.cs.mcgill.ca/~prakash/Pubs/BrzMin.pdf.

Predmety: Categories and Subject Descriptors, F.1.1 [Theory of Computation, Models of Computation, F.4.3 [Mathematical Logic and Formal Languages, Formal Languages, I.1.2 [Symbolic and Algebraic Manipulation, Algorithms General Terms, Algorithms, Theory Additional Key Words and Phrases, algebra, automata, coalgebra, duality

Popis súboru: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.381.541; http://www.cs.mcgill.ca/~prakash/Pubs/BrzMin.pdf

Dostupnosť: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.381.541
http://www.cs.mcgill.ca/~prakash/Pubs/BrzMin.pdf

A Algebra-Coalgebra Duality in Brzozowski’s Minimization Algorithm

Autori: F. Bonchi Ens Lyon Université De Lyon Lip (umr a ďalší

Prispievatelia: F. Bonchi Ens Lyon Université De Lyon Lip (umr a ďalší

Zdroj: http://tocl.acm.org/accepted/bonchi_algebra.pdf.

Predmety: Categories and Subject Descriptors, F.1.1 [Theory of Computation, Models of Computation, F.4.3 [Mathematical Logic and Formal Languages, Formal Languages, I.1.2 [Symbolic and Algebraic Manipulation, Algorithms General Terms, Algorithms, Theory Additional Key Words and Phrases, algebra, automata, coalgebra, duality

Popis súboru: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.306.9249; http://tocl.acm.org/accepted/bonchi_algebra.pdf

Dostupnosť: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.306.9249
http://tocl.acm.org/accepted/bonchi_algebra.pdf

Brzozowski's Minimization Algorithm–More Robust than Expected.

Autori: Holzer, Markus Jakobi, Sebastian

Zdroj: Implementation & Application of Automata (9783642392733); 2013, p181-192, 12p

Standard Sturmian words and automata minimization algorithms

Autori: CASTIGLIONE, Giuseppa SCIORTINO, Marinella Castiglione, G. a ďalší

Prispievatelia: CASTIGLIONE, Giuseppa SCIORTINO, Marinella Castiglione, G. a ďalší

Predmety: Automata minimization, Brzozowski's minimization algorithm, Standard Sturmian word, Theoretical Computer Science, Computer Science (all)

Relation: info:eu-repo/semantics/altIdentifier/wos/WOS:000362131900008; volume:601; firstpage:58; lastpage:66; numberofpages:9; journal:THEORETICAL COMPUTER SCIENCE; http://hdl.handle.net/10447/203380

Dostupnosť: http://hdl.handle.net/10447/203380
https://doi.org/10.1016/j.tcs.2015.07.023

AUTOMΑΤΑ ΜΙΝIMIZATION: A FUNCTORIAL APPROACH

Autori: COLCOMBET, THOMAS PETRIŞAN, DANIELA

Zdroj: Logical Methods in Computer Science (LMCS); 2020, Vol. 16 Issue 1, p1-28, 28p

MCDAG: indexing maximal common subsequences for k strings.

Autori: Buzzega, Giovanni Conte, Alessio Grossi, Roberto a ďalší

Zdroj: Algorithms for Molecular Biology; 4/19/2025, Vol. 20 Issue 1, p1-21, 21p

Predmety: DATA structures, COMPUTER science, BASE pairs, ENGINEERS, GENERALIZATION

Average Case Analysis of Brzozowski's Algorithm.

Autori: Felice, Sven De Nicaud, Cyril

Zdroj: International Journal of Foundations of Computer Science; Feb2016, Vol. 27 Issue 2, p109-126, 18p

Predmety: ALGORITHMS, COMPUTATIONAL complexity, MACHINE theory, UNIFORM distribution (Probability theory), POLYNOMIALS

Optimal approximate minimization of one-letter weighted finite automata.

Autori: Lacroce, Clara Balle, Borja Panangaden, Prakash a ďalší

Zdroj: Mathematical Structures in Computer Science; Sep2025, Vol. 34 Issue 7, p807-833, 27p

Predmety: HANKEL operators, FINITE state machines, POLYNOMIAL time algorithms, BOUND states, MATRICES (Mathematics)

Coalgebraic trace semantics via forgetful logics

Autori: Klin, Bartek Rot, Jurriaan

Témy: Computer Science - Logic in Computer Science, F.3.2, F.4.1, text

URL: http://arxiv.org/abs/1611.05183

MINIMALITY NOTIONS VIA FACTORIZATION SYSTEMS AND EXAMPLES.

Autori: WISSMANN, THORSTEN

Zdroj: Logical Methods in Computer Science (LMCS); 2022, Vol. 18 Issue 3, p1-26, 26p

Predmety: FACTORIZATION

Varieties and Covarieties of Languages (Extended Abstract).

Autori: Rutten, Jan Ballester-Bolinches, Adolfo Cosme-Llópez, Enric

Zdroj: ENTCS: Electronic Notes in Theoretical Computer Science. Nov2013, Vol. 298, p7-28. 22p.

Predmety: Programming languages, Isomorphism (Mathematics), Set theory, Algorithms, Mathematical proofs, Monoids

2021 EUROPEAN SUMMER MEETING OF THE ASSOCIATION FOR SYMBOLIC LOGIC LOGIC COLLOQUIUM '21 Adam Mickiewicz University Poznań, Poland July 19–24, 2021.

Zdroj: Bulletin of Symbolic Logic; Jun2022, Vol. 28 Issue 2, p268-318, 51p

Predmety: MATHEMATICAL logic, MODEL theory, COGNITIVE science, REVERSE mathematics, MATHEMATICAL formulas

Update Law of Simplifying Finite State Machines (FSMs): An Answer to the Open Question of the Unmanned Optimization of FSMs.

Autori: Yue, Jumei Yan, Yongyi

Zdroj: IEEE Transactions on Circuits & Systems. Part II: Express Briefs; Mar2022, Vol. 69 Issue 3, p1164-1167, 4p

A Congruence-Based Perspective on Finite Tree Automata.

Autori: Ganty, Pierre Gutiérrez, Elena Valero, Pedro

Zdroj: Fundamenta Informaticae; 2021, Vol. 184 Issue 1, p1-47, 47p

Predmety: FINITE state machines, GEOMETRIC congruences, CONGRUENCE lattices, ROBOTS