263 search results - page 38 / 53 » Rigid Tree Automata |
SACMAT
2009
ACM
14 years 2 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...
FOSSACS
2004
Springer
14 years 1 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...
ICFP
2007
ACM
14 years 7 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...
POPL
2006
ACM
14 years 8 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...
ACL
1998
13 years 9 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...