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

	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
	Stanislaus County Fair 2016 RIDES & HEIGHT REQUIREMENTS IT IS ALWAYS UP TO THE RIDE OPERATOR TO DECIDE IF IT IS SAFE FOR YOU TO RIDE RIDE NAME ROCK STAR DocID: 1q3JC - View Document
	Regular Expressions and Finite-State Automata Overview DocID: 1oI8d - View Document
	Tackling the Generalized Star-Height Problem Tom Bourne School of Mathematics and Statistics University of St Andrews NBSAN, St Andrews DocID: 1ob83 - View Document
	The Generalised Star-Height Problem Combinatorics on Words Connections to the Algebraic Approach Semigroups, Subwords and Star-Height Tom Bourne DocID: 1nWHp - View Document