G. Taylor. Models of Computation and Formal Languages. Oxford University Press, 1998. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Vision-Based Recognition of Actions using Context - Moore (2000) (2 citations) (Correct)
....of all possible component states [31] it becomes exceedingly dicult to collapse additional hypotheses into a single nite state model. In contrast, the generative process associated with grammar is non deterministic, allowing the derivation of a much longer and elaborate sequence of events [137]. In other words, grammar allows us to use a single, compact representation for well understood interactiveevents that also accommodates the natural generalizations that occur during their performance. BobickandIvanovcombine syntactic pattern recognition with statistical approaches to recognize ....
R.G. Taylor, Models of Computation and Formal Languages, Oxford University Press, New York 1998, p. 504.
Recognizing Multitasked Activities using Stochastic.. - Moore, Essa (2001) (4 citations) (Correct)
....as variation becomes more pronounced, it becomes exceedingly difficult to collapse additional hypotheses into a single finite state model. In contrast, the generative process associated with grammar is non deterministic, allowing the derivation of a much longer and elaborate sequence of events [16]. Grammar allows us to use a single, compact representation for well understood interactive events that also accommodates the natural generalizations that occur during their performance. However, because grammar is very domain dependent and very difficult to learn without supervision, we consider ....
R. G. Taylor. Models of Computation and Formal Languages. Oxford University Press, 1998.
Mobility and Computation - Ferreira (Correct)
....its relationships with other related concepts. Section 4 discusses other notions such as distribution and centralization. Section 5 introduces an intuitive notion of computation. In section 6, we provide one notion of computation that is somehow broader than the conventional notions, such as those[57] modeled by Turing machines, e ectively computable functions as well as parallel computation. At a higher level, our notion is based on physical, psychological and philosophical factors, besides mathematics. We see computing science as a table whose legs are these four studies. In this way, we ....
R. G. Taylor. Models of Computation and Formal Languages. Oxford University Press, 1998.
Using Joint Actions To Explain Acknowledgments In Tutorial.. - Brandle (1998) (3 citations) (Correct)
....one cannot simply apply CA and the results come flooding out [p. 35] but that it is the result of rigorous and painstaking examination [p. 36] This makes sense in that numerous other domains have problems that cannot be solved by numeric brute force (e.g. Ackermann s function in mathematics [Taylor, 1998, pp. 233, 298 299] but which require careful analysis and thought before achieving results. An important part of the CA tradition is the practice of always presenting the original data when discussing any results. This public availability of data helps ensure the validity of the conclusions. I ....
.... Although Sinclair and Coulthard do not quite go that far, it seems possible that a formal grammar of tutoring might be developed, one which describes the grammar rules by using notation similar to that used to describe formal languages, e.g. BNF or equivalent notations used in computation theory [Taylor, 1998; Lewis and Papadimitriou, 1981] The complexity of discourse makes it unclear how specific such a grammar could get, due to the constraints imposed by context. Even if we can t develop a unified general grammar of everything , more detailed descriptive grammars should be possible within ....
Taylor, R. Gregory. 1998. Models of Computation and Formal Languages. Oxford University Press, New York, New York.
Didactic Strategies for Promoting Significant Learning.. - Chesnevar, Gonzalez, al. (2004) (Correct)
No context found.
G. Taylor. Models of Computation and Formal Languages. Oxford University Press, 1998.
Teaching Fundamentals of Computing Theory: A.. - Chesnevar, Maguitman, al. (2004) (Correct)
No context found.
G. Taylor. Models of Computation and Formal Languages. Oxford Univ. Press, 1998.
Models of Computation and Languages for Embedded System Design - Jantsch, Sander (2005) (Correct)
No context found.
R. G. Taylor. Models of computation and formal language. Oxford University Press, New York, 1998.
Models of Computation in the Design Process - Jantsch, Sander (2005) (Correct)
No context found.
R. G. Taylor. Models of computation and formal language. Oxford University Press, New York, 1998.
A Semantics-Preserving Reduction of Code-Annotated.. - Savoiu, Shukla, Gupta (2004) (Correct)
No context found.
R. G. Taylor, "Models of Computation and Formal Languages", Oxford University Press, 1997.
Algorithm Selection for Sorting and Probabilistic Inference: A.. - Guo (2003) (Correct)
No context found.
R. G. Taylor. Models of Computation and Formal Language. Oxford University Press, 1998. 232
Didactic Strategies for Promoting Significant Learning.. - Chesnevar, Gonzalez, al. (2004) (Correct)
No context found.
G. Taylor. Models of Computation and Formal Languages. Oxford University Press, 1998.
Logic in Computer Science: Modelling and Reasoning about Systems - Huth, Ryan (1999) (30 citations) (Correct)
No context found.
R. G. Taylor. Models Of Computation and Formal Languages. Oxford University Press, 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