644 search results - page 80 / 129 » Precedence Automata and Languages |
80
Voted
ACL
1998
15 years 1 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...
97
Voted
CORR
2006
Springer
14 years 11 months ago
2006
Springer
We investigate families of infinite automata for context-sensitive languages. An infinite automaton is an infinite labeled graph with two sets of initial and final vertices. Its la...
110
click to vote
ENTCS
2006
14 years 11 months ago
2006
In this study, we introduce a model transformation tool for a time-triggered language: Giotto. The tool uses graphs to represent the source code (Giotto) and the target (the sched...
80
Voted
AAAI
1990
15 years 25 days ago
1990
Cyclic definitions are often prohibited in terminological knowledge representation languages because, from a theoretical point of view, their semantics is not clear and, from a pr...
107
click to vote
SP
2008
IEEE
14 years 11 months ago
2008
IEEE
This paper presents FABLE, a core formalism for a programming language in which programmers may specify security policies and reason that these policies are properly enforced. In ...