174
click to vote
BIRTHDAY
1999
Springer
16 years 2 days ago
1999
Springer
We define simple-regular expressions and languages. Simple-regular languages provide a necessary condition for a language to be outfix-free. We design algorithms that compute si...