Skip to search formSkip to main contentSkip to account menuSemantic Scholar Semantic Scholar's Logo Search 207,917,455 papers from all fields of science

Search

Semantic Scholar uses AI to extract papers important to this topic.

Highly Cited

2004

Highly Cited

2004

The computational power of networks of small resource-limited mobile agents is explored. Two new models of computation based on…

Highly Cited

2004

Highly Cited

2004

Motivated by formal models recently proposed in the context of XML, we study automata and logics on strings over infinite…

Review

1998

Review

1998

Multilayer neural networks trained with the back-propagation algorithm constitute the best example of a successful gradient based…

Highly Cited

1994

Highly Cited

1994

We study the complexity of two fundamental problems in the testing of finite-state machines. 1) Distinguishing sequences (state…

Highly Cited

1994

Highly Cited

1990

Highly Cited

1990

Time underlies many interesting human behaviors. Thus, the question of how to represent time in connectionist models is very…

Highly Cited

1986

Highly Cited

1986

We give an efficient procedure for verifying that a finite-state concurrent system meets a specification expressed in a…

Highly Cited

1983

Highly Cited

1983

A model of commumcations protocols based on finite-state machines is investigated. The problem addressed is how to ensure certain…

Highly Cited

1978

Highly Cited

1978

We propose a method of testing the correctness of control structures that can be modeled by a finite-state machine. Test results…

Highly Cited

1972

Highly Cited

1972

The Nerode realization technique for synthesizing finite-state machines from their associated right-invariant equivalence…