2465 search results - page 191 / 493 » Automata on Linear Orderings |
156
click to vote
CONCUR
2007
Springer
16 years 20 days ago
2007
Springer
We present a fixpoint-based algorithm for context-sensitive interprocedural kill/gen-analysis of programs with thread creation. Our algorithm is precise up to abstraction of sync...
186
click to vote
MFCS
2007
Springer
16 years 19 days ago
2007
Springer
In formal language theory, many families of languages are defined using grammars or finite acceptors like pushdown automata and Turing machines. For instance, context-sensitive l...
138
click to vote
STACS
2007
Springer
16 years 18 days ago
2007
Springer
Abstract. We give a characterization, in terms of computational complexity, of the family Rec1 of the unary picture languages that are tiling recognizable. We introduce quasi-unary...
167
click to vote
CAV
2004
Springer
15 years 10 months ago
2004
Springer
Model checking algorithms can report a property as being true for reasons that may be considered vacuous. Current algorithms for detecting vacuity require either checking a quadrat...
169
click to vote
DFT
2004
IEEE
15 years 10 months ago
2004
IEEE
Quantum dot Cellular Automata (QCA) is amongst promising new computing scheme in the nano-scale regimes. As an emerging technology, QCA relies on radically different operations in...