Learning Regular Omega Languages Dana Angluin1? and Dana Fisman2?? 1 2

First Page		Document Content
Date: 2014-09-03 16:14:08 Finite automata Formal languages Theoretical computer science -automaton Omega language Regular language Muller automaton Constructible universe Symbol DFA minimization Mathematics Omega-regular language		Learning Regular Omega Languages Dana Angluin1? and Dana Fisman2?? 1 2 Add to Reading List Source URL: www.cis.upenn.edu Download Document from Source Website File Size: 362,19 KB Share Document on Facebook

	Classifying Regular Languages by a Split Game Qiqi Yan∗ BASICS Laboratory, Department of Computer Science and Engineering, Shanghai Jiao Tong University, 200240, Shanghai, P.R. China DocID: 1qHjy - View Document
	Learning Regular Omega Languages Dana Angluin1? and Dana Fisman2?? 1 2 DocID: 1ohPd - View Document
	PDF Document DocID: 1iI4O - View Document
	On the topological complexity of weakly recognizable tree languages Jacques Duparc1 and Filip Murlak2? 1 Universit´e de Lausanne, Switzerland DocID: 1guzu - View Document
	On Deciding Topological Classes of Deterministic Tree Languages Filip Murlak ? DocID: 1aAMh - View Document