Diophantine Equations, Presburger Arithmetic and Finite Automata.
Alexandre BoudetHubert ComonPublished in: CAAP (1996)
Keyphrases
- finite automata
- presburger arithmetic
- quantifier elimination
- algebraic structure
- regular expressions
- deterministic automata
- grammatical inference
- decision procedures
- hidden markov models
- constraint propagation
- tree automata
- first order logic
- cardinality constraints
- finite automaton
- domain knowledge
- knowledge representation