Register
Dark Mode

Construct pushdown automata that recognize the following language. L= (a²ⁿ b³ⁿ | n ≥ 0}

in Theory of Computation
301 views
1 vote
1 vote

Construct pushdown automata that recognize the following language.

L= (a²ⁿ b³ⁿ | n ≥ 0}

in Theory of Computation
by
301 views

1 Answer

2 votes
2 votes
For each 'a' push 3 'x' for each 'b' pop 2 'x'
by
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
0 answers
3
tesfaye asked in Theory of Computation Dec 19, 2022
572 views
Show that the language L = {an : n ≥ 0, n != 3} is regular.
tesfaye asked in Theory of Computation Dec 19, 2022
by tesfaye
572 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!