Login / Signup
Proving Looping and Non-Looping Non-Termination by Finite Automata.
Jörg Endrullis
Hans Zantema
Published in:
CoRR (2015)
Keyphrases
</>
finite automata
probabilistic automata
grammatical inference
deterministic automata
regular expressions
arbitrarily complex
term rewrite systems
database systems
hidden markov models
databases
artificial intelligence
pattern matching
semi automatic
tree automata
finite automaton