An Application of the Feferman-Vaught Theorem to Automata and Logics for Words over an Infinite Alphabet.
Alexis BèsPublished in: Log. Methods Comput. Sci. (2008)
Keyphrases
- finite automata
- regular languages
- intuitionistic logic
- cellular automata
- expressive power
- n gram
- finite alphabet
- pattern matching
- modal logic
- classical logic
- finite state
- inference rules
- regular expressions
- related words
- word sense disambiguation
- word recognition
- text documents
- linguistic information
- unknown words
- keywords
- knowledge base
- multiword
- grammatical inference
- wordnet
- english words
- proof theoretic
- data model
- lattice gas