Sciweavers

WIA   1998 International Workshop on Implementing Automata
Wall of Fame | Most Viewed WIA-1998 Paper
WIA
1998
Springer
13 years 8 months ago
Minimal Cover-Automata for Finite Languages
A cover-automaton A of a finite language L is a finite automaton that accepts all words in L and possibly other words that are longer than any word in L. A minimal deterministic co...
Cezar Câmpeanu, Nicolae Santean, Sheng Yu
Disclaimer and Copyright Notice
Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.
IdReadViewsTitleStatus
1Download preprint from source125
2Download preprint from source110