Awesome q2a theme
0 votes
3 views
For E={a,b} construct a dfa for language L

where L={w | w has a b in its 2nd last position if such a position exists}????
in Theory of Computation by (5 points) | 3 views

Please log in or register to answer this question.

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
Welcome to GATE CSE Doubts, where you can ask questions and receive answers from other members of the community.
9,270 questions
3,204 answers
14,751 comments
96,304 users