Nakanishi, Rindo; Takata, Yoshiaki; Seki, Hiroyuki Active learning for deterministic bottom-up nominal tree automata. (English) Zbl 07719841 Seidl, Helmut (ed.) et al., Theoretical aspects of computing – ICTAC 2022. 19th international colloquium, Tbilisi, Georgia, September 27–29, 2022. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13572, 342-359 (2022). MSC: 68Qxx PDFBibTeX XMLCite \textit{R. Nakanishi} et al., Lect. Notes Comput. Sci. 13572, 342--359 (2022; Zbl 07719841) Full Text: DOI arXiv
Senda, Ryoma; Takata, Yoshiaki; Seki, Hiroyuki Complexity results on register context-free grammars and related formalisms. (English) Zbl 07540233 Theor. Comput. Sci. 923, 99-125 (2022). MSC: 68Qxx PDFBibTeX XMLCite \textit{R. Senda} et al., Theor. Comput. Sci. 923, 99--125 (2022; Zbl 07540233) Full Text: DOI
Landwehr, Patrick; Löding, Christof Projection for Büchi tree automata with constraints between siblings. (English) Zbl 1477.68155 Int. J. Found. Comput. Sci. 31, No. 6, 749-775 (2020). Reviewer: Andreas Maletti (Leipzig) MSC: 68Q45 03D05 PDFBibTeX XMLCite \textit{P. Landwehr} and \textit{C. Löding}, Int. J. Found. Comput. Sci. 31, No. 6, 749--775 (2020; Zbl 1477.68155) Full Text: DOI
Landwehr, Patrick; Löding, Christof Tree automata with global constraints for infinite trees. (English) Zbl 07559156 Niedermeier, Rolf (ed.) et al., 36th international symposium on theoretical aspects of computer science, STACS 2019, March 13–16, 2019, Berlin, Germany. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 126, Article 47, 15 p. (2019). MSC: 68Qxx PDFBibTeX XMLCite \textit{P. Landwehr} and \textit{C. Löding}, LIPIcs -- Leibniz Int. Proc. Inform. 126, Article 47, 15 p. (2019; Zbl 07559156) Full Text: DOI
Libkin, Leonid; Tan, Tony; Vrgoč, Domagoj Regular expressions for data words. (English) Zbl 1320.68113 J. Comput. Syst. Sci. 81, No. 7, 1278-1297 (2015). MSC: 68Q45 PDFBibTeX XMLCite \textit{L. Libkin} et al., J. Comput. Syst. Sci. 81, No. 7, 1278--1297 (2015; Zbl 1320.68113) Full Text: DOI
Veanes, Margus; Bjørner, Nikolaj Symbolic tree automata. (English) Zbl 1317.68103 Inf. Process. Lett. 115, No. 3, 418-424 (2015). MSC: 68Q45 PDFBibTeX XMLCite \textit{M. Veanes} and \textit{N. Bjørner}, Inf. Process. Lett. 115, No. 3, 418--424 (2015; Zbl 1317.68103) Full Text: DOI
Fülöp, Zoltán; Vogler, Heiko Forward and backward application of symbolic tree transducers. (English) Zbl 1307.68047 Acta Inf. 51, No. 5, 297-325 (2014). Reviewer: Andreas Maletti (Stuttgart) MSC: 68Q45 68Q42 PDFBibTeX XMLCite \textit{Z. Fülöp} and \textit{H. Vogler}, Acta Inf. 51, No. 5, 297--325 (2014; Zbl 1307.68047) Full Text: DOI arXiv
Genkin, Daniel; Kaminski, Michael; Peterfreund, Liat A note on the emptiness problem for alternating finite-memory automata. (English) Zbl 1358.68168 Theor. Comput. Sci. 526, 97-107 (2014). MSC: 68Q45 PDFBibTeX XMLCite \textit{D. Genkin} et al., Theor. Comput. Sci. 526, 97--107 (2014; Zbl 1358.68168) Full Text: DOI
Kaminski, Michael; Zeitlin, Daniel Finite-memory automata with non-deterministic reassignment. (English) Zbl 1207.68191 Int. J. Found. Comput. Sci. 21, No. 5, 741-760 (2010). MSC: 68Q45 68Q10 68Q87 PDFBibTeX XMLCite \textit{M. Kaminski} and \textit{D. Zeitlin}, Int. J. Found. Comput. Sci. 21, No. 5, 741--760 (2010; Zbl 1207.68191) Full Text: DOI