Hyper-minimizing minimized deterministic finite state automata
RAIRO-Theor. Inf. Appl., 43 1 (2009) 69-94
Published online: 2007-12-20
Articles citing this article
The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).
Cited article:
This article has been cited by the following article(s):
Building Efficient and Compact Data Structures for Simplicial Complexes
Jean-Daniel Boissonnat, Karthik C. S. and Sébastien TavenasAlgorithmica 79 (2) 530 (2017)
https://doi.org/10.1007/s00453-016-0207-y
The Almost Equivalence by Asymptotic Probabilities for Regular Languages and Its Computational Complexities
Yoshiki NakamuraElectronic Proceedings in Theoretical Computer Science 226 272 (2016)
https://doi.org/10.4204/EPTCS.226.19
Boundary sets of regular and context-free languages
Markus Holzer and Sebastian JakobiTheoretical Computer Science 610 59 (2016)
https://doi.org/10.1016/j.tcs.2015.07.032
Hyper-optimization for deterministic tree automata
Andreas MalettiTheoretical Computer Science 578 72 (2015)
https://doi.org/10.1016/j.tcs.2015.01.020
Descriptional Complexity of Formal Systems
Markus Holzer and Sebastian JakobiLecture Notes in Computer Science, Descriptional Complexity of Formal Systems 8614 162 (2014)
https://doi.org/10.1007/978-3-319-09704-6_15
Hyper-Minimization for Deterministic Weighted Tree Automata
Andreas Maletti and Daniel QuernheimElectronic Proceedings in Theoretical Computer Science 151 314 (2014)
https://doi.org/10.4204/EPTCS.151.22
More Structural Characterizations of Some Subregular Language Families by Biautomata
Markus Holzer and Sebastian JakobiElectronic Proceedings in Theoretical Computer Science 151 271 (2014)
https://doi.org/10.4204/EPTCS.151.19
HYPER-MINIMIZATION FOR DETERMINISTIC TREE AUTOMATA
ARTUR JEŻ and ANDREAS MALETTIInternational Journal of Foundations of Computer Science 24 (06) 815 (2013)
https://doi.org/10.1142/S0129054113400200
Implementation and Application of Automata
Andreas MalettiLecture Notes in Computer Science, Implementation and Application of Automata 7982 244 (2013)
https://doi.org/10.1007/978-3-642-39274-0_22
Implementation and Application of Automata
Markus Holzer and Sebastian JakobiLecture Notes in Computer Science, Implementation and Application of Automata 7982 181 (2013)
https://doi.org/10.1007/978-3-642-39274-0_17
Implementation and Application of Automata
Artur Jeż and Andreas MalettiLecture Notes in Computer Science, Implementation and Application of Automata 7381 217 (2012)
https://doi.org/10.1007/978-3-642-31606-7_19
UNWEIGHTED AND WEIGHTED HYPER-MINIMIZATION
ANDREAS MALETTI and DANIEL QUERNHEIMInternational Journal of Foundations of Computer Science 23 (06) 1207 (2012)
https://doi.org/10.1142/S0129054112400485
The tractability frontier for NFA minimization
Henrik Björklund and Wim MartensJournal of Computer and System Sciences 78 (1) 198 (2012)
https://doi.org/10.1016/j.jcss.2011.03.001
Developments in Language Theory
Markus Holzer and Sebastian JakobiLecture Notes in Computer Science, Developments in Language Theory 7410 190 (2012)
https://doi.org/10.1007/978-3-642-31653-1_18
OPTIMAL HYPER-MINIMIZATION
ANDREAS MALETTI and DANIEL QUERNHEIMInternational Journal of Foundations of Computer Science 22 (08) 1877 (2011)
https://doi.org/10.1142/S0129054111009094
Implementation and Application of Automata
Andreas MalettiLecture Notes in Computer Science, Implementation and Application of Automata 6482 201 (2011)
https://doi.org/10.1007/978-3-642-18098-9_22
Mathematical Foundations of Computer Science 2011
Paweł Gawrychowski, Artur Jeż and Andreas MalettiLecture Notes in Computer Science, Mathematical Foundations of Computer Science 2011 6907 327 (2011)
https://doi.org/10.1007/978-3-642-22993-0_31
Implementation and Application of Automata
Artur Jeż and Andreas MalettiLecture Notes in Computer Science, Implementation and Application of Automata 6807 203 (2011)
https://doi.org/10.1007/978-3-642-22256-6_19
An nlogn algorithm for hyper-minimizing a (minimized) deterministic automaton
Markus Holzer and Andreas MalettiTheoretical Computer Science 411 (38-39) 3404 (2010)
https://doi.org/10.1016/j.tcs.2010.05.029
Implementation and Application of Automata
Markus Holzer and Andreas MalettiLecture Notes in Computer Science, Implementation and Application of Automata 5642 4 (2009)
https://doi.org/10.1007/978-3-642-02979-0_4
Mathematical Foundations of Computer Science 2009
Paweł Gawrychowski and Artur JeżLecture Notes in Computer Science, Mathematical Foundations of Computer Science 2009 5734 356 (2009)
https://doi.org/10.1007/978-3-642-03816-7_31
HYPER-MINIMIZATION IN O(n2)
ANDREW BADRInternational Journal of Foundations of Computer Science 20 (04) 735 (2009)
https://doi.org/10.1142/S012905410900684X