Proving non-termination by finite automata.

Jörg Endrullis Hans Zantema

Published in: RTA (2015)

Keyphrases

finite automata
term rewrite systems
grammatical inference
probabilistic automata
deterministic automata
regular expressions
tree automata
regular languages
high level
relational databases
hidden markov models
query language
knowledge acquisition