759 search results - page 99 / 152 » Overlap-Free Regular Languages |
IPL
2006
14 years 9 months ago
2006
In this paper we investigate P systems whose compartments contain sets of symbolobjects rather than multisets of objects, as it is common in membrane computing. If the number of m...
JIIS
2008
14 years 9 months ago
2008
We use the Edit distance with Moves on words and trees and say that two regular (tree) languages are -close if every word (tree) of one language is -close to the other. A transduc...
WWW
2010
ACM
15 years 4 months ago
2010
ACM
Named entity recognition studies the problem of locating and classifying parts of free text into a set of predefined categories. Although extensive research has focused on the de...
BTW
2003
Springer
15 years 3 months ago
2003
Springer
: XML is the upcoming standard for internet data. Java is the most important programming language for internet applications. Nevertheless, in today’s languages and tools there is...
PLDI
2011
ACM
14 years 19 days ago
2011
ACM
For more than thirty years, the parallel programming community has used the dependence graph as the main abstraction for reasoning about and exploiting parallelism in “regular...