Revision as of 12:10, 26 November 2012 edit Wdchk (talk \| contribs) Extended confirmed users, Pending changes reviewers, Rollbackers 12,589 edits m Wdchk moved page Thread automata to Thread automaton over redirect: singular form, see WP:PLURAL ← Previous edit		Revision as of 02:01, 25 February 2013 edit undo RjwilmsiBot (talk \| contribs) Bots, Pending changes reviewers 1,602,950 edits m fixing page range dashes using AWB Next edit →
Line 1: In [[automata theory]], a '''thread automaton''' (plural: automata) is a [[finite-state machine\|finite-state automaton]] that can make use of a thread.<ref name="eric"> {{cite journal \| last = de la Clergerie \| first = Éric Villemonte \| year = 2002 \| title = Parsing mildly context-sensitive languages with thread automata \| journal = COLING '02 Proceedings of the 19th international conference on Computational linguistics \| volume = 1 \| issue = 3 \| pages = ~~1-7~~1–7 \| issn = \| url = http://delivery.acm.org/10.1145/1080000/1072256/p28-villemonte_de_la_clergerie.pdf?acc=OPEN \| doi = 10.3115/1072228.1072256 }} </ref> Thread automata are capable of recognizing a [[mildly context-sensitive language]]. ==See also==

Thread automaton: Difference between revisions