On the Parallelizability of Languages Accepted by P Automata.
György VaszilPublished in: Computation, Cooperation, and Life (2011)
Keyphrases
- cellular automata
- finite state automata
- regular languages
- formal language theory
- rational kernels
- language independent
- finite state machines
- linear separability
- expressive power
- regular expressions
- databases
- probabilistic automata
- context free
- cross lingual
- text summarization
- finite state
- formal languages
- grammatical inference
- language identification
- query translation
- syntactic and semantic dependencies
- database
- target language
- context free grammars
- finite automata
- tree automata
- regular path queries
- pattern matching
- information extraction