Formal Language and Automata Theory
$10-30 USD
Paid on delivery
Hello,
I am looking for expert in Formal Language & Automata Theory
We covered the following topics:
Regular Languages
Finite Automata
Nondeterminism
Regular Expressions
Nonregular Expressions
Context-Free Languages
Context-Free Grammars
Non-context-free languages
Computability Theory
Turing Machines
Variant of Turing Machines
The definition of algorithm
Time complexity (np-completeness, example np-complete problem, and reductions)
1) Undecidability
- Post's Correspondence Problem
- Halting Problem
2) NP-complenetness
- Hamiltonian path problem
- k-clique problem
- vertex-cover problem
- Satisfiability and 3SAT problems
- Subset-sum problem
3) Reductions
- 3SAT to k-clique
- 3SAT to Hamiltonian path
4) Approximation algorithms
- Vertex-cover approximation algorithm
Thanks
Project ID: #14011570
About the project
4 freelancers are bidding on average $21 for this job
I have been giving lectures on Formal Languages and Automata Theory since 1996. Please send your problem, and I'll try to help.
We are team of excellent developers and writers. We have 2 year experience related to your project field. We can do your project and solve your all problems according to your requirements. We have read your description More
I have researched turing models of chemical reactions and programmed 3D energy transport across different programming paradigms. Such paradigms are advantages in computation time and resources where one programming lan More
