3653 search results - page 505 / 731 » On Recognizable Timed Languages |
179
click to vote
NGC
2008
Springer
15 years 6 months ago
2008
Springer
A bytecode verifier for the Java virtual machine language (JVML) statically checks that bytecode does not cause any fatal error. However, the present verifier does not check correc...
177
click to vote
IANDC
2007
15 years 6 months ago
2007
We consider an extension of linear-time temporal logic (LTL) with constraints interpreted over a concrete domain. We use a new automata-theoretic technique to show pspace decidabi...
152
click to vote
PUC
2006
15 years 6 months ago
2006
In the realm of product design, communication between designer, client, design team and future users is of great importance. Throughout the design process, ideas and concepts are g...
169
click to vote
LATA
2010
Springer
16 years 4 months ago
2010
Springer
This paper presents a new polynomial-time algorithm for the inclusion problem for certain pairs of regular expressions. The algorithm is not based on construction of finite automat...
149
click to vote
AML
2005
15 years 6 months ago
2005
Abstract. We investigate the theories LA, LAP, LAP of linear algebra, which were originally defined to study the question of whether commutativity of matrix inverses has polysize F...