# Automata jobs

Hello,
I want a Ph.D scholar in computer science to guide and help me to complete my rese...scholar in computer science to guide and help me to complete my research and edit/proofreading thesis for my MS (Computer Science) degree. The topic is related to Stochastic **Automata** and Baum-Welch Algorithm. I want to complete this by 25th of July.
Thank You

I need someone who is very well proficient in **Automata** with CKY tables generating grammar and chomsky normal form (CNF) with JAVA coding to execute the project

I need someone who is very well proficient in **Automata** with CKY tables generating grammar and chomsky normal form (CNF) with JAVA coding to execute the project

I need someone who is very well proficient in **Automata** with CKY tables generating grammar and chomsky normal form (CNF) with JAVA coding to execute the project .

Need a expert who is proficient in **Automata** and generating CKY table , using grammar and lexicons , implementing it on any source like java, html or anything.

What I need to figure out are the cellular **automata** states, rules and transition function, the contaminate and bacteria need to move around (loop) the cells

You are required to complete 5 tasks about testing whether 2 given Deterministic Finite **Automata** are equivalent.
1) Complementation
2) Intersection
3) Symmetric difference
4) Non-Emptyness
5) Equivalence
Needs to be done in 2 days.

Required: Program in Java simulating finite **automata**. Including construction of NFA/ DFA, visualisation of NFA/DFA (graphically in a Java GUI), and verification of the NFA/ DFA. See attached image for complete project details, source code and examples required. Required ASAP.

Turing machines are a universal computing model, while there are other
interesting computing models there which are sub-Turing; e.g., pushdown
**automata**. Furthermore, modern computer science also studies computing
models that have a root in biology and chemistry; e.g., through molecular
reactions.
Here comes a model, where we have a multiset of

description of any programming language using some kind of formal grammar such as BNF, Finite **Automata**, or State Transition Diagrams (or some combination of all three), along with an informal description of some aspects of the new language.
Your language design document will include a statement of the considerations that led you to this design, as

Hello....
I need already developed code for Learning **Automata** (LA) and Reinforcement Learning (RL) strategies.
Problem is to learn the best direction for the disk using the Tsetlin, Krinsky, Krylov and LRI schemes.
Any programming language is acceptable (Python, C++, C# etc).
More details on PM
Please, state that you ALREADY HAVE CODE for

Design a Non-deterministic Finite **Automata** (NFA) for identifiers (e.g. names of variables or functions) of a common programming language. Convert the NFA to an appropriate DFA. Consequently, generate the related regular expressions. Specify the chosen language and justify any assumptions made.
For Further Details Download docx File...

Detin un director web pentru companii (plugin comercial instalat pe Wordpress) si am nevoie ca noul utilizator sa isi poata adauga compania introducand CUI-ul firmei. Astfel, se vor completa automat alte 3 campuri (Denumire firma, Nr Reg Com, Oras/Judet). Celelalte campuri din pagina de inregistrare vor fi adaugate manual. I have a webdirectory built on Wordpress which need one modification: I ...

Theory of computation is the branch that deals with how efficiently problems can be solved on a model of computation, using an algorithm. **Automata** theory and language is required in order to do this project.

The objective of the project:
(1) Develop 3d maps for small patches using cellular **automata**
(2) Apply self-learning algorithm for navigation using deep q learning algorithm

The objective of the project:
(1) Develop 3d maps for small patches using cellular **automata**
(2) Apply self-learning algorithm for navigation using deep q learning algorithm

...URL,ISBN) convert them to DFA and write a program to tokenize the words with regard to your regular expressions (4 Marks)
we should convert them to deterministic finite **automata** (DFA) then implement the DFA table then all of task number 1 should be in one code program we can but "or" between all of them
2- Write at least five useful context-free

Require someone with very good knowledge in state **automata**, as well as interpreting Java code.

Require someone with solid knowledge on Java / state merging **automata** to assist me on some concepts.

Looking for a strong Data Scientist person who has a strong knowledge in python Machine learning language. AND Theory of computation **AUTOMATA**.