In automata theory, a thread automaton (plural: automata) is a finite-state automaton that can make use of a thread.[1] Thread automata are capable of recognizing a mildly context-sensitive language.
See also [edit]
References [edit]
- ^ de la Clergerie, Éric Villemonte (2002). "Parsing mildly context-sensitive languages with thread automata". COLING '02 Proceedings of the 19th international conference on Computational linguistics 1 (3): 1–7. doi:10.3115/1072228.1072256.
|
|
|
|
|
|
Each category of languages is a proper subset of the category directly above it. Any automaton and any grammar in each category has an equivalent automaton or grammar in the category directly above it.
|
|
