Results 1 to 10 of about 52,651 (265)
Coalgebraic Characterizations of Context-Free Languages [PDF]
Logical Methods in Computer Science, 2013 In this article, we provide three coalgebraic characterizations of the class of context-free languages, each based on the idea of adding coalgebraic structure to an existing algebraic structure by specifying output-derivative pairs.
Joost Winter +2 more
doaj +8 more sources
Theoretical Computer Science, 2011 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Szabolcs Ivan, Zoltan Ésik
exaly +2 more sources
Dissecting power of intersection of two context-free languages [PDF]
Discrete Mathematics & Theoretical Computer Science, 2023 We say that a language $L$ is \emph{constantly growing} if there is a constant $c$ such that for every word $u\in L$ there is a word $v\in L$ with $\vert u\vert<\vert v\vert\leq c+\vert u\vert$.
Josef Rukavicka
doaj +1 more source
Aperiodicity, Star-freeness, and First-order Logic Definability of Operator Precedence Languages [PDF]
Logical Methods in Computer Science, 2023 A classic result in formal language theory is the equivalence among non-counting, or aperiodic, regular languages, and languages defined through star-free regular expressions, or first-order logic.
Dino Mandrioli +2 more
doaj +1 more source
A First-Order Complete Temporal Logic for Structured Context-Free Languages [PDF]
Logical Methods in Computer Science, 2022 The problem of model checking procedural programs has fostered much research towards the definition of temporal logics for reasoning on context-free structures. The most notable of such results are temporal logics on Nested Words, such as CaRet and NWTL.
Michele Chiari +2 more
doaj +1 more source
Partially-commutative context-free languages [PDF]
Electronic Proceedings in Theoretical Computer Science, 2012 The paper is about a class of languages that extends context-free languages (CFL) and is stable under shuffle. Specifically, we investigate the class of partially-commutative context-free languages (PCCFL), where non-terminal symbols are commutative ...
Sławomir Lasota, Wojciech Czerwiński
doaj +1 more source
Permutations of context-free, ET0L and indexed languages [PDF]
Discrete Mathematics & Theoretical Computer Science, 2016 For a language $L$, we consider its cyclic closure, and more generally the language $C^{k}(L)$, which consists of all words obtained by partitioning words from $L$ into $k$ factors and permuting them. We prove that the classes of ET0L and EDT0L languages
Tara Brough +3 more
doaj +1 more source
Separation of Test-Free Propositional Dynamic Logics over Context-Free Languages [PDF]
Electronic Proceedings in Theoretical Computer Science, 2011 For a class L of languages let PDL[L] be an extension of Propositional Dynamic Logic which allows programs to be in a language of L rather than just to be regular.
Markus Latte
doaj +1 more source
Infinitary Axiomatization of the Equational Theory of Context-Free Languages [PDF]
Electronic Proceedings in Theoretical Computer Science, 2013 We give a natural complete infinitary axiomatization of the equational theory of the context-free languages, answering a question of Leiß (1992).
Niels Bjørn Bugge Grathwohl +2 more
doaj +1 more source
Mathematics, 2022 The limitations of traditional parsing architecture are well known. Even when paired with parsing methods that accept all context-free grammars (CFGs), the resulting combination for any given CFG accepts only a limited subset of corresponding character ...
Žiga Leber +3 more
doaj +1 more source