263 search results - page 38 / 53 » Rigid Tree Automata |
200
click to vote
SACMAT
2009
ACM
15 years 11 months ago
2009
ACM
An access control system is often viewed as a state transition system. Given a set of access control policies, a general safety requirement in such a system is to determine whethe...
133
click to vote
FOSSACS
2004
Springer
15 years 10 months ago
2004
Springer
Labelled Markov processes (LMPs) are automata whose transitions are given by probability distributions. In this paper we present a ‘universal’ LMP as the spectrum of a commutat...
136
click to vote
ICFP
2007
ACM
16 years 5 months ago
2007
ACM
We present a pair of reasoning principles, definition and proof by rigid induction, which can be seen as proper generalizations of lazy-datatype induction to monadic effects other...
252
click to vote
POPL
2006
ACM
16 years 5 months ago
2006
ACM
We propose a type system based on regular tree grammars, where algebraic datatypes are interpreted in a structural way. Thus, the same constructors can be reused for different typ...
129
click to vote
ACL
1998
15 years 6 months ago
1998
Since the early Sixties and Seventies it has been known that the regular and context-free languages arc characterized by definability in the monadic second-order theory of certain...