List questions from context-free-grammar

Published on 04 May 2014 - 13:35

32

Views

Collapsing adjacent states in a grammar

Published on 04 May 2014 - 20:09

2.2k

Views

Can an infinite set of primes be a regular language or CFG?

Published on 07 May 2014 - 17:01

183

Views

Deterministic Push-Down Automata

Published on 19 May 2014 - 13:22

2.6k

Views

Context free grammar $L=\{a^ib^jc^k|j=i+k-2\}$

Published on 25 Mar 2026 - 7:48

219

Views

w such that contains at most two 1s, CFG idea

Published on 26 May 2014 - 12:58

838

Views

help to fine about CFG for $L=\{a^nb^mc^k:|n-m|=k\}$

Published on 27 May 2014 - 7:27

139

Views

Designing a context free grammar

Published on 28 May 2014 - 14:29

1.9k

Views

Chomsky normal form complexity

Published on 13 Jun 2014 - 21:37

226

Views

Context free grammar and pumping lemma

Published on 14 Jun 2014 - 22:29

53

Views

How does the push-down automaton have to look like?

Published on 28 Jun 2014 - 0:12

144

Views

Algorithm that takes input desc. of two PDAs and outputs intersection of langs. recognized by two PDAs

Published on 13 Aug 2014 - 11:35

1.9k

Views

CFG for $a^ib^jc^k | i\neq j\ or\ j\neq k$

Published on 16 Aug 2014 - 10:10

28

Views

Can two different rules be applied at the same step in Type 0 Grammar

Published on 17 Aug 2014 - 11:41

103

Views

Challenge on Property of Complement in Language

Published on 19 Aug 2014 - 20:21

List Question

Checking my CFG to CNF answer

Collapsing adjacent states in a grammar

Can an infinite set of primes be a regular language or CFG?

Deterministic Push-Down Automata

Context free grammar $L=\{a^ib^jc^k|j=i+k-2\}$

w such that contains at most two 1s, CFG idea

help to fine about CFG for $L=\{a^nb^mc^k:|n-m|=k\}$

Designing a context free grammar

Chomsky normal form complexity

Context free grammar and pumping lemma

How does the push-down automaton have to look like?

Algorithm that takes input desc. of two PDAs and outputs intersection of langs. recognized by two PDAs

CFG for $a^ib^jc^k | i\neq j\ or\ j\neq k$

Can two different rules be applied at the same step in Type 0 Grammar

Challenge on Property of Complement in Language

Trending Questions

Popular # Hahtags

Popular Questions