in Algorithms
0 votes
0 votes
  1. A DFA for all sets that contains even 0’s and even 1’s.

Instruction: Convert the following DFA into NFA.

Instruction: Minimize the following DFA.


Instruction: Give the deterministic automata accepting the following languages over alphabet {0, 1}

  1. The set of all strings ending in 00.
  2. the set of all strings with three consecutive 0’s.
  3. the set of all string that contains odd 1’s.
in Algorithms
5 points

Please log in or register to answer this question.

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
Welcome to GATE CSE Doubts, where you can ask questions and receive answers from other members of the community.