Automata Theory Problems

Ditutup Dipasang Sep 29, 2014 Dibayar saat pengiriman
Ditutup Dibayar saat pengiriman

For the alphabet Σ = {a, b},

1) Construct an NFA that accept the set of all strings that have either the number of

a’s odd, or the number of b’s not a multiple of 3, or both.

2) Convert this NFA to an equivalent DFA.

Pemrograman C Teknik Bahasa Alami Studi Sains Pengembangan Perangkat Lunak

ID Proyek: #6519579

Tentang proyek

6 proposal Proyek online Aktif Nov 5, 2014

6 freelancer rata-rata menawar $23 untuk pekerjaan ini

Nikhil3398

Hi.. I am Nikhil. I have working experience of 3+ year in C++ Development. I have done work on: 1. Data Structure like: Set, Vector, Stack, Linked list, Tree(Any type), Graphes. 2. STL ( Tamplate Library ) Lebih banyak

$25 USD dalam 1 hari
(7 Ulasan)
2.9
Jraml

Hi. I have a computer science degree at University of Havana (so we can talk in Spanish if you want). I have solid knowledge in theory of computation and experience building automatas. Best regards.

$30 USD dalam 1 hari
(4 Ulasan)
2.5
luckyLu7

一个有效的提议尚未被提供

$25 USD dalam 3 hari
(0 Ulasan)
0.0
saurabhrohit

Hello, I have started my Freelance career this July and handled a few projects till now successfully. I would like you to consider me for your work and I will try my best for your satisfaction. Few points about me: Lebih banyak

$25 USD dalam 1 hari
(0 Ulasan)
0.0
rohitsr

I have good experience of programming. I have logical thinking to solve problems. I have knowledge of Automata as well. Please inform me if you want me to do this project.

$20 USD dalam 1 hari
(0 Ulasan)
0.0
janjiczika

I am electrical engineer with solid knowledge of C. ---------------------------------------------------

$15 USD dalam 1 hari
(0 Ulasan)
0.0