Tag: context-free

Found 39 results for 'context-free'.

1) reference-request - Lower bounds on the size of CFGs for specific finite languages
2) fl.formal-languages - Is this generalization of context free grammars known and strict?
3) approximation-algorithms - Compression algorithms for low-complexity strings?
4) cc.complexity-theory - Is SAT a context-free language?
5) fl.formal-languages - Ambiguity in regular and context-free languages
6) pl.programming-languages - For a language to be programmable, is it mandatory that it be based on a context free grammar
7) fl.formal-languages - Asymptotic density of ambiguous context-free grammars (CFGs)
8) fl.formal-languages - What is the state complexity of the copy language?
9) lg.learning - What is the current state of the art in black-box grammar induction?
10) reference-request - Reference for Dyck languages being $\mathsf{TC}_0$-complete
11) fl.formal-languages - Maximum shortest word accepted by pushdown automata
12) fl.formal-languages - The class CFL\cap co-CFL
13) fl.formal-languages - Regarding proper form of production rules of Context-free tree grammars
14) fl.formal-languages - Known and described subclasses of Context-Free Grammars class
15) automata-theory - Does a finite, polynomially-bounded CFG translate into a polynomially-bounded DFA?
16) fl.formal-languages - Does there exist an extension of regular expressions that captures the context free languages?
17) reference-request - Classes containing boolean closure of CFLs
18) fl.formal-languages - Is equivalence of unambiguous context-free languages decidable?
19) context-free - Membership problem for certain class of unrestricted grammars
20) fl.formal-languages - Context Free Grammar For Complement Of { www | ... } with minimal pumping length?
21) reference-request - Generalizations of Dyck languages?
22) reference-request - is determining an unknown CFL from intersection of two CFLs decidable?
23) fl.formal-languages - Is the complement of { www | … } context-free?
24) fl.formal-languages - Number of words of length n in a context-free language
25) reference-request - For which $R$ is $\{0^a10^b10^c\mid R(a,b,c)\}$ context-free?
26) automata-theory - Are PDAs without ϵ moves and with bounded stack operation as powerful as PDAs with them?
27) computability - Show that minimal CFG is undecidable via mapping reduction
28) reference-request - Are deterministic context-free languages closed under outfix (or other erasing operations)
29) automata-theory - Are endmarkers necessary for Deterministic Pushdown Automata?
30) automata-theory - Are DPDAs without a $\epsilon$ moves as powerful as DPDAs with them?
31) context-free - What is known about $CFL \cap coCFL$?
32) ds.algorithms - CFG parsing using $o(n^2)$ space
33) context-free - A reference for a "more algebraic" approach to pushdown automata and CFLs?
34) fl.formal-languages - Why is non-determinism (Push-down automata) necessary?
35) reference-request - Compressing grammars by introducing ambiguity and left-recursion
36) reference-request - Can all unambiguous grammars be parsed in linear time?
37) fl.formal-languages - Size of complement of context-free language
38) tree - Example of context-free tree language which can not be generated by monadic CFTG
39) fl.formal-languages - Words of the form $(a^n b)^n$ in a context-free language