Semantic Scholar uses AI to extract papers important to this topic.
The computational power of networks of small resource-limited mobile agents is explored. Two new models of computation based on… Expand Motivated by formal models recently proposed in the context of XML, we study automata and logics on strings over infinite… Expand We propose a state-based approach to gesture learning and recognition. Using spatial clustering and temporal alignment, each… Expand Multilayer neural networks trained with the back-propagation algorithm constitute the best example of a successful gradient based… Expand We study the complexity of two fundamental problems in the testing of finite-state machines. 1) Distinguishing sequences (state… Expand Time underlies many interesting human behaviors. Thus, the question of how to represent time in connectionist models is very… Expand We give an efficient procedure for verifying that a finite-state concurrent system meets a specification expressed in a… Expand A model of commumcations protocols based on finite-state machines is investigated. The problem addressed is how to ensure certain… Expand We propose a method of testing the correctness of control structures that can be modeled by a finite-state machine. Test results… Expand The Nerode realization technique for synthesizing finite-state machines from their associated right-invariant equivalence… Expand