759 search results - page 11 / 152 » Overlap-Free Regular Languages |
APLAS
2004
ACM
14 years 1 months ago
2004
ACM
FCT
2001
Springer
14 years 28 days 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 ...
TIME
2002
IEEE
14 years 1 months ago
2002
IEEE
Events employed in natural language semantics are characterized in terms of regular languages, each string in which can be regarded as a motion picture. The relevant finite autom...
JUCS
2002
13 years 8 months ago
2002
: We study additive distances and quasi-distances between words. We show that every additive distance is finite. We then prove that every additive quasi-distance is regularity-pres...
MFCS
2009
Springer
14 years 3 months ago
2009
Springer
Functional graph grammars are finite devices which generate the class of regular automata. We recall the notion of synchronization by grammars, and for any given grammar we consid...