Searching for "Automata on Words." – sorted by Relevance.
-
Logic, Semigroups and Automata on Words.
- Logic, semigroups and automata on words. Jean-Eric Pin () Abstract This is a survey paper
- Cited by 21 (2 self) – Add To MetaCart
-
Query Automata for Nested Words
- Query Automata for Nested Words P. Madhusudan Mahesh Viswanathan University of Illinois at Urbana
- Add To MetaCart
-
Relating Hierarchies of Word and Tree Automata
- Relating hierarchies of word and tree automata Damian Niwi'nski ? and Igor Walukiewicz
- Cited by 11 (3 self) – Add To MetaCart
-
Relating word and tree automata
- Relating Word and Tree Automata ⋆ Orna Kupferman 1 School of Computer Science and Engineering
- Cited by 9 (5 self) – Add To MetaCart
-
unknown title
- Automata, semigroups and recognizability of words on ordinals Nicolas BEDON Institut Gaspard
- Add To MetaCart
-
Syntax-based Alignment of Multiple Translations: Extracting Paraphrases and Generating New Sentences
- @(email omitted); Abstract We describe a syntax-based algorithm that automatically builds Finite State Automata (word
- Cited by 60 (4 self) – Add To MetaCart
-
Discriminative language modeling with conditional random fields and the perceptron algorithm
- the automata with word-lattices that are the output from a baseline recognizer. The perceptron algorithm has
- Cited by 28 (5 self) – Add To MetaCart
-
Automata-Theoretic Techniques for Temporal Reasoning
- . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 2.2 Nondeterministic Automata on Infinite Words
- Cited by 1 (0 self) – Add To MetaCart
-
Languages, Automata, and Logic
- automata on !-words and their determinization, and a self-contained proof of the "Rabin Tree Theorem
- Cited by 131 (3 self) – Add To MetaCart
-
Canonical Nondeterministic Finite Automata and Equivalent Subautomata
- Abstract We summarize some results about "normal forms" of nondeterministic finite automata on words (NFA
- Add To MetaCart

