Back to Results
First PageMeta Content
Applied mathematics / Computer science / Regular language / Symbol / Alphabet / Ω-automaton / Formal languages / Automata theory / Mathematics


Regular Expressions for Languages over Infinite Alphabets (Extended abstract) Michael Kaminski1 and Tony Tan2 1
Add to Reading List

Document Date: 2013-09-27 07:35:34


Open Document

File Size: 194,05 KB

Share Result on Facebook

City

Los Alamitis / Berlin / Haifa / /

Company

Prentice-Hall Inc. / IEEE Computer Society Press / /

Country

Singapore / Israel / United States / /

/

Facility

National University of Singapore / Aachen University of Technology / Israel Institute of Technology / /

IndustryTerm

internet-oriented interpretation / communication network / /

Organization

Aachen University of Technology / School of Computing / Israel Institute of Technology / National University of Singapore / Department of Computer Science / Technion / /

Person

J. Van den Bussch / J. Paredaens / J. Hidders / M. Bielecki / J. Tyszkiewicz / /

/

Product

Latte W10 Portable Audio Device / /

ProgrammingLanguage

XML / /

ProvinceOrState

California / /

PublishedMedium

Lecture Notes in Computer Science / /

Technology

XML / /

SocialTag