Jump to content

Thread automaton

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by RjwilmsiBot (talk | contribs) at 02:01, 25 February 2013 (fixing page range dashes using AWB). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

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

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=540175277"