<--- Back to Details
First PageDocument Content
Theory of computation / Computability theory / Formal languages / Recursion / ACM SIGACT / Symposium on Theory of Computing / Finite-state machine / Recursive language / Primitive recursive function / Applied mathematics / Theoretical computer science / Mathematics
Date: 2011-05-03 09:10:11
Theory of computation
Computability theory
Formal languages
Recursion
ACM SIGACT
Symposium on Theory of Computing
Finite-state machine
Recursive language
Primitive recursive function
Applied mathematics
Theoretical computer science
Mathematics

Add to Reading List

Source URL: fortnow.com

Download Document from Source Website

File Size: 135,00 KB

Share Document on Facebook

Similar Documents

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