Y.A. Ivanov, \Application of stochastic grammars to understanding action," Masters Thesis, Massachusetts Institute of Technology,February 1998. Home/Search Document Details and Download
Summary Related Articles |
This paper is cited in the following contexts:
Vision-Based Recognition of Actions using Context - Moore (2000) (2 citations) (Correct)
....nitestate machines or nite state automata. In practice, strings of a regular language # r can be generated by nite state machines which do not need extra stack memory. However, the absence of stack memory in the parsing and generating mechanism of regular grammars is one of its limiting factors [74]. Recursion is necessary for a nite set of rules to generate in nite languages and strings of arbitrary length, i.e. the language given by ## ## # 0#. Recursive relationships cannot be captured by regular grammar because extra memory is required to represent the states of the parsing ....
Y.A. Ivanov, \Application of stochastic grammars to understanding action," Masters Thesis, Massachusetts Institute of Technology,February 1998.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC