Thread automaton: Difference between revisions

Content deleted Content added
OAbot (talk | contribs)
m Open access bot: doi added to citation with #oabot.
Citation bot (talk | contribs)
Alter: title, template type. Add: chapter-url, chapter. Removed or converted URL. Removed parameters. Some additions/deletions were parameter name changes. | Use this bot. Report bugs. | Suggested by Dominic3203 | Category:Models of computation | #UCB_Category 18/125
Line 1:
In [[automata theory]], the '''thread automaton''' (plural: automata) is an extended type of [[finite-state machine|finite-state automata]] that recognizes a [[mildly context-sensitive language class]] above the [[tree-adjoining grammar|tree-adjoining languages]].<ref name="eric"> {{cite journalbook | last = Villemonte de la Clergerie | first = Éric | year = 2002 | titlechapter = Parsing mildly context-sensitive languages with thread automata | journalyear = COLING2002 '02| title = Proceedings of the 19th Internationalinternational Conferenceconference on Computational Linguisticslinguistics - | volume = 1 | issue = 3 |pages= 1–7 |chapter-url= http://dl.acm.org/ft_gateway.cfm?id=1072256&ftid=256327&dwn=1&CFID=421201372&CFTOKEN=60649649 |access-date= 2016-10-15 |doi= 10.3115/1072228.1072256 | doi-access = free }} </ref>
 
==Formal definition==