Beauquier, Danièle; Podelski, Andreas Rabin tree automata and finite monoids. (English) Zbl 0823.68064 Theor. Comput. Sci. 134, No. 1, 13-25 (1994). MSC: 68Q45 PDFBibTeX XMLCite \textit{D. Beauquier} and \textit{A. Podelski}, Theor. Comput. Sci. 134, No. 1, 13--25 (1994; Zbl 0823.68064) Full Text: DOI
Niehren, Joachim; Podelski, Andreas Feature automata and recognizable sets of feature trees. (English) Zbl 1497.68146 Gaudel, Marie-Claude (ed.) et al., TAPSOFT ’93: theory and practice of software development. 4th international joint conference CAAP/FASE, Orsay, France, April 13–17, 1993. Proceedings. Berlin: Springer-Verlag. Lect. Notes Comput. Sci. 668, 356-375 (1993). MSC: 68P05 08A70 68N15 68Q70 PDFBibTeX XMLCite \textit{J. Niehren} and \textit{A. Podelski}, Lect. Notes Comput. Sci. 668, 356--375 (1993; Zbl 1497.68146) Full Text: DOI
Péladeau, Pierre; Podelski, Andreas On reverse and general definite tree languages (extended abstract). (English) Zbl 1425.68225 Kuich, Werner (ed.), Automata, languages and programming. 19th international colloquium, Wien, Austria, July 13–17, 1992. Proceedings. Berlin: Springer-Verlag. Lect. Notes Comput. Sci. 623, 150-161 (1992). MSC: 68Q45 68Q70 PDFBibTeX XMLCite \textit{P. Péladeau} and \textit{A. Podelski}, Lect. Notes Comput. Sci. 623, 150--161 (1992; Zbl 1425.68225) Full Text: DOI