Last update: Wed Sep 26 02:11:46 MDT 2018
@Article{Salomaa:1994:STA, author = "Kai Salomaa", title = "Synchronized tree automata", journal = j-THEOR-COMP-SCI, volume = "127", number = "1", pages = "25--51", day = "09", month = may, year = "1994", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Mon Jul 19 22:18:06 MDT 1999", bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1994&volume=127&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=127&issue=1&aid=1437", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C4220 (Automata theory)", corpsource = "Dept. of Math., Turku Univ., Finland", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "automata theory; closure properties; context-free languages; context-free tree languages; decision problems; deterministic equality-synchronized automata; independent subtrees; synchronized tree automata; tree languages; trees (mathematics)", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", }