759 search results - page 126 / 152 » Overlap-Free Regular Languages |
AAIM
2008
Springer
13 years 9 months ago
2008
Springer
We consider a generalization of the shortest-path problem: given an alphabet , a graph G whose edges are weighted and -labeled, and a regular language L , the L-constrained shortes...
FM
2008
Springer
13 years 9 months ago
2008
Springer
Declarative specifications exhibit a variety of problems, such as inadvertently overconstrained axioms and underconstrained conjectures, that are hard to diagnose with model checki...
EACL
2006
ACL Anthology
13 years 8 months ago
2006
ACL Anthology
Morphologically complex terms composed from Greek or Latin elements are frequent in scientific and technical texts. Word forming units are thus relevant cues for the identificatio...
DLT
2003
13 years 8 months ago
2003
We continue our investigation on the relationship between regular languages and syntactic monoid size. In this paper we confirm the conjecture on two generator transformation semi...
CASCON
1997
13 years 8 months ago
1997
The explosion in the amount of free text materials on the Internet, and the use of this information by people from all walks of life, has made the issue of generalized information...