Weak minimization of DFA -- an algorithm and applications
type: Item
instance of: scholarly article
title: Weak minimization of DFA -- an algorithm and applications
zbMATH Open document ID: 1071.68049
author: G. Eisman
author: B. Ravikumar
published in: Theoretical Computer Science
publication date: 2005-01-11T00:00:00Z
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 68W05
zbMATH DE Number: 2126087
zbMATH Keywords: DFA minimization
zbMATH Keywords: Matrix power formula
zbMATH Keywords: Tiling automaton
MaRDI profile type: Publication
full work available at URL: j.tcs.2004.07.009
OpenAlex ID: W2103119124
cites work: Matrix multiplication via arithmetic progressions
cites work: Nonnegative Square Matrices
cites work: An Efficient Formula for Linear Recurrences
cites work: The combinatorics of cache misses during matrix multiplication
cites work: Q4708580
cites work: Q3862379
cites work: Minimal NFA Problems are Hard
cites work: Domino tilings of rectangles with fixed width
cites work: Q5581642
cites work: Q4693177
cites work: Q4779175
cites work: Combinatorial approaches and conjectures for 2-divisibility problems concerning domino tilings of polyominoes
cites work: Q5643915
cites work: Improved upper bounds for self-avoiding walks in \(\mathbb Z^d\)
cites work: A reciprocity theorem for domino tilings
cites work: Q4155837
cites work: On dimer coverings of rectangles of fixed width
cites work: On the Equivalence and Containment Problems for Unambiguous Regular Expressions, Regular Grammars and Finite Automata
cites work: The Complexity of Enumeration and Reliability Problems
cites work: The problem of kings
DOI: 10.1016/J.TCS.2004.07.009
description: scientific article; zbMATH DE number 2126087