11716 search results - page 91 / 2344 » Computable symbolic dynamics |
142
click to vote
GCB
2000
Springer
15 years 9 months ago
2000
Springer
In previous work [10], we considered algorithms related to the statistics of matches with words and regular expressions in texts generated by Bernoulli or Markov sources. In this w...
168
click to vote
NIPS
2003
15 years 7 months ago
2003
We show that temporal logic and combinations of temporal logics and modal logics of knowledge can be effectively represented in artificial neural networks. We present a Translat...
130
click to vote
IJCAI
1993
15 years 7 months ago
1993
This paper presents a major revision of the Either propositional theory re nement system. Two issues are discussed. First, we show howrun timee ciency can be greatlyimproved by ch...
144
click to vote
FMSD
1998
15 years 5 months ago
1998
Proving the equivalenceof two Finite State Machines (FSMs) has many applications to synthesis, veri cation, testing, and diagnosis. Building their product machine is a theoretical ...
167
click to vote
SOFSEM
2007
Springer
16 years 9 days ago
2007
Springer
We investigate deterministically simulating (i.e., solving the membership problem for) nondeterministic finite automata (NFA), relying solely on the NFA’s resources (states and ...