<--- Back to Details
First PageDocument Content
Formal languages / Finite automata / Combinatorics / Combinatorics on words / Mathematics / Discrete mathematics / Mealy machine / Alphabet / String / Finite-state transducer / Tree transducer
Date: 2016-07-15 23:00:36
Formal languages
Finite automata
Combinatorics
Combinatorics on words
Mathematics
Discrete mathematics
Mealy machine
Alphabet
String
Finite-state transducer
Tree transducer

Motivation Groundwork Distance-Tracking Automata

Add to Reading List

Source URL: www.cs.purdue.edu

Download Document from Source Website

File Size: 479,95 KB

Share Document on Facebook

Similar Documents

Workshop GK 334, April 2, 2003 Efficiency Improvement by Tree Transducer Composition Janis Voigtl¨ ander

DocID: 1sKhz - View Document

Finite automata / Formal languages / Regular language / Tree / Theoretical computer science / Mathematics / Finite-state transducer / Discrete mathematics / Orbifold

PDF Document

DocID: 1j4e8 - View Document

Models of computation / Mathematics / Computer science / Combinatorics on words / Finite state transducer / Tree automaton / Finite-state machine / Alphabet / Regular language / Automata theory / Formal languages / Theoretical computer science

The Logic in Computer Science Column by Yuri Gurevich Microsoft Research One Microsoft Way, Redmond WA 98052, USA

DocID: 18ga7 - View Document

Theoretical computer science / Mathematics / Formal languages / Finite state transducer / Finite-state machine / Tree automaton / Tree / Automata theory / Mathematical logic / Models of computation

Fast: a Transducer-Based Language for Tree Manipulation Loris D’Antoni University of Pennsylvania

DocID: 187Ea - View Document

Theoretical computer science / Mathematics / Formal languages / Finite state transducer / Finite-state machine / Tree automaton / Tree / Automata theory / Mathematical logic / Models of computation

Fast: a Transducer-Based Language for Tree Manipulation Loris D’Antoni University of Pennsylvania

DocID: 17EK6 - View Document