<--- Back to Details
First PageDocument Content
Models of computation / Applied mathematics / Computer science / Finite state transducer / Finite-state machine / Regular language / Formal grammar / Rewriting / FO / Formal languages / Theoretical computer science / Automata theory
Date: 2002-06-07 11:27:10
Models of computation
Applied mathematics
Computer science
Finite state transducer
Finite-state machine
Regular language
Formal grammar
Rewriting
FO
Formal languages
Theoretical computer science
Automata theory

Add to Reading List

Source URL: acl.ldc.upenn.edu

Download Document from Source Website

File Size: 3,25 MB

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