On Computational Power of Weighted Finite Automata.
Denis DerencourtJuhani KarhumäkiMichel LatteuxAlain TerluttePublished in: MFCS (1992)
Keyphrases
- computational power
- finite automata
- parallel processing
- computing power
- grammatical inference
- regular expressions
- deterministic automata
- probabilistic automata
- tree automata
- finite automaton
- hidden markov models
- hardware architectures
- memory requirements
- domain knowledge
- artificial intelligence
- multithreading
- database
- high level
- databases
- regular languages