Two kinds of processors are sufficient and large operating alphabets are needed for regular trellis automata languages.
Ivan KorecPublished in: Bull. EATCS (1984)
Keyphrases
- context free
- regular languages
- grammatical inference
- regular expressions
- low complexity
- expressive power
- finite automata
- parallel algorithm
- context dependent
- single processor
- probabilistic automata
- finite state automata
- parallel processing
- finite state
- language independent
- text summarization
- formal languages
- formal language theory
- context free grammars
- ultimate goal
- distributed memory
- parallel computation
- shared memory
- tree automata
- context sensitive
- coding scheme
- markov chain
- information retrieval
- databases