|
Journal of Automata, Languages and Combinatorics
formerly:
Journal of Information Processing and Cybernetics /
Elektronische Informationsverarbeitung und Kybernetik
|
|
@article{jalc040306,
author = {Maes, Arnaud},
title = {An Automata Theoretic Decidability Proof for First-Order
Theory of $\langle \nat,<,P\rangle$ with Morphic
Predicate $P$},
journal = jalc,
year = 1999,
volume = 4,
number = 3,
pages = {229--245},
keywords = {morphism, automaton, word, picture, decidability},
abstract = {We show connections between morphisms on words and
pictures on a finite alphabet and finite deterministic
incomplete automata. We use these connections to re-prove,
in terms of automata, a decidability result about the
first-order theory of the structures
$\langle \nat,<,P\rangle$ for multi-ary morphic
predicates $P$.}
}