An Application of the Feferman-Vaught Theorem to Automata and Logics for Words over an Infinite Alphabet

Published in: CoRR (2008)

Keyphrases

finite automata
intuitionistic logic
regular languages
finite alphabet
expressive power
cellular automata
n gram
keywords
classical logic
inference rules
text documents
regular expressions
von neumann
modal logic
related words
probabilistic automata
linguistic information
proof theoretic