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

	National School SIDRA 2017: Formal Methods for the Control of Large-scale Networked Nonlinear Systems with Logic Specifications Lecture L4: Regular languages? DocID: 1v5XV - View Document
	CSCI 3130: Formal Languages and Automata Theory The Chinese University of Hong Kong, Fall 2010 Lecture 15 Andrej Bogdanov DocID: 1uDy7 - View Document
	Parsing Expression Grammar as a Primitive Recursive-Descent Parser with Backtracking∗ Roman R. Redziejowski Abstract Two recent developments in the field of formal languages are Parsing Expression Grammar (PEG) DocID: 1tWkC - View Document
	Formal Verification of Code Generators for Modeling Languages (Invited Talk) Xavier Leroy Inria, Paris, France DocID: 1tNbI - View Document
	A Case for Combining Industrial Pragmatics with Formal Methods Eric L. McCorkle I. BACKGROUND A. Dependent Types Dependently-typed languages [9] possess a type system with DocID: 1tbAh - View Document