VOLUME 4 | 1999 | NUMBER 3 |
An Automata Theoretic Decidability Proof for First-Order Theory of 〈ℕ,<,P〉 with Morphic Predicate P
Pages 229–245
Download Abstract
Fulltext is accessible with your personal account
ShowHide BibTeX
BibTeX:
@article{JALC-1999-229, author = {Arnaud Maes}, title = {An Automata Theoretic Decidability Proof for First-Order Theory of $\langle \mathbb{N},<,P\rangle$ with Morphic Predicate $P$}, journal = {Journal of Automata, Languages and Combinatorics}, volume = {4}, number = {3}, pages = {229--245}, year = {1999}, url = {https://doi.org/10.25596/jalc-1999-229}, doi = {10.25596/jalc-1999-229} }