1805 search results - page 17 / 361 » A Theory of Closure Operators |
128
click to vote
LATA
2009
Springer
15 years 10 months ago
2009
Springer
We consider a restricted variant of the hairpin completion called bounded hairpin completion. The hairpin completion is a formal operation inspired from biochemistry. Applied to a ...
105
click to vote
ICALP
2009
Springer
16 years 4 months ago
2009
Springer
Abstract. We introduce the notion of regular cost functions: a quantitative extension to the standard theory of regular languages. We provide equivalent characterisations of this n...
128
click to vote
FOSSACS
2010
Springer
15 years 10 months ago
2010
Springer
Leftist grammars [Motwani et al., STOC 2000] are special semi-Thue systems where symbols can only insert or erase to their left. We develop a theory of leftist grammars seen as wor...
127
Voted
FCT
2009
Springer
15 years 10 months ago
2009
Springer
Weighted automata are finite automata with numerical weights on transitions. Nondeterministic weighted automata define quantitative languages L that assign to each word w a real ...
128
click to vote
AAAI
2010
15 years 4 months ago
2010
Many computational problems in game theory, such as finding Nash equilibria, are algorithmically hard to solve. This limitation forces analysts to limit attention to restricted su...