Login / Signup
On the Complexity of k-Piecewise Testability and the Depth of Automata.
Tomás Masopust
Michaël Thomazo
Published in:
DLT (2015)
Keyphrases
</>
worst case
computational complexity
information systems
computational cost
cellular automata
linear model
finite automata
databases
real world
genetic algorithm
knowledge base
regular expressions
space complexity
finite state