97 search results - page 7 / 20 » Normalized Expressions and Finite Automata |
IJCSA
2007
13 years 7 months ago
2007
A large number of problems that occur in knowledge-representation, learning, VLSI-design, and other areas of artificial intelligence, are essentially satisfiability problems. The ...
FORMATS
2008
Springer
13 years 9 months ago
2008
Springer
Time dependant models have been intensively studied for many reasons, among others because of their applications in software verification and due to the development of embedded pla...
CSL
2006
Springer
13 years 7 months ago
2006
Springer
In a data word or a data tree each position carries a label from a finite alphabet and a data value from some infinite domain. These models have been considered in the realm of sem...
CSL
2008
Springer
13 years 9 months ago
2008
Springer
Quantitative generalizations of classical languages, which assign to each word a real number instead of a boolean value, have applications in modeling resource-constrained computat...
DLT
2009
13 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...