List questions from finite-automata

Published on 22 Nov 2015 - 13:13

354

Views

Regular Expression for a Set of Strings of Even Length

Published on 23 Nov 2015 - 6:47

1.4k

Views

Moves in a Turing Machine

Published on 27 Nov 2015 - 5:44

65

Views

Checking whether a Language is Regular

Published on 01 Dec 2015 - 14:04

349

Views

Minimization of DFA

Published on 25 Mar 2026 - 3:25

56

Views

Language of all the binary words that contain $010$ at least twise

Published on 02 Dec 2015 - 11:03

14.3k

Views

Design a DFA to check whether the Given Number is Even

Published on 02 Dec 2015 - 12:44

52

Views

Language of all the binary words that not contains continuum of more then $3$ zeros

Published on 02 Dec 2015 - 13:40

86

Views

Writing a regular expertion for the language $L=\{0^n1^m \mid n\equiv m\pmod 2\}$

Published on 02 Dec 2015 - 15:35

1.5k

Views

Build a DFA that accepts strings over $\{0,1,2\}$ that are divided by $3$ and doesn't include the substring $012$.

Published on 02 Dec 2015 - 15:53

374

Views

Designing a DFA to accept a string

Published on 05 Dec 2015 - 4:37

61

Views

Equivalence classes of $\{ij\ |\ i, j ∈ \{a, b\}^* , i \neq j\}$

Published on 06 Dec 2015 - 17:05

33

Views

Construction of DFA using an odd bit of language

Published on 31 Dec 2015 - 0:27

791

Views

Language resulting in the same NFA as the DFA

Published on 31 Dec 2015 - 17:46

288

Views

DFA, best practice

Published on 25 Mar 2026 - 7:12

List Question

Why for the input: 'a' I'm getting 'Accept' in the automata

Regular Expression for a Set of Strings of Even Length

Moves in a Turing Machine

Checking whether a Language is Regular

Minimization of DFA

Language of all the binary words that contain $010$ at least twise

Design a DFA to check whether the Given Number is Even

Language of all the binary words that not contains continuum of more then $3$ zeros

Writing a regular expertion for the language $L=\{0^n1^m \mid n\equiv m\pmod 2\}$

Build a DFA that accepts strings over $\{0,1,2\}$ that are divided by $3$ and doesn't include the substring $012$.

Designing a DFA to accept a string

Equivalence classes of $\{ij\ |\ i, j ∈ \{a, b\}^* , i \neq j\}$

Construction of DFA using an odd bit of language

Language resulting in the same NFA as the DFA

DFA, best practice

Trending Questions

Popular # Hahtags

Popular Questions