402 search results - page 5 / 81 » Complexity of Decision Problems for Simple Regular Expressio... |
SARA
2005
Springer
14 years 29 days ago
2005
Springer
Abstract. The presence of long gaps dramatically increases the difficulty of detecting and characterizing complex events hidden in long sequences. In order to cope with this proble...
FUIN
2010
13 years 4 months ago
2010
Abstract. Developing a good formalism and an efficient decision procedure for the instance checking problem is desirable for practical application of description logics. The data c...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Recently, the problem of obtaining a short regular expression equivalent to a given finite automaton has been intensively investigated. Algorithms for converting finite automata to...
LATA
2010
Springer
14 years 4 months ago
2010
Springer
Abstract. Iterated schemata allow to define infinite languages of propositional formulae through formulae patterns. Formally, schemata extend propositional logic with new (generali...
PAAMS
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. Regular expressions, or simply regex, have been widely used as a powerful pattern matching and text extractor tool through decades. Although they provide a powerful and f...