An ergodic theorem for read-once non-uniform deterministic finite automata.

Mikael Goldmann Alexander Russell Denis Thérien

Published in: Inf. Process. Lett. (2000)

Keyphrases

deterministic finite automata
regular expressions
markov chain
pattern matching
stationary distribution
max sat
upper bound
semi automatic