Thread automaton: Difference between revisions

Revision as of 00:38, 11 June 2016

Revision as of 01:15, 18 October 2016

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 journal | last = Villemonte de la Clergerie | first = Éric | 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 | issn = | url = http://delivery.acm.org/10.1145/1080000/1072256/p28-villemonte_de_la_clergerie.pdf?acc=OPEN |url=http://dl.acm.org/ft_gateway.cfm?id=1072256&ftid=256327&dwn=1&CFID=421201372&CFTOKEN=60649649 |access-date= doi2016-10-15 |doi= 10.3115/1072228.1072256 }} </ref>

==Formal definition==