On Deciding Topological Classes of Deterministic Tree Languages Filip Murlak ?

First Page		Document Content
Date: 2008-12-09 11:42:04 Tree automaton Omega language Regular language Deterministic automaton Ω-automaton Büchi automaton Automata theory Theoretical computer science Computer science		On Deciding Topological Classes of Deterministic Tree Languages Filip Murlak ? Add to Reading List Source URL: www.mimuw.edu.pl Download Document from Source Website File Size: 196,02 KB Share Document on Facebook

	A Sharp Existence Theorem for Vortices in the Theory of Branes1 Xiaosen Han2 arXiv:1110.1423v2 [math-ph] 18 JunInstitute of Contemporary Mathematics DocID: 1gwxM - View Document
	Alternating Automata Semantic Constructions for the Bounded Model Checking of Regular Linear Temporal Logic (Extended Version) Juli´an Samborski-Forlese IMDEA Software Institute, Madrid, Spain Email: DocID: 1g1mb - View Document
	How to Efficiently Translate Extensions of Temporal Logics into Alternating Automata C´esar S´ anchez1,2 and Julian Samborski-Forlese1 1 DocID: 1fGRo - View Document
	BRICS Basic Research in Computer Science ´ BRICS RSEsik & Ito: Temporal Logic with Cyclic Counting DocID: 1aONx - View Document
	¨ Profile Trees for Buchi Word Automata, with Application to Determinization Seth Fogarty DocID: 1aJuC - View Document