Jump to content

Thread automaton

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Geneticgirl (talk | contribs) at 10:47, 23 November 2012 (←Created page with 'In automata theory, a '''Thread automata''' is a finite automaton that can make use of a thread.<ref name="eric"> {{cite journal | l...'). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

In automata theory, a Thread automata is a finite automaton that can make use of a thread.[1] Thread automata is capable of recognizing an Mildly context-sensitive language

See also

References

  1. ^ de la Clergerie, Éric Villemonte (2002). "Parsing mildly context-sensitive languages with thread automata" (PDF). COLING '02 Proceedings of the 19th international conference on Computational linguistics. 1 (3): 1–7. doi:10.3115/1072228.1072256.
Stub icon

This computer science article is a stub. You can help Wikipedia by expanding it.

Retrieved from "https://en.wikipedia.org/w/index.php?title=Thread_automaton&oldid=524483406"