346 search results - page 38 / 70 » Determinizing Asynchronous Automata |
116
click to vote
CSFW
2007
IEEE
15 years 11 months ago
2007
IEEE
We address the programmatic realization of the access control model of security in distributed systems. Our aim is e the gap between abstract/declarative policies and their concre...
162
click to vote
LICS
2007
IEEE
15 years 10 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...
141
click to vote
EMNLP
2011
14 years 4 months ago
2011
This paper compares several translation representations for a synchronous context-free grammar parse including CFGs/hypergraphs, finite-state automata (FSA), and pushdown automat...
133
click to vote
CORR
2011
Springer
14 years 11 months ago
2011
Springer
Abstract The class of ω-regular languages provide a robust specification language in verification. Every ω-regular condition can be decomposed into a safety part and a liveness...
129
click to vote
MFCS
2009
Springer
15 years 11 months ago
2009
Springer
The concept of determinism, while clear and well assessed for string languages, is still matter of research as far as picture languages are concerned. We introduce here a new kind ...