List questions from finite-state-machine

Published on 28 Mar 2014 - 15:43

320

Views

Deterministic Finite State machine for a Language

Published on 05 Oct 2019 - 0:42

1.6k

Views

Regular Language accepted by a Finite State Machine

Published on 07 Oct 2019 - 3:16

485

Views

Epsilon Non Deterministic Finite Automata proof

Published on 21 Oct 2019 - 21:46

45

Views

How can I show regular language is closed under square root?

Published on 05 Nov 2019 - 3:03

1.8k

Views

I am trying to find a regular expression for {Strings whose number of 0s is not divisible by 4}, with and without the use of complement.

Published on 20 Nov 2019 - 16:32

56

Views

Is it possible to design a DFA for these languages?

Published on 24 Nov 2019 - 3:33

363

Views

How do I prove that this language is regular?

Published on 05 Dec 2019 - 23:20

114

Views

Can a regular language be defined using recursive regular expressions?

Published on 10 Dec 2019 - 10:48

4.6k

Views

Equivalence of NFA with and without $\epsilon$-transitions.

Published on 25 Dec 2019 - 0:51

81

Views

partial recursive functions

Published on 26 Dec 2019 - 18:17

90

Views

Construct a deterministic finite machine for the language $(01)^*$

Published on 15 Jan 2020 - 17:43

94

Views

Deterministic finite machine recognizing language $((00)^|1(11)^)^*$

Published on 16 Jan 2020 - 14:17

253

Views

Converting NFAs to DFAs

Published on 20 Jan 2020 - 1:41

52

Views

Using transition matrices for strings with specifcations on string block length

Published on 06 Feb 2020 - 3:44

List Question

Finite state machine question

Deterministic Finite State machine for a Language

Regular Language accepted by a Finite State Machine

Epsilon Non Deterministic Finite Automata proof

How can I show regular language is closed under square root?

I am trying to find a regular expression for {Strings whose number of 0s is not divisible by 4}, with and without the use of complement.

Is it possible to design a DFA for these languages?

How do I prove that this language is regular?

Can a regular language be defined using recursive regular expressions?

Equivalence of NFA with and without $\epsilon$-transitions.

partial recursive functions

Construct a deterministic finite machine for the language $(01)^*$

Deterministic finite machine recognizing language $((00)^|1(11)^)^*$

Converting NFAs to DFAs

Using transition matrices for strings with specifcations on string block length

Trending Questions

Popular # Hahtags

Popular Questions