205 search results - page 26 / 41 » Testing the Equivalence of Regular Languages |
72
Voted
ICDE
2009
IEEE
14 years 7 months ago
2009
IEEE
The identification and processing of similarities in the data play a key role in multiple application scenarios. Several types of similarity-aware operations have been studied in ...
69
Voted
FSTTCS
2010
Springer
14 years 7 months ago
2010
Springer
The parity acceptance condition for -regular languages is a special case of the Rabin and Streett acceptance conditions. While the parity acceptance condition is as expressive as ...
ACSD
2005
IEEE
15 years 3 months ago
2005
IEEE
We introduce and study problems of distributed observation with bounded or unbounded memory. We are given a system modeled as a finite-word language L over some finite alphabet ...
TNN
2008
14 years 9 months ago
2008
Abstract-- A major drawback of artificial neural networks (ANNs) is their black-box character. This is especially true for recurrent neural networks (RNNs) because of their intrica...
TCS
1998
14 years 9 months ago
1998
We consider a model of analog computation which can recognize various languages in real time. We encode an input word as a point in Rd by composing iterated maps, and then apply i...