Show simple item record

Finite Semigroups, Feedback, and the Letichevsky Criteria for Non-Empty Words in Finite Automata

dc.contributor.authorDomosi, P.
dc.contributor.authorNehaniv, C.L.
dc.contributor.authorRhodes, J.L.
dc.date.accessioned2007-09-18T13:14:33Z
dc.date.available2007-09-18T13:14:33Z
dc.date.issued2003
dc.identifier.citationDomosi , P , Nehaniv , C L & Rhodes , J L 2003 , ' Finite Semigroups, Feedback, and the Letichevsky Criteria for Non-Empty Words in Finite Automata ' , Theoretical Computer Science , vol. 302 , no. 1-3 , pp. 295-317 .
dc.identifier.issn0304-3975
dc.identifier.otherdspace: 2299/632
dc.identifier.urihttp://hdl.handle.net/2299/632
dc.format.extent186628
dc.language.isoeng
dc.relation.ispartofTheoretical Computer Science
dc.subjectComputer Science
dc.titleFinite Semigroups, Feedback, and the Letichevsky Criteria for Non-Empty Words in Finite Automataen
dc.contributor.institutionSchool of Computer Science
dc.contributor.institutionScience & Technology Research Institute
dc.description.statusPeer reviewed
rioxxterms.typeJournal Article/Review
herts.preservation.rarelyaccessedtrue


Files in this item

Thumbnail
Name:
101991.pdf
Size:
182.2Kb
Format:
PDF
View/Open

This item appears in the following Collection(s)

Show simple item record