Results 1  10
of
19,589
Deterministic ContextFree Model Checking
"... Abstract. Regular ModelChecking (RMC) is a technique for the formal verification of infinite state systems based on the theory of regular languages. In the paper “Beyond Regular Model Checking ” Fisman and Pnueli have shown that RMC can be extended to languages accepted by cascade products of sing ..."
Abstract
 Add to MetaCart
of singlestate deterministic pushdown automata and finite automata. In this paper we further extend RMC to arbitrary deterministic contextfree languages. For this purpose, and inspired by recent results of Caucal, we introduce heightdeterministic pushdown automata and show that they satisfy adequate
Circuits and Contextfree Languages
 In Proceedings of 5th Annual Internat. Conf. on Computing and Combinatorics (COCOON
, 1999
"... Simpler proofs that DAuxPDATIME(polynomial) equals LOGDCFL and that SAC 1 equals LOGCFL are given which avoid Sudborough's multihead automata [Sud78]. The first characterization of LOGDCFL in terms of polynomial prooftreesize is obtained, using circuits built from the multiplex select gat ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
Simpler proofs that DAuxPDATIME(polynomial) equals LOGDCFL and that SAC 1 equals LOGCFL are given which avoid Sudborough's multihead automata [Sud78]. The first characterization of LOGDCFL in terms of polynomial prooftreesize is obtained, using circuits built from the multiplex select gates of [FLR96]. The classes L and NC 1 are also characterized by polynomial size such circuits: "selfsimilar" logarithmic depth captures L, and bounded width captures NC 1 . 1 Introduction The class LOGCFL occupies a central place in the landscape of parallel complexity classes. LOGCFL sits between two interesting classes, NL and AC 1 : NL is often viewed as the space analog of NP, and AC 1 characterizes the problems solvable on a PRAM in O(log n) time using a polynomial number of processors. As a class, LOGCFL has attracted a lot of attention due to its seemingly "richer structure" than that of NL. The initial papers by Sudburough [Sud78] and Ruzzo [Ruz80] characterized LOGCFL using mul...
Immunity and Pseudorandomness of ContextFree Languages
, 902
"... Abstract. We examine the computational complexity of contextfree languages, mainly concentrating on two wellknown structural properties—immunity and pseudorandomness. An infinite language is REGimmune (resp., CFLimmune) if it contains no infinite subset that is a regular (resp., contextfree) la ..."
Abstract

Cited by 7 (6 self)
 Add to MetaCart
) language. We prove that (i) there is a contextfree REGimmune language outside REG/n and (ii) there is a REGbiimmune language that can be computed deterministically using logarithmic space. We also show that (iii) there is a CFLsimple set, where a CFLsimple language is an infinite contextfree
Ordered ContextFree Grammars
"... Contextfree grammars (CFGs) provide an intuitive and powerful formalism for describing the syntactic structure of parsable input streams. Unfortunately, existing online parsing algorithms for such streams admit only a subset of possible CFG descriptions. Theoretically, it is possible to parse any ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
deterministic contextfree language (CFL) in a single pass, as long as the grammar describing the CFL belongs to the LR(k), k ≥ 1 subset of CFGs. However, obtaining a suitable LR(k) description for a language is not an easy task — especially when k = 1 — and usually entails an increase in complexity
Nondeterministic Phase Semantics and the Undecidability of Boolean BI
, 2011
"... We solve the open problem of the decidability of Boolean BI logic (BBI), which can be considered as the “core” of Separation and Spatial Logics. For this, we define a complete phase semantics suitable for BBI and characterize it as trivial phase semantics. We deduce an embedding between trivial phas ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
We solve the open problem of the decidability of Boolean BI logic (BBI), which can be considered as the “core” of Separation and Spatial Logics. For this, we define a complete phase semantics suitable for BBI and characterize it as trivial phase semantics. We deduce an embedding between trivial
Nondeterministic Boolean Proof Nets
, 2009
"... We introduce Nondeterministic Boolean proof nets to study the correspondence with Boolean circuits, a parallel model of computation. We extend the cut elimination of Nondeterministic Multiplicative Linear logic to a parallel procedure in proof nets. With the restriction of proof nets to Boolean ty ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
We introduce Nondeterministic Boolean proof nets to study the correspondence with Boolean circuits, a parallel model of computation. We extend the cut elimination of Nondeterministic Multiplicative Linear logic to a parallel procedure in proof nets. With the restriction of proof nets to Boolean
Contextfree coalgebras
, 2013
"... In this article, we provide a coalgebraic account of parts of the mathematical theory underlying contextfree languages. We characterize contextfree languages, and power series and streams generalizing or corresponding to the contextfree languages, by means of systems of behavioural differential ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
In this article, we provide a coalgebraic account of parts of the mathematical theory underlying contextfree languages. We characterize contextfree languages, and power series and streams generalizing or corresponding to the contextfree languages, by means of systems of behavioural differential
COALGEBRAIC CHARACTERIZATIONS OF CONTEXTFREE LANGUAGES
, 2012
"... Vol. 9(3:14)2013, pp. 1–39 www.lmcsonline.org ..."
On the Computational Complexity of Synchronized ContextFree Languages 1
"... Abstract: We introduce counter synchronized contextfree grammars and investigate their generative power. It turns out that the family of counter synchronized contextfree languages is a proper superset of the family of contextfree languages and is strictly contained in the family of synchronized c ..."
Abstract
 Add to MetaCart
Abstract: We introduce counter synchronized contextfree grammars and investigate their generative power. It turns out that the family of counter synchronized contextfree languages is a proper superset of the family of contextfree languages and is strictly contained in the family of synchronized
Topological Complexity of ContextFree ωLanguages: A Survey
, 2008
"... We survey recent results on the topological complexity of contextfree ωlanguages which form the second level of the Chomsky hierarchy of languages of infinite words. In particular, we consider the Borel hierarchy and the Wadge hierarchy of nondeterministic or deterministic contextfree ωlanguag ..."
Abstract
 Add to MetaCart
We survey recent results on the topological complexity of contextfree ωlanguages which form the second level of the Chomsky hierarchy of languages of infinite words. In particular, we consider the Borel hierarchy and the Wadge hierarchy of nondeterministic or deterministic contextfree ωlanguages
Results 1  10
of
19,589