Automata Theory Problems
$10-30 USD
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.
ID Proyek: #6519579
Tentang proyek
6 freelancer rata-rata menawar $23 untuk pekerjaan ini
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
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.
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
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.
I am electrical engineer with solid knowledge of C. ---------------------------------------------------