<--- Back to Details
First PageDocument Content
Pumping lemma for regular languages / Regular language / Constructible universe / John Myhill / Presentation of a group / Anil Nerode / Formal languages / Mathematics / Myhill–Nerode theorem
Date: 2010-02-03 14:40:55
Pumping lemma for regular languages
Regular language
Constructible universe
John Myhill
Presentation of a group
Anil Nerode
Formal languages
Mathematics
Myhill–Nerode theorem

Add to Reading List

Source URL: www.cse.buffalo.edu

Download Document from Source Website

File Size: 66,42 KB

Share Document on Facebook

Similar Documents

Computability theory / Models of computation / Logic in computer science / Lambda calculus / Function / Combinatory logic / Denotational semantics / Type theory / John Myhill / Mathematics / Theoretical computer science / Mathematical logic

A Stochastic l-Calculus Dana S. Scott University Professor, Emeritus, Carnegie Mellon University Visiting Scholar, UC Berkeley As a formal theory, the l-Calculus has equational rules for the explicit definition of functi

DocID: Sx8H - View Document

Pumping lemma for regular languages / Regular language / Constructible universe / John Myhill / Presentation of a group / Anil Nerode / Formal languages / Mathematics / Myhill–Nerode theorem

PDF Document

DocID: 1770 - View Document

American Sign Language / Computability theory / Association for Symbolic Logic / John Myhill / Nels David Nelson / Anil Nerode / Saul Kripke / Mereology / Logic / Mathematical logic / Philosophy

PDF Document

DocID: 15xt - View Document