Last update: Sun Oct 15 02:56:11 MDT 2017
@Article{Rystsov:1997:RWC, author = "Igor Rystsov", title = "Reset words for commutative and solvable automata", journal = j-THEOR-COMP-SCI, volume = "172", number = "1--2", pages = "273--279", day = "10", month = feb, year = "1997", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Mon Jul 19 22:20:35 MDT 1999", bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1997&volume=172&issue=1-2; http://www.math.utah.edu/pub/tex/bib/tcs1995.bib", URL = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1997&volume=172&issue=1-2&aid=2339", acknowledgement = ack-nhfb, classification = "C4220 (Automata theory)", corpsource = "Glushkov Inst. of Cybern., Kiev, Ukraine", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "commutative automata; finite automata; finite automaton; reset words; solvable automata", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", }