Login / Signup
More on the Descriptional Complexity of Products of Finite Automata.
Markus Holzer
Christian Rauch
Published in:
DCFS (2021)
Keyphrases
</>
finite automata
regular expressions
grammatical inference
deterministic automata
tree automata
probabilistic automata
databases
structured data
regular languages