Deciding the weak definability of Büchi definable tree languages∗ Thomas Colcombet1 , Denis Kuperberg2 , Christof Löding3 , and Michael Vanden Boom4 1,2 CNRS and LIAFA, Université Paris Diderot Paris, France - Alternating finite automaton - Document - PDFSEARCH.IO

First Page	Meta Content
	Deciding the weak definability of Büchi definable tree languages∗ Thomas Colcombet1 , Denis Kuperberg2 , Christof Löding3 , and Michael Vanden Boom4 1,2 CNRS and LIAFA, Université Paris Diderot Paris, France Add to Reading List Document Date: 2013-08-07 05:31:08 Open Document File Size: 530,01 KB Share Result on Facebook Company Creative Commons / Dagstuhl Publishing / Billy / / Country Germany / / / Facility RWTH Aachen University / University of Oxford Oxford / / Organization University of Oxford Oxford / European Union / RWTH Aachen University Aachen / Department of Computer Science / / Person Adam / Eve / Rabin / Ai / Bill Editors / Michael Vanden / / Position Editor / / Technology Adam / Digital Object Identifier / / SocialTag Ω-automaton Büchi automaton Tree automaton Star height Alternating finite automaton Muller automaton Automata theory Theoretical computer science Computer science

Deciding the weak definability of Büchi definable tree languages∗ Thomas Colcombet1 , Denis Kuperberg2 , Christof Löding3 , and Michael Vanden Boom4 1,2 CNRS and LIAFA, Université Paris Diderot Paris, FranceAdd to Reading List