RE2NDEA

Regular Expressions into Non-Deterministic Automata

Brought to you by: kleindevel

Add a Review

Downloads: 0 This Week

Last Update: 2015-06-10

Download

Get an email when there's a new version of RE2NDEA

re2ndea (written in C)

This small program was written as a part of the "Automata theory" course.

It converts regular expressions into non-deterministic automata.

Project Samples

Project Activity

See All Activity >

Follow RE2NDEA

RE2NDEA Web Site

Other Useful Business Software

Build Agents and Models on One Platform

Everything you need to build production-ready agents and models. Access 200+ Google and third-party AI models and tools.

Gemini Enterprise Agent Platform is Google Cloud's comprehensive platform for developers to build, scale, govern, and optimize agents and models. Choose from Google's most advanced models and third-party models like Anthropic's Claude Model Family.

Try It Free

Rate This Project

User Reviews

Be the first to post a review of RE2NDEA!

Additional Project Details

Registered

2015-06-10

Report inappropriate content

Build Agents and Models on One Platform

Everything you need to build production-ready agents and models. Access 200+ Google and third-party AI models and tools.

Try It Free

Recommended Projects

Golly
For exploring cellular automata like Conway's Game of Life.
GenReg
Generation of regular graphs
Triple-A
Triple-A (Automatic Analysis with Automata) is a full-featured library for (finite) automata written in Java with two powerful analysis tools (dealing with LTL model checking and Presburger arithmetics) and a graphical user interface built around it.
Cyber
Semantic non-deterministic Superintelligence consensus computer
LTL3BA
Translator of LTL formulae to Büchi automata based on LTL2BA