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

First Page		Document Content
Date: 2012-07-04 18:28:36 Formal languages Mathematical analysis Mathematics Theoretical computer science Symbol Omega language Constructible universe Regular language Star height Linear temporal logic Differential forms on a Riemann surface		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 Add to Reading List Source URL: www.qiqiyan.com.s3-website-us-east-1.amazonaws.com Download Document from Source Website File Size: 169,59 KB Share Document on Facebook

	Theoretical Computer Science–40 www.elsevier.com/locate/tcs Presorting algorithms: An average-case point of view DocID: 1xVR3 - View Document
	Theoretical Computer Science – 551 www.elsevier.com/locate/tcs On the computational strength of pure ambient calculi夡 Sergio Maffeis, Iain Phillips∗ DocID: 1xUAX - View Document
	Theoretical Computer Science–24 Contents lists available at ScienceDirect Theoretical Computer Science www.elsevier.com/locate/tcs DocID: 1xUr4 - View Document
	Advanced Topics in SAT-Solving Part II: Theoretical Aspects Carsten Sinz Wilhelm-Schickard-Institut for Computer Science University of T¨ubingen DocID: 1xTuz - View Document
	CS 153 Current Topics in Theoretical Computer Science Spring 2016 DocID: 1vryF - View Document