Last update: Wed Sep 26 02:11:46 MDT 2018
@Article{Beauquier:1994:RTA, author = "Dani{\`e}le Beauquier and Andreas Podelski", title = "{Rabin} tree automata and finite monoids", journal = j-THEOR-COMP-SCI, volume = "134", number = "1", pages = "13--25", day = "07", month = nov, year = "1994", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Mon Jul 19 22:18:31 MDT 1999", bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1994&volume=134&issue=1; http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", URL = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1994&volume=134&issue=1&aid=1643", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C4220 (Automata theory)", conflocation = "Kyoto, Japan; 25-28 Aug. 1992", conftitle = "Second International Colloquium on Words, Languages and Combinatorics", corpsource = "LITP, Inst. Blaise Pascal, Paris, France", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "automata theory; finite monoids; finite trees; formal languages; formal logic; Rabin tree automata; theory of recognizability; theory of varieties; tree languages", pubcountry = "Netherlands", sponsororg = "Kyoto Sangyo Univ", treatment = "T Theoretical or Mathematical", }