Login / Signup

Returning and non-returning parallel communicating finite automata are equivalent.

Ashish ChoudharyKamala KrithivasanVictor Mitrana
Published in: RAIRO Theor. Informatics Appl. (2007)
Keyphrases
  • finite automata
  • regular expressions
  • deterministic automata
  • probabilistic automata
  • grammatical inference
  • tree automata
  • hidden markov models
  • pattern matching
  • databases
  • database systems
  • data analysis