The Gateway to Computer Science Excellence
0 votes
9 views

Let $\Sigma = \{0,1\}$ and let $B$ be the collection of strings that contain at least one  $1$ in their second half. In other words, $B = \{uv \mid u \in \Sigma^{\ast}, v \in \Sigma^{\ast}1\Sigma^{\ast}\: \text{and} \mid u \mid \geq \mid v \mid \}$.

  1. Give a PDA that recognizes $B$.
  2. Give a CFG that generates $B$.
in Theory of Computation by Veteran (55k points) | 9 views

Please log in or register to answer this question.

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,645 questions
56,601 answers
195,851 comments
102,208 users