759 search results - page 39 / 152 » Overlap-Free Regular Languages |
COCOON
2009
Springer
14 years 1 months ago
2009
Springer
We present new and more efficient algorithms for regular language enumeration problems. The min-word problem is to find the lexicographically minimal word of length n accepted by ...
CORR
2010
Springer
13 years 10 months ago
2010
Springer
We show that the Parikh image of the language of an NFA with n states over an alphabet of size k can be described as a finite union of linear sets with at most k generators and to...
LATA
2009
Springer
14 years 4 months ago
2009
Springer
This paper proposes an alternative approach to the standard notion of rational (or regular) expression for tree languages. The main difference is that in the new notion we have on...
ICMLC
2010
Springer
13 years 7 months ago
2010
Springer
: Portuguese is specifically a difficult language with luxuriant tenses, and second language acquisition (SLA) is regarded as highly variable. Many (Chinese) students who learn Por...
ADC
2009
Springer
14 years 4 months ago
2009
Springer
The paper presents the S.E.A.L. query language and interpreter for entity-association queries that allows such queries to be expressed in a much simpler way than in SQL. S.E.A.L (...