<--- 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

Finite automata / DFA minimization / Deterministic automaton / Finite-state machine / Theoretical computer science / Muller automaton / Bchi automaton

Unbounded Model-Checking with Interpolation for Regular Language Constraints Graeme Gange, Jorge A. Navas, Peter J. Stuckey, Harald Søndergaard, and Peter Schachte The University of Melbourne {ggange,jnavas,pjs,harald,s

DocID: 1xVMq - View Document

UniALT for regular language contrained shortest paths on a multi-modal transportation network Dominik Kirchler1,2,3 , Leo Liberti1 , Thomas Pajor4 , and Roberto Wolfler Calvo2 1 2

DocID: 1vlJf - View Document

Stricken language would be deleted from and underlined language would be added to present law. Act 982 of the Regular Session As Engrossed: 1

DocID: 1uQRc - View Document

Stricken language would be deleted from and underlined language would be added to present law. Act 91 of the Regular Session 1 State of Arkansas

DocID: 1uHsS - View Document

Amendment to the By-laws of the Society for Invertebrate Pathology adopted at the regular business meeting of the Society in Halifax, Nova Scotia Canada on August 11, The following supersedes the original language

DocID: 1uEVl - View Document