This paper introduces an extension of recurrence analysis to symbolic sequences. Heuristic arguments based on Shannon-McMillan-Breiman theorem suggest several relations between th...
Abstract. We prove that the class of context-free languages with polynomially bounded ambiguity (PCFL) is the closure of the class of unambiguous languages (UCFL) under projections...
: An Extended Abstract Alwen Tiu Computer Sciences Laboratory Australian National University Abstract. A notion of open bisimulation is formulated for the spi calculus, an extensio...
Anchoring is the process of creating and maintaining the correspondence between symbols and percepts that refer to the same physical objects. Although this process must necessaril...
Abstract. Software model checking problems generally contain two different types of non-determinism: 1) non-deterministically chosen values; 2) the choice of interleaving among th...