LETHAL

Brought to you by: da1l6, irenethesing, mohrfrosch

Last Update: 2013-04-19

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

LETHAL is a Java library for working with finite tree and hedge automata. It provides a great variety of operations and property evaluations. Additionally the library comes with a scriptable graphical user interface to get started quickly.

Project Activity

See All Activity >

License

GNU General Public License version 3.0 (GPLv3)

Follow LETHAL

LETHAL Web Site

Other Useful Business Software

$300 Free Credits to Build on Google Cloud

New customers can spin up VMs, build with AI, and query data at no cost.

Put your $300 in credit toward real workloads, then keep building with free monthly usage for 20+ products. No commitment and no charge until you upgrade.

Rate This Project

User Reviews

Be the first to post a review of LETHAL!

Additional Project Details

Languages

English

Intended Audience

Science/Research

User Interface

Java Swing

Programming Language

Java

Registered

2009-10-30

Report inappropriate content

$300 Free Credits to Build on Google Cloud

New customers can spin up VMs, build with AI, and query data at no cost.

Put your $300 in credit toward real workloads, then keep building with free monthly usage for 20+ products. No commitment and no charge until you upgrade.

Recommended Projects

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.
Automata editor
automata editor
Finite Automata
A package for computations with finite automata (rooted tree automorphisms) for the GAP system, http://www.gap-system.org.
CodeConics
CodeConics is a C# lexer/parser/syntax tree generatior
visualFSA
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.