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
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
95
Voted
WIA
2004
Springer
90
views
Artificial Intelligence
»
more
WIA 2004
»
Minimalizations of NFA Using the Universal Automaton
15 years 8 months ago
Download
www.math.muni.cz
Libor Polák
Real-time Traffic
Artificial Intelligence
|
WIA 2004
|
claim paper
Related Content
»
Inductive bases and their application to searches for minimal unary NFAs
»
Undecidability of Universality for Timed Automata with Minimal Resources
more »
Post Info
More Details (n/a)
Added
03 Jul 2010
Updated
03 Jul 2010
Type
Conference
Year
2004
Where
WIA
Authors
Libor Polák
Comments
(0)
Researcher Info
Artificial Intelligence Study Group
Computer Vision