13306 search results - page 442 / 2662 » Theoretical Computer Science |
190
click to vote
KSEM
2010
Springer
15 years 5 months ago
2010
Springer
One criterion for the well-formedness of ontologies is that their hierarchical structure forms a lattice. Formal Concept Analysis (FCA) has been used as a technique for assessing ...
184
click to vote
WG
2010
Springer
15 years 5 months ago
2010
Springer
Eulerian extension problems aim at making a given (directed) (multi-)graph Eulerian by adding a minimum-cost set of edges (arcs). These problems have natural applications in schedu...
189
click to vote
DLT
2009
15 years 5 months ago
2009
Abstract. We analyze Hmelevskii's theorem, which states that the general solutions of constant-free equations on three unknowns are expressible by a finite collection of formu...
179
click to vote
DLT
2009
15 years 5 months ago
2009
Seki et al. (1991) proved a rather weak pumping lemma for multiple context-free languages, which says that any infinite m-multiple context-free language contains a string that is p...
214
click to vote
DLT
2009
15 years 5 months ago
2009
Abstract. We improve on some recent results on lower bounds for conversion problems for regular expressions. In particular we consider the conversion of planar deterministic finite...