Integer Weighted Finite Automata, Matrices, and Formal Power Series over Laurent Polynomials.

Published in: Theory Is Forever (2004)

Keyphrases

finite automata
probabilistic automata
regular expressions
deterministic automata
grammatical inference
finite automaton
tree automata
power consumption
singular value decomposition
regular languages
totally unimodular
relational databases
pattern matching
binary matrix