Register
Dark Mode

gradeup test series

in Theory of Computation
524 views
0 votes
0 votes

Check whether the given language is regular or not:

L={am bn  ; nm<=789}

 

in Theory of Computation
by
524 views

3 Comments

by
REGULAR
0
0
by
As length is finite so it is regular
0
0
by
I was thinking same but answer was non regular....
By the way thanks
0
0

Please log in or register to answer this question.

← PreviousNext →
← Previous in categoryNext in category →

Related questions

1 vote
1 vote
2 answers
4
ajay_rajpurohit asked in Databases Oct 4, 2021
379 views
gradeup quiz question
please explain the question
ajay_rajpurohit asked in Databases Oct 4, 2021
by ajay_rajpurohit
379 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!