Back to Results
First PageMeta Content
Applied mathematics / Automata theory / EXPSPACE / Regular language / Regular expression / Model theory / PSPACE-complete / FO / Symbol / Theoretical computer science / Formal languages / Complexity classes


Parameterized Regular Expressions and Their Languages Pablo Barceló1 , Leonid Libkin2 , and Juan L. Reutter2 1 2
Add to Reading List

Document Date: 2011-09-27 14:42:30

Open Document

File Size: 338,61 KB

Share Result on Facebook

Company

Creative Commons / CNF / Dagstuhl Publishing / /

Country

Germany / /

/

Facility

University of Edinburgh libkin@inf.ed.ac.uk / building NFAs / /

IndustryTerm

trivial solution / data management applications / bruteforce algorithm / social networks / social network / semantic Web / naive algorithms / infinitestate systems / /

OperatingSystem

L3 / /

Organization

School of Informatics / Department of Computer Science / University of Edinburgh / Parameterized / /

Person

Leonid Libkin / Juan L. Reutter / Pablo Barceló / Juan Reutter / /

Position

Prime Minister / /

Product

Ultrasone DJ1 Headphone/Headset / /

Technology

same bruteforce algorithm / RDF / /

SocialTag