TATOWA

Brought to you by: yanos84

Last Update: 2022-05-14

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

TATOWA for tree automata to word automata is "D" package for tree automata minimization. Its principal is to transform a given tree automata to a word automata. The minimization of the later coincides with the minimization of the first one.

Project Activity

See All Activity >

Follow TATOWA

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

Start Free

Rate This Project

User Reviews

Be the first to post a review of TATOWA!

Additional Project Details

Registered

2016-06-07

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.

Start Free

Recommended Projects

jFTools
Tools for finite automata simulation, minimization and grammar utilities (left recursion removal, context free grammar simplification and transformation to Chomsky Normal Form).
Finite Automata
A package for computations with finite automata (rooted tree automorphisms) for the GAP system, http://www.gap-system.org.
Automata editor
automata editor
CART
Reversible cellular automata
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.