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
PDF Tools
Image Tools
Text Tools
OCR Tools
Symbol and Emoji Tools
On-screen Keyboard
Latex Math Equation to Image
Smart IPA Phonetic Keyboard
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
11
search results - page 3 / 3
»
wia 2004
Sort
relevance
views
votes
recent
update
View
thumb
title
125
Voted
WIA
2009
Springer
260
views
Artificial Intelligence
»
more
WIA 2009
»
Short Regular Expressions from Finite Automata: Empirical Results
15 years 10 months ago
Download
www.informatik.uni-giessen.de
We continue our work [H. Gruber, M. Holzer: Provably shorter regular expressions from deterministic finite automata (extended ). In Proc. DLT, LNCS 5257, 2008] on the problem of ...
Hermann Gruber, Markus Holzer, Michael Tautschnig
claim paper
Read More »
« Prev
« First
page 3 / 3
Last »
Next »