Register
Dark Mode

Language to PDA

in Theory of Computation retagged by
335 views
1 vote
1 vote

Design the Push down Automata for the language L={anbmc2nd3m,n,m>=1}.Check the acceptance string by both the empty stack and final state method.

in Theory of Computation retagged by
by
335 views

Please log in or register to answer this question.

← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
1 answer
1
radha gogia asked in Theory of Computation Nov 26, 2018
1,079 views
How to draw PDA For following language
radha gogia asked in Theory of Computation Nov 26, 2018
by radha gogia
1.1k views

Subscribe to GATE CSE 2024 Test Series

Subscribe to GO Classes for GATE CSE 2024

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

Subjects

64.3k questions

77.9k answers

244k comments

80.0k users

Developed by Chun
Link Copied!