Weak minimization of DFA -- an algorithm and applications
From MaRDI portal
Publication:703502
DOI10.1016/J.TCS.2004.07.009zbMATH Open1071.68049OpenAlexW2103119124MaRDI QIDQ703502FDOQ703502
Authors: G. Eisman, B. Ravikumar
Publication date: 11 January 2005
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2004.07.009
Recommendations
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- The Complexity of Enumeration and Reliability Problems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Matrix multiplication via arithmetic progressions
- Title not available (Why is that?)
- On the Equivalence and Containment Problems for Unambiguous Regular Expressions, Regular Grammars and Finite Automata
- Minimal NFA Problems are Hard
- Nonnegative Square Matrices
- An Efficient Formula for Linear Recurrences
- A reciprocity theorem for domino tilings
- Domino tilings of rectangles with fixed width
- Combinatorial approaches and conjectures for 2-divisibility problems concerning domino tilings of polyominoes
- On dimer coverings of rectangles of fixed width
- The problem of kings
- Improved upper bounds for self-avoiding walks in \(\mathbb Z^d\)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The combinatorics of cache misses during matrix multiplication
Cited In (3)
This page was built for publication: Weak minimization of DFA -- an algorithm and applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q703502)