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
11
search results - page 1 / 3
»
wia 2004
Sort
relevance
views
votes
recent
update
View
thumb
title
25
click to vote
WIA
2004
Springer
89
views
Artificial Intelligence
»
more
WIA 2004
»
Myhill-Nerode Theorem for Sequential Transducers over Unique GCD-Monoids
14 years 3 months ago
Download
wwwtcs.inf.tu-dresden.de
Andreas Maletti
claim paper
Read More »
28
click to vote
WIA
2004
Springer
90
views
Artificial Intelligence
»
more
WIA 2004
»
Minimalizations of NFA Using the Universal Automaton
14 years 3 months ago
Download
www.math.muni.cz
Libor Polák
claim paper
Read More »
21
click to vote
WIA
2004
Springer
85
views
Artificial Intelligence
»
more
WIA 2004
»
Size Reduction of Multitape Automata
14 years 3 months ago
Download
www.cs.ioc.ee
Hellis Tamm, Matti Nykänen, Esko Ukkonen
claim paper
Read More »
25
click to vote
WIA
2004
Springer
95
views
Artificial Intelligence
»
more
WIA 2004
»
Enumerating Regular Expressions and Their Languages
14 years 3 months ago
Download
www.cs.uwaterloo.ca
Abstract. We discuss enumeration of regular expressions and the distinct languages they represent.
Jonathan Lee, Jeffrey Shallit
claim paper
Read More »
37
click to vote
WIA
2004
Springer
142
views
Artificial Intelligence
»
more
WIA 2004
»
On the Complexity of Hopcroft's State Minimization Algorithm
14 years 3 months ago
Download
www-igm.univ-mlv.fr
Abstract. Hopcroft’s algorithm for minimizing a deterministic automaton has complexity O(n log n). We show that this complexity bound is tight. More precisely, we provide a famil...
Jean Berstel, Olivier Carton
claim paper
Read More »
« Prev
« First
page 1 / 3
Last »
Next »