16 search results - page 2 / 4 » A Generalization of Semenov's Theorem to Automata over Real ... |
CSL
2008
Springer
13 years 6 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...
CADE
2005
Springer
14 years 5 months ago
2005
Springer
We present a fully proof-producing implementation of a quantifier elimination procedure for real closed fields. To our knowledge, this is the first generally useful proof-producing...
MKM
2009
Springer
13 years 11 months ago
2009
Springer
Methods for deciding quantifier-free non-linear arithmetical conjectures over R are crucial in the formal verification of many realworld systems and in formalised mathematics. Wh...
ISSAC
2007
Springer
13 years 11 months ago
2007
Springer
Shirayanagi and Sweedler proved that a large class of algorithms over the reals can be modified slightly so that they also work correctly on fixed-precision floating-point numb...
MST
2006
13 years 5 months ago
2006
Motivated by problems of pattern statistics, we study the limit distribution of the random variable counting the number of occurrences of the symbol a in a word of length n chosen...