Tree Automata over Inﬁnite Alphabets Michael Kaminski and Tony Tan Department of Computer Science, Technion – Israel Institute of Technology, Haifa 32000, Israel {kaminski,tantony Dedicated to Bori - Ω-logic - Document - PDFSEARCH.IO

First Page	Meta Content
	Tree Automata over Inﬁnite Alphabets Michael Kaminski and Tony Tan Department of Computer Science, Technion – Israel Institute of Technology, Haifa 32000, Israel {kaminski,tantony}@cs.technion.ac.il Dedicated to Bori Add to Reading List Document Date: 2013-09-27 07:35:34 Open Document File Size: 773,68 KB Share Result on Facebook / Facility DTD factory / Israel Institute of Technology / / IndustryTerm name pencil product / name notebook product / / Organization Tony Tan Department of Computer Science / Technion / Israel Institute of Technology / / Person Boris (Boaz) Trakhtenbrot / Tony Tan / Michael Kaminski / / ProgrammingLanguage XML / / Technology HTML / DTD / XML / Extensible Markup Language / dom / / SocialTag Tree automaton Regular language Logic Ω-automaton Automata theory Symbol Model theory

Tree Automata over Inﬁnite Alphabets Michael Kaminski and Tony Tan Department of Computer Science, Technion – Israel Institute of Technology, Haifa 32000, Israel {kaminski,tantony}@cs.technion.ac.il Dedicated to BoriAdd to Reading List