206 search results - page 28 / 42 » Regular Expressions into Finite Automata |
CPAIOR
2007
Springer
14 years 1 months ago
2007
Springer
Many optimisation problems contain substructures involving constraints on sequences of decision variables. Such constraints can be very complex to express with mixed integer progra...
CSR
2006
Springer
13 years 11 months ago
2006
Springer
Regular expression pattern matching is widely used in computational biology. Searching through a database of sequences for a motif (a simple regular expression), or its variations...
CSL
2010
Springer
13 years 8 months ago
2010
Springer
Abstract. The relationship between automata and logics has been investigated since the 1960s. In particular, it was shown how to determine, given an automaton, whether or not it is...
TACS
2001
Springer
13 years 11 months ago
2001
Springer
Decidability of non-structural subtype entailment is a long standing open problem in programming language theory. In this paper, we apply automata theoretic methods to characterize...
ICFP
2006
ACM
14 years 7 months ago
2006
ACM
Often, independent organizations define and advocate different XML formats for a similar purpose and, as a result, application programs need to mutually convert between such forma...