15 search results - page 1 / 3 » Context-Free Languages via Coalgebraic Trace Semantics |
CALCO
2005
Springer
13 years 10 months ago
2005
Springer
In this paper we identify context-free grammars as coalgebras. To obtain the associated context-free languages (consisting of only finite-length strings) we introduce a general a...
IFIPTCS
2010
13 years 2 months ago
2010
Abstract. We propose a framework for reasoning about program security building on language-theoretic and coalgebraic concepts. The behaviour of a system is viewed as a mapping from...
ESOP
2007
Springer
13 years 11 months ago
2007
Springer
There is a growing concern on anonymity and privacy on the Internet, resulting in lots of work on formalization and verification of anonymity. Especially, importance of probabilis...
ICML
2005
IEEE
14 years 5 months ago
2005
IEEE
We present a directed Markov random field (MRF) model that combines n-gram models, probabilistic context free grammars (PCFGs) and probabilistic latent semantic analysis (PLSA) fo...
JLP
2006
13 years 4 months ago
2006
In this paper, we develop a theory of modular design and refinement of hierarchical hybrid systems. In particular, we present compositional trace-based semantics for the language ...