Sign in

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

Mikael GoldmannAlexander RussellDenis 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