Open AccessAn Automata Theoretic Decidability Proof for First-Order Theory of ⟨ℕ,
Author(s) -
Maes, Arnaud
Publication year - 1999
Publication title -
justus-liebig-universität gießen
Language(s) - English
DOI - 10.25596/jalc-1999-229
Subject(s) - decidability , morphism , mathematics , alphabet , discrete mathematics , automaton , finite state machine , regular language , model theory , automata theory , proof theory , algebra over a field , deterministic automaton , finite set , fragment (logic) , unary operation , combinatorics , simple (philosophy) , atomic formula , deterministic finite automaton , reachability problem , tree automaton
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom