59 search results - page 4 / 12 » State Complexity of Union and Intersection of Finite Languag... |
FOSSACS
2008
Springer
13 years 9 months ago
2008
Springer
The problem of converting deterministic finite automata into (short) regular expressions is considered. It is known that the required expression size is 2(n) in the worst case for ...
DLOG
1996
13 years 8 months ago
1996
Number restrictions are concept constructors that are available in almost all implemented description logic systems. However, even though there has lately been considerable effort...
SIGSOFT
2005
ACM
14 years 8 months ago
2005
ACM
Previous work has proven typestates to be useful for modeling protocols in object-oriented languages. We build on this work by addressing substitutability of subtypes as well as i...
CICLING
2010
Springer
13 years 2 months ago
2010
Springer
Abstract. We present a linguistically-motivated sub-sentential alignment system that extends the intersected IBM Model 4 word alignments. The alignment system is chunk-driven and r...
ECCV
2010
Springer
14 years 26 days ago
2010
Springer
Abstract. In this paper we develop an algorithm for structured prediction that optimizes against complex performance measures, those which are a function of false positive and fals...