Login / Signup

On the Descriptional Complexity of the Direct Product of Finite Automata.

Markus HolzerChristian Rauch
Published in: DCFS (2022)
Keyphrases
  • finite automata
  • probabilistic automata
  • deterministic automata
  • grammatical inference
  • regular expressions
  • multistage
  • decision problems
  • query processing
  • hidden markov models
  • domain specific
  • tree automata