Theoretical Computer Science–24 Contents lists available at ScienceDirect Theoretical Computer Science www.elsevier.com locate tcs - Alachua conservation trust - Document - PDFSEARCH.IO

First Page		Document Content
Date: 2018-10-25 12:43:22 Formal languages Mathematics Language Combinatorics Context-free language Regular language Context-free grammar Kleene star Regular expression Omega-regular language Complementation of Bchi automaton		Theoretical Computer Science–24 Contents lists available at ScienceDirect Theoretical Computer Science www.elsevier.com/locate/tcs Add to Reading List Source URL: jorgenavas.github.io Download Document from Source Website File Size: 746,31 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
	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
	Languages vs. ω-Languages in Regular Infinite Games Namit Chaturvedi? , Jörg Olschewski?? , and Wolfgang Thomas Lehrstuhl Informatik 7, RWTH Aachen University, Germany {chaturvedi,olschewski,thomas}@automata.rwth-aache DocID: 1972x - View Document