759 search results - page 22 / 152 » Odometers on Regular Languages |
LACL
2005
Springer
14 years 3 months ago
2005
Springer
APLAS
2004
ACM
14 years 3 months ago
2004
ACM
CORR
2010
Springer
13 years 10 months ago
2010
Springer
We propose an algorithm that tests membership for regular expressions and show that the algorithm is correct. This algorithm is written in the style of a sequent proof system. The...
FCT
2001
Springer
14 years 2 months ago
2001
Springer
This paper presents the prediction-preserving reducibility with membership queries (pwm-reducibility) on formal languages, in particular, simple CFGs and finite unions of regular ...
JALC
2008
13 years 9 months ago
2008
A combinatorial channel is a set of pairs of words describing all the possible input-output channel situations. We introduce the concept "maximal error-detecting capability&q...