Showing 5 open source projects for "dfa nfa"

View related business solutions
  • Gemini 3 and 200+ AI Models on One Platform Icon
    Gemini 3 and 200+ AI Models on One Platform

    Access Google's best plus Claude, Llama, and Gemma. Fine-tune and deploy from one console.

    Build generative AI apps with Vertex AI. Switch between models without switching platforms.
    Start Free
  • Try Google Cloud Risk-Free With $300 in Credit Icon
    Try Google Cloud Risk-Free With $300 in Credit

    No hidden charges. No surprise bills. Cancel anytime.

    Use your credit across every product. Compute, storage, AI, analytics. When it runs out, 20+ products stay free. You only pay when you choose to.
    Start Free
  • 1
    AutoSim

    AutoSim

    A free automata simulator that simulates DFA/NFA/DPDA/NPDA/STM

    AutoSim is a free automata simulator for students and educators. Written in Java, it is a command-line based utility that runs on any OS that supports Java. With AutoSim, you can not only determine the final state or stack/tape contents, you can also trace through the execution states as well, from the initial to the final states. The latest version of AutoSim is 1.0, and it currently supports DFAs, NFAs, DPDAs, NPDAs, as well as Standard Turing Machines.
    Downloads: 8 This Week
    Last Update:
    See Project
  • 2
    Finite-Automata

    Finite-Automata

    convert finite automata

    This software can convert epsilon-NFA to NFA to DFA or NFA to DFA and minimization of DFA It works in the windows linux and mac.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 3
    visualFSA is a small tool which lets you construct NFAs/DFAs [(non)deterministic finite automata]. It offers some common algorithms which can be applied to that automatons, like converting NFA -> DFA, word problem, accepted language etc.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 4
    GUI application that can be used for generate graph representation for any given DFA or NFA table and check weather strings are accepted or rejected by finite automata.
    Downloads: 0 This Week
    Last Update:
    See Project
  • Our Free Plans just got better! | Auth0 Icon
    Our Free Plans just got better! | Auth0

    With up to 25k MAUs and unlimited Okta connections, our Free Plan lets you focus on what you do best—building great apps.

    You asked, we delivered! Auth0 is excited to expand our Free and Paid plans to include more options so you can focus on building, deploying, and scaling applications without having to worry about your security. Auth0 now, thank yourself later.
    Try free now
  • 5
    Finite automation,developed by java and it's open source.input the RE,can produce RG,NFA,DFA,MinDFA,Draw the corresponding transition diagram and show the details of transition.
    Downloads: 0 This Week
    Last Update:
    See Project
  • Previous
  • You're on page 1
  • Next
MongoDB Logo MongoDB