Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

86

FSTTCS
2006
Springer

91views Software Engineering» more FSTTCS 2006»

Tree Automata Make Ordinal Theory Easy

15 years 6 months ago

Tree Automata Make Ordinal Theory Easy

Download www.liafa.jussieu.fr

Thierry Cachat

Real-time Traffic

FSTTCS 2006 | Software Engineering |

claim paper

Related Content

» Complexity Theory Made Easy

» Covering of ordinals

» A collection of tools for making automata theory and formal languages come alive

» Logics for Unranked Trees An Overview

» Representing Constraints with Automata

» The Implementation of Mazurkiewicz Traces in POEM

» Perfect trees and elementary embeddings

» Efficient Inference through Cascades of Weighted Tree Transducers

» Three Learnable Models for the Description of Language

Post Info
More Details (n/a)

Added	23 Aug 2010
Updated	23 Aug 2010
Type	Conference
Year	2006
Where	FSTTCS
Authors	Thierry Cachat

Comments (0)