Register
Dark Mode

Given Language is Context free or Regular ?
[closed]

in Theory of Computation closed by
715 views
0 votes
0 votes
closed with the note: answer a(a+b)*a is enough to understand it.

Let Ʃ = {a, b} and L = {anwan | n ≥ 1, w ∈ Ʃ*}.

Then

  1. L is context free but not regular
  2. L is not context free but regular
  3. L is context free as well as regular
  4. L is neither context free and nor regular
in Theory of Computation closed by
by
715 views

3 Comments

by
It is regular and hence CFL as well.
1
1
by
RE: a(a+b)*a
2
2
by
It is a language start and end with a
1
1
← PreviousNext →
← Previous in categoryNext in category →

Related questions

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!