1246 search results - page 77 / 250 » Recursive Timed Automata |
129
Voted
LICS
2007
IEEE
15 years 7 months ago
2007
IEEE
We define a new class of languages defined by multi-stack automata that forms a robust subclass of context-sensitive languages, with decidable emptiness and closure under boolea...
90
Voted
CORR
2010
Springer
15 years 11 days ago
2010
Springer
The study of factoring relations between subshifts or cellular automata is central in symbolic dynamics. Besides, a notion of intrinsic universality for cellular automata based on ...
CORR
2000
Springer
15 years 18 days ago
2000
Springer
Attribute grammars (AGs) are a formal technique for defining semantics of programming languages. Existing complexity proofs on the circularity problem of AGs are based on automata...
106
Voted
ICC
2008
IEEE
15 years 7 months ago
2008
IEEE
— In large Wireless Sensor Networks (WSNs), each hop might incur varying delays due to medium access contention, transmission and computation delays. Fast and efficient query re...
ICIP
2003
IEEE
16 years 2 months ago
2003
IEEE
In scanning photographs, receipts or other small objects users will often scan many at a time. It would be convenient to automatically detect that the scanned image consists of ma...