Tree Automata over Infinite Alphabets

13 years 6 months ago

Download www.cs.technion.ac.il

A number of models of computation on trees labeled with symbols from an infinite alphabet is considered. We study closure and decision properties of each of the models and compare their computation power.

Michael Kaminski, Tony Tan

Real-time Traffic

Applied Computing | BIRTHDAY 2008 | Computation | Infinite Alphabet |

claim paper

» Variable Automata over Infinite Alphabets

» A Note on Twopebble Automata Over Infinite Alphabets

» Optimal Lower Bounds on Regular Expression Size Using Communication Complexity

» ForwardXPath and extended register automata on datatrees

» On the Satisfiability of TwoVariable Logic over Data Words

» Constraint Automata and the Complexity of Recursive Subtype Entailment

» Deciding inclusion of set constants over infinite nonstrict data structures

» Factorization forests for infinite words and applications to countable scattered linear or...

Post Info
More Details (n/a)

Added	12 Oct 2010
Updated	12 Oct 2010
Type	Conference
Year	2008
Where	BIRTHDAY
Authors	Michael Kaminski, Tony Tan

Comments (0)

Sciweavers

Tree Automata over Infinite Alphabets

Applied Computing | BIRTHDAY 2008 | Computation | Infinite Alphabet |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers