Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
29
click to vote
COCOON
2004
Springer
favorite
Email
discuss
report
103
views
Combinatorics
»
more
COCOON 2004
»
Regular Expressions for Languages over Infinite Alphabets
14 years 4 months ago
Download
www.cs.technion.ac.il
In this paper we introduce a notion of a regular expression over infinite alphabets and show that a language is definable by an infinite alphabet regular expression if and only if it is accepted by finite-state unification based automaton
Michael Kaminski, Tony Tan
Real-time Traffic
Alphabet Regular Expression
|
COCOON 2004
|
Combinatorics
|
Infinite Alphabets
|
Regular Expression
|
claim paper
Post Info
More Details (n/a)
Added
20 Aug 2010
Updated
20 Aug 2010
Type
Conference
Year
2004
Where
COCOON
Authors
Michael Kaminski, Tony Tan
Comments
(0)
Researcher Info
Combinatorics Study Group
Computer Vision