A. H.'s user avatar
A. H.'s user avatar
A. H.'s user avatar
A. H.
  • Member for 1 year, 11 months
  • Last seen more than a week ago
3 votes
Accepted

Designing a PDA without using CFG -> PDA for the language $ \{ a^nb^m | n \le m \le 2n \}$

3 votes
Accepted

Find a Context-Free Grammar for $L = \{a^wb^xc^yd^z | w + x = y + z\}$

2 votes
Accepted

Possible PDA for $ L = \{ a^{3n}b^{2n} | n \ge 0 \}$ without transforming CFG to PDA

2 votes
Accepted

Context-free grammar for $L=\{ a^nb^m | n \le m+3 \}$

1 vote

Context-free grammar for language $L = \{u \in \{a, b\}^* \mid |u|_a = |u|_b\}$

1 vote

Dynamic routing algorithm

1 vote

Pushdown automaton that accepts $a^{2k} b^{3k}$, without multiple pop

1 vote

Count-to-infinity avoidance techniques and hold-down timeout based question

1 vote

CFL with regular substitution to make a regular language

1 vote
Accepted

How to prove that $half(L)=\{x|xy\in L,|x|=|y|\}$ is Regular Language

1 vote

Checking my Pushdown automaton for $L = \{ 0^i1^j2^{i+j} | i \ge 0, j \ge 0, i+j > 0 \}$

1 vote

How would I design a State Diagram (FSM) for a AC unit?

1 vote
Accepted

Design a Pushdown automaton for $L = \{a^nb^m | n \le m \le 3n \} $

1 vote

How are regular languages not structurally recursive?

1 vote
Accepted

Page fault question

0 votes

How to prove the language of words $a^ib^jc^k$ where $\min(i,j)\le k\le\max(i,j)$ is not context-free?

0 votes

Do all computers use parity checking? When does it happen?

0 votes

Need help proving the following for every integer n larger or equal to 1

0 votes

Is this a context free language? I need to make PDA but I don't think it is doable

0 votes

Argument for an $\epsilon$ free LL(1) grammar being in LR(0)?

0 votes
Accepted

find LR(1) items of the first state

0 votes

Elemination of duplicate premise

0 votes
Accepted

in 2DPDA and 3DPDA:2 and 3 is the number of tapes or of stacks?

0 votes

Java | If a=250, b=3, c=(a + b/2)/b * b, Why doesn't c equal 251 but rather 249?

0 votes

Design a CFG for $L=\{ w \in \{ 0,1 \}^* \}$, where $w$ contains at least three ones

0 votes
Accepted

CFG to RG Conversion