Dark Mode

Questions by dutta18

1 vote

1 answer

1

Self doubt
How to do this Boolean multiplication? And which Boolean law is applicable here ? ( P' + Q ) ( Q' + P )

asked in Mathematical Logic Dec 9, 2022

89 views

0 votes

0 answers

2

GATE CSE 2020
Is this language a regular language ? If yes why and if No why ? The last part is “x!=y” cropped in the picture According to my understanding this is not regular because its says number of x = number of y But Finite automata cant compare the number of x and y here with limited memory. Can you please explain ?

asked in Theory of Computation Sep 22, 2022

584 views

0 votes

1 answer

3

Conversion of Regular expression to Finite Automata
What is the Finite Automata( NFA, epsilon-NFA or DFA) for the regular expression (a*ba)* ?

asked in Theory of Computation Sep 21, 2022

143 views