Filtrer

Mes recherches récentes
Filtrer par :
Budget
à
à
à
Compétences
Langues
    État du travail
    154 nfa travaux trouvés au tarif de EUR

    problems on TM,DFA,NFA,decidabaility etc?

    €19 / hr (Avg Bid)
    €19 / hr Offre moyenne
    6 offres
    GoLang programming work S'est terminé left

    Hey, I need help with a GoLang work It is related to NFA and concurrency

    €17 (Avg Bid)
    €17 Offre moyenne
    1 offres
    NFA to DFA conversion S'est terminé left

    According to the input string , the program must show the transition table and NFA and DFA diagram.

    €20 (Avg Bid)
    €20 Offre moyenne
    4 offres
    Finite Automata Simulation S'est terminé left

    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.

    €148 (Avg Bid)
    €148 Offre moyenne
    8 offres
    NFA to DFA S'est terminé left

    Write a Java program to convert any given NFA to an equivalent DFA. NFA files is shown in the following example: 3 a b c d 0: {0} {0,1} {} {} {1,2,0} 1: {} {1} {1} {1} {1} 2: {} {1,2} {1} {1} {2} 0 {1,2} • The first line contains the number of states of the NFA; in this case, there are 3 states. • The second line contains Σ = {a, b, c, d}

    €107 (Avg Bid)
    €107 Offre moyenne
    20 offres
    Computing Theory S'est terminé left

    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...

    €29 (Avg Bid)
    €29 Offre moyenne
    7 offres

    Do interviews to NFA for some questions

    €1269 (Avg Bid)
    €1269 Offre moyenne
    2 offres

    generate NFA and DFA and bottom up parser the description is below in the file

    €122 (Avg Bid)
    €122 Offre moyenne
    2 offres

    I need an java developer who can code the NFA,DFA,or regular [se connecter pour voir l'URL] check the file .

    €24 (Avg Bid)
    €24 Offre moyenne
    7 offres

    ...description of the project is : a- Develop a programs to do the following tasks: 1- Building an NFA from a given regular expression. 2- Converting a giving NFA into a DFA. 3- Building a DFA from a given regular expression directly without going through an NFA. b- For the following grammar write a program that uses the LR(1) method to decide whether

    €94 (Avg Bid)
    €94 Offre moyenne
    8 offres
    java nfa to dfa S'est terminé left

    Develop Java or C++ programs to do the following tasks: 1- Building an NFA from a given regular expression. 2- Converting a giving NFA into a DFA. 3- Building a DFA from a given regular expression directly without going through an NFA. (8 marks) b- For the following grammar write a Java or C++ program that uses the LR(1) method to decide whether

    €46 (Avg Bid)
    €46 Offre moyenne
    4 offres

    Develop Java or C++ programs to do the following tasks: 1- Building an NFA from a given regular expression. 2- Converting a giving NFA into a DFA. 3- Building a DFA from a given regular expression directly without going through an NFA. (8 marks) b- For the following grammar write a Java or C++ program that uses the LR(1) method to decide whether

    €104 (Avg Bid)
    €104 Offre moyenne
    11 offres

    Urgent Person required either from Pakistan or from India only You should be able to do 1) Regular Expression to NFA 2) NFA to DFA you can use open source i don't have issue with that but i need proper working code with proper output. need it today only. Language is c++ Don't bid outside budget

    €10 (Avg Bid)
    €10 Offre moyenne
    2 offres

    Urgent Person required either from Pakistan or from India only You should be able to do 1) Regular Expression to NFA 2) NFA to DFA you can use open source i don't have issue with that but i need proper working code with proper output. need it today only. Language is c++ Don't bid outside budget

    €17 (Avg Bid)
    €17 Offre moyenne
    2 offres

    ...introduced in the class. These are Hopcroft, Brzozowski, and Huffman algorithms. You can pick any one of these. You may use any programming language. Requirements:  Read NFA from a file (e.g. a sample file format is given below)  Convert it to DFA through subset reconstruction  Implement one of the state minimization algorithms  Use that algorithm

    €69 (Avg Bid)
    €69 Offre moyenne
    1 offres
    Regular expression S'est terminé left

    a- Develop a C++ programs to do the following tasks: 1- Building an NFA from a given regular expression. 2- Converting a giving NFA into a DFA. 3- Building a DFA from a given regular expression directly without going through an NFA. b- For the following grammar write a C++ program that uses the LR(1) method to decide whether a given string can

    €42 (Avg Bid)
    €42 Offre moyenne
    6 offres
    Grammar to nfa S'est terminé left

    It's a compiler problem I want to write a grammar and run it in some website

    €9 - €26
    €9 - €26
    0 offres
    Project for Wenguo H. S'est terminé left

    Hi Wenguo H., I noticed your profile and would like to offer you in project. c++ program to convert NFA to DFA answer him before. there is more just one feature We can discuss any details over chat.

    €22 - €22
    €22 - €22
    0 offres

    Develop C++ programs to do the following tasks: 1- Building an NFA from a given regular expression. 2- Converting a giving NFA into a DFA. 3- Building a DFA from a given regular expression directly without going through an NFA.

    €148 (Avg Bid)
    €148 Offre moyenne
    5 offres

    developing C++ program to do the following tasks: 1- Building an NFA from a given regular expression. 2- Converting a giving NFA into an equivalent minimized DFA. 3- Building a DFA for a given regular expression directly without going through an NFA. 4- Implementing the LL(1) algorithm for a given context free grammar. also i want

    €17 / hr (Avg Bid)
    €17 / hr Offre moyenne
    5 offres

    a-Develop Java or C++ programs to do the following tasks: 1- Building an NFA from a given regular expression. 2- Converting a giving NFA into a DFA. 3- Building a DFA from a given regular expression directly without going through an NFA. b- For the following grammar write a Java or C++ program that uses the LR(1) method to decide whether a

    €42 (Avg Bid)
    €42 Offre moyenne
    6 offres

    a-Develop Java or C++ programs to do the following tasks: 1- Building an NFA from a given regular expression. 2- Converting a giving NFA into a DFA. 3- Building a DFA from a given regular expression directly without going through an NFA. b- For the following grammar write a Java or C++ program that uses the LR(1) method to decide whether a

    €54 (Avg Bid)
    €54 Offre moyenne
    5 offres

    I need you to develop some software for me. I would like this software to be developed for Windows using C or C++.

    €88 (Avg Bid)
    €88 Offre moyenne
    11 offres
    Compiler code S'est terminé left

    Develop C++ programs to do the following tasks: 1- Building an NFA from a given regular expression. 2- Converting a giving NFA into a DFA. 3- Building a DFA from a given regular expression directly without going through an NFA. The code should be provided by clear explanation. Also, I will need a call session to explain the code .in one or tow days

    €64 (Avg Bid)
    €64 Offre moyenne
    8 offres
    Project for Anas A. S'est terminé left

    Develop C++ programs to do the following tasks: 1- Building an NFA from a given regular expression. 2- Converting a giving NFA into a DFA. 3- Building a DFA from a given regular expression directly without going through an NFA. The code should be provided by clear explanation. Also, I will need a call session to explain the code . Thanks

    €52 (Avg Bid)
    €52 Offre moyenne
    1 offres

    Develop C++ programs to do the following tasks: 1- Building an NFA from a given regular expression. 2- Converting a giving NFA into a DFA. 3- Building a DFA from a given regular expression directly without going through an NFA.

    €109 (Avg Bid)
    €109 Offre moyenne
    13 offres
    NFA and DFA (C++) S'est terminé left

    1-converting a giving NFA into a DFA 2- Building a DFA from a given regular expression direct without going through an NFA (code C++ ) and Comment in the code

    €114 (Avg Bid)
    €114 Offre moyenne
    10 offres

    Develop C++ programs to do the following tasks: 1- Building an NFA from a given regular expression. 2- Converting a giving NFA into a DFA. 3- Building a DFA from a given regular expression directly without going through an NFA. The code should be provided by clear explanation. Also, I will need a call session to explain the code . Thanks

    €43 (Avg Bid)
    €43 Offre moyenne
    7 offres
    Compiler Java programs S'est terminé left

    I need you to develop some software for me. I would like this software to be developed for Mac using Java. Building NFA from given regular exprission , converting NFA into DFA , Building DFA from given regular exprission without NFA , use the LR1 method decide whether a given string can be derived in the grammer . If the sentance is derivable , your

    €20 (Avg Bid)
    €20 Offre moyenne
    6 offres

    developing C++ program to do the following tasks: 1- Building an NFA from a given regular expression. 2- Converting a giving NFA into DFA. 3- Building a DFA for a given regular expression directly without going through an NFA..

    €25 (Avg Bid)
    €25 Offre moyenne
    5 offres

    developing C++ program to do the following tasks: 1- Building an NFA from a given regular expression. 2- Converting a giving NFA into an equivalent minimized DFA. 3- Building a DFA for a given regular expression directly without going through an NFA..

    €23 (Avg Bid)
    €23 Offre moyenne
    9 offres
    Compilers project S'est terminé left

    1-Building an NFA from a given regular expression. 2- Converting a giving NFA into a DFA. 3- Building a DFA from a given regular expression directly without going through an NFA. and rest is on the file .

    €28 / hr (Avg Bid)
    €28 / hr Offre moyenne
    5 offres

    developing C++ program to do the following tasks: 1- Building an NFA from a given regular expression. 2- Converting a giving NFA into an equivalent minimized DFA. 3- Building a DFA for a given regular expression directly without going through an NFA. 4- Implementing the LL(1) algorithm for a given context free grammar. also i want

    €30 (Avg Bid)
    €30 Offre moyenne
    7 offres
    Theory of computation.. S'est terminé left

    Looking for someone who knows DFA NFA automata.

    €125 (Avg Bid)
    €125 Offre moyenne
    12 offres
    DFA and NFA knowledge S'est terminé left

    looking for someone who has a knowledge in theory of computation. DFA NFA

    €76 (Avg Bid)
    €76 Offre moyenne
    1 offres
    Theory of Computation. S'est terminé left

    I am looking for a person who has strong knowledge in theory of computation like DFA NFA. Should know machine learning language

    €78 (Avg Bid)
    €78 Offre moyenne
    3 offres
    Theory Computer Science S'est terminé left

    Person should know deep knowledge of theory of computation. should know DFA AND NFA.

    €108 (Avg Bid)
    €108 Offre moyenne
    16 offres
    Theory of Computation S'est terminé left

    Looking for someone who has strong knowledge in theory of computation DFA, NFA.

    €35 (Avg Bid)
    €35 Offre moyenne
    6 offres

    If you are professional in computer science please let me know. This is more about regular languages and related to nfa ,Dfa Turing machine Decidability. So these are all related to regular expressions

    €38 (Avg Bid)
    €38 Offre moyenne
    10 offres
    Automaton NFA & convert S'est terminé left

    I have the automaton dfa and I need some modifications and the creation of the nfa and that can be converted from day to dfa

    €97 (Avg Bid)
    €97 Offre moyenne
    6 offres

    Write a program which accepts a regular expression as input and outputs a transition table for a NFA which recognizes it. Example: ./reg_ex_to_NFA "(ab)* + ba" T | a | b | ^ 0 | N | 1 | 2 1 | 3 | N | N 2 | 4 | N | 3 3 | N | N | N 4 | N | 2 | N Submit the following: -Your source code -A [se connecter pour voir l'URL] which contains compilation and execution instructions

    €17 (Avg Bid)
    €17 Offre moyenne
    1 offres

    Write a program which accepts a regular expression as input and outputs a transition table for a NFA which recognizes it. Example: ./reg_ex_to_NFA "(ab)* + ba" T | a | b | ^ 0 | N | 1 | 2 1 | 3 | N | N 2 | 4 | N | 3 3 | N | N | N 4 | N | 2 | N Submit the following: -Your source code -A [se connecter pour voir l'URL] which contains compilation and execution instructions

    €35 (Avg Bid)
    €35 Offre moyenne
    2 offres

    I need a freelancer to help with converting an Regular Expression RE to a NFA, and then the NFA to a DFA and then to a minimal DFA

    €22 (Avg Bid)
    €22 Offre moyenne
    3 offres
    Automata Simulator S'est terminé left

    I want to create an automata simulator that is able to convert [se connecter pour voir l'URL] Expression to NFA 2. NFA to DFA 3. Visualise PDA 4. Minimization of DFA

    €25 (Avg Bid)
    €25 Offre moyenne
    3 offres
    Write some Software S'est terminé left

    ...Nfr*Pr Vtc = Vuc + Ncr*Pr Vta = Vua + Nar*Pr Donde: Censo = Miembros del grupo en total, incluyendo a los administradores. Na = Número de administradores en el grupo. Nfa = Número de votos a favor emitidos por los administradores. Nca = Número de votos en contra emitidos por los administradores. Naa = Número de votos de abstención emitidos

    PHP
    €10 / hr (Avg Bid)
    €10 / hr Offre moyenne
    18 offres
    conversion of nfa to dfa S'est terminé left

    need a c or c++ program to convert nfa to dfa.

    €336 (Avg Bid)
    €336 Offre moyenne
    18 offres
    conversion of nfa to dfa S'est terminé left

    need a c or c++ program to convert nfa to dfa.

    €391 (Avg Bid)
    €391 Offre moyenne
    22 offres
    Theory of Computation S'est terminé left

    A...Language. Regular languages. Finite automata and the class of languages they define. Closure properties of regular languages. Multiple-characterization of regular languages (DFAs, NFA, regular expressions). The pumping lemma for regular languages. Context-free languages. Grammars and pushdown automata. Normal forms. The pumping lemma for CFLs.

    €104 (Avg Bid)
    €104 Offre moyenne
    4 offres