Logic and {$p$}-recognizable sets of integers

• 1 January 1994
• journal article
• Published by The Belgian Mathematical Society in Bulletin of the Belgian Mathematical Society - Simon Stevin
• Vol. 1  (2) , 191-238
• https://doi.org/10.36045/bbms/1103408547

Abstract

Keywords

• INFINITE WORDS
• {$P$}-RECOGNIZABLE SEQUENCES
• FINITE AUTOMATA
• FIRST-ORDER DEFINABILITY
• FORMAL POWER SERIES