<--- Back to Details
First PageDocument Content
Theoretical computer science / Mathematics / Combinatorics on words / Models of computation / Finite state transducer / Finite-state machine / Regular expression / Regular language / String / Formal languages / Automata theory / Combinatorics
Date: 2014-10-13 10:13:47
Theoretical computer science
Mathematics
Combinatorics on words
Models of computation
Finite state transducer
Finite-state machine
Regular expression
Regular language
String
Formal languages
Automata theory
Combinatorics

Regular Functions Rajeev Alur University of Pennsylvania 1

Add to Reading List

Source URL: www.cis.upenn.edu

Download Document from Source Website

File Size: 373,01 KB

Share Document on Facebook

Similar Documents

Latent Domain Phrase-based Models for Adaptation Hoang Cuong and Khalil Sima’an Institute for Logic, Language and Computation University of Amsterdam Science Park 107, 1098 XG Amsterdam, The Netherlands {c.hoang,k.sima

DocID: 1uFJW - View Document

Grown-in Defects of InSb Crystals: Models and Computation N. Vaidya ∗, H. Huang †, and D. Liang ‡ Department of Mathematics & Statistics, York University Toronto, Canada M3J 1P3. August 22, 2005

DocID: 1u9va - View Document

NUMERICAL SOLUTION of MARKOV CHAINS, p. 1–22 Hypergraph-based Parallel Computation of Passage Time Densities in Large Semi-Markov Models ∗

DocID: 1u2vA - View Document

The Myriad simulator: parallel computation for densely integrated models Pedro Rittner , Andrew J. Davies, Thomas A. Cleland 1 Dept. of Psychology, Cornell University, Ithaca, NY Why another simulator?

DocID: 1tZVk - View Document

Aggregating Private Sparse Learning Models Using Multi-Party Computation Lu Tian, Bargav Jayaraman, Quanquan Gu, and David Evans University of Virginia https://oblivc.org/ppml

DocID: 1tvdd - View Document