Dark Mode

Recent questions tagged finite-automata

0 votes

0 answers

1

Regular Languages
The solution to $X = r +Xs$ by Arden’s Lemma when s has ϵ a) an infinite number of solutions b) a finite number of solutions c) is always unique d) none

practicalmetal asked in Theory of Computation 3 days ago

by practicalmetal

20 views

0 votes

1 answer

2

An Introduction to Formal Languages and Automata,6th edition,Exercise 2.3 Q2.
Convert the nfa in Exercise 13, Section 2.2, into an equivalent dfa.

Silver_Reaper asked in Theory of Computation Jan 28

by Silver_Reaper

129 views

0 votes

0 answers

3

An Introduction to Formal Languages and Automata Peter Linz 6th Edition.Exercise 2.1 4 d,e
For Σ = {a, b}, construct dfa’s that accept the sets consisting of: (d) all strings with at least one b and exactly two a’s. (e) all the strings with exactly two a’s and more than three b’s.

Silver_Reaper asked in Theory of Computation Jan 24

by Silver_Reaper

81 views

2 votes

1 answer

4

DFA | Madeeasy TOC
Please explain what is difference between $\overline{L(N)}$ and $L(\overline{N}$) ?

abhinowKatore asked in Theory of Computation Jan 14

by abhinowKatore

175 views

0 votes

1 answer

5

Class Test AFLL Revision
How many states does the DFA and NFA constructed for the “set of all binary strings where the second last symbol will never be a 1” have?

dawndarcy asked in Others Jan 12

197 views

0 votes

0 answers

6

Testbook Chapter Test on Finite Automata (CT: 19)
Which of the following statements is/are true? The language denoted by the regular expression (ϕ*)* is ϵ The language denoted by the regular expression a ϕ is ϕ The regular expression for the language L={vuv|v,u∈{a,b}*,|v|≤3 } is L=(a ... it will still denote an empty set, right? Whereas, epsilon (ϵ) is not an empty set. And option 4 is True, right?

Rajsukh Mohanty asked in Theory of Computation Jan 6

by Rajsukh Mohanty

71 views

0 votes

1 answer

7

Show that the following pairs of regular expressions define the same language over the alphabet I = [a, b]. s(a) p(pp)*( A + p)q + q and p*q (b) A +0(0+1)* + (0+1)* 00(0+1)* and ((1*0)*01*)* (c) (s*ttt)*s* and s*(ttts*)*

M_Umair_Khan42900 asked in Theory of Computation Dec 29, 2022

by M_Umair_Khan42900

134 views

0 votes

0 answers

8

For each of the following language, if the language is regular, write down the corresponding regular expression. Else, prove that the language is not regular. a) (0²ⁿ | n ≥ 1) Answer: b) String over the decimal alphabets (0,1,2....9) with characters in sorted orders. c) The set of all even binary numbers

M_Umair_Khan42900 asked in Theory of Computation Dec 29, 2022

by M_Umair_Khan42900

53 views

0 votes

1 answer

9

Write regular expression to denote a language L a) String which begin or end with either 00 or 11. b) The set of all strings, when viewed as binary representation of integers, that are divisible by 2. c) The set of all strings containing 00. d) String not containing the substring 110.

M_Umair_Khan42900 asked in Theory of Computation Dec 29, 2022

by M_Umair_Khan42900

146 views

0 votes

1 answer

10

Made Easy Test Series | Theory Of Computation | Regular Grammar
The following language regular L*, where L={ $0^{{m}^{2}} | m\leq 3$ } True False

Souvik33 asked in Theory of Computation Dec 27, 2022

160 views

1 vote

1 answer

11

DRDO CSE 2022 Paper 2 | Question: 10
Construct a Deterministic Finite Automaton $\text{(DFA)}$ with $5$ states that accepts all strings with $0101$ as a substring.

admin asked in Theory of Computation Dec 15, 2022

by admin

75 views

0 votes

0 answers

12

This question is from introduction to formal language and automata peter linz 5th edition

Hafeezullah asked in Theory of Computation Dec 2, 2022

13 views

0 votes

0 answers

13

Theory Of Computation
Can finite automata do addition, subtraction, and multiplication? Anyone, please explain in detail?

raja11sep asked in Theory of Computation Nov 22, 2022

123 views

0 votes

1 answer

14

#GateAppliedCourse-DFA-EpsilonNFA
can we solve it with a minimum of 4 states?

Dknights asked in Theory of Computation Nov 19, 2022

98 views

0 votes

1 answer

15

Made easy postal course example problem
What will be the DFA for wxw^r where w belongs to (a,b)^+ and x belongs to (a,b)^+

Luci3671 asked in Theory of Computation Nov 11, 2022

104 views

0 votes

1 answer

16

Theory Of Computation (NFA/DFA)
**MSQ** The Finite State Autometa with a Regular Expression P= 0+1, will accept the string(s) 0 1 01 10

Souvik33 asked in Theory of Computation Nov 7, 2022

136 views

0 votes

1 answer

17

Theory of Computation
b* a* ∩ a*b* = (a U b)* Is this statment wrong or correct ?

moe12leb asked in Theory of Computation Nov 5, 2022

107 views

0 votes

0 answers

18

Theory of computation
Can finite automata do multiplication.

Overflow04 asked in Theory of Computation Oct 31, 2022

102 views

0 votes

2 answers

19

#MADE EASY
Is this statement right or wrong? A DFA does not contain a dead configuration. and what is the mean of dead configuration exactly?

Dknights asked in Theory of Computation Oct 27, 2022

243 views

0 votes

3 answers

20

Regular expression
is a(ba)*=(ab)*a?

nbhatt asked in Theory of Computation Sep 23, 2022

by nbhatt

236 views

0 votes

0 answers

21

Regular expression
Can we simplify a*+a*b(d+ca*b)*ca* ? Where a,b,c,d are regular expression.

nbhatt asked in Theory of Computation Sep 21, 2022

by nbhatt

217 views

0 votes

1 answer

22

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

dutta18 asked in Theory of Computation Sep 21, 2022

169 views

0 votes

1 answer

23

Regular expression
What will be the regular expression for following fa using recurrence relation method.

nbhatt asked in Theory of Computation Sep 21, 2022

by nbhatt

140 views

2 votes

3 answers

24

Regular expression
Is (a+ab*b)* and (ab*)* same or not?

nbhatt asked in Theory of Computation Sep 15, 2022

by nbhatt

320 views

Page:

1
2
3
4
5
6
...
33
next »

Recent questions tagged finite-automata