Freydenberger, Dominik D.; Schmid, Markus L. Deterministic regular expressions with back-references. (English) Zbl 1423.68251 J. Comput. Syst. Sci. 105, 1-39 (2019). MSC: 68Q45 PDFBibTeX XMLCite \textit{D. D. Freydenberger} and \textit{M. L. Schmid}, J. Comput. Syst. Sci. 105, 1--39 (2019; Zbl 1423.68251) Full Text: DOI Link
Björklund, Henrik; Martens, Wim; Schwentick, Thomas Conjunctive query containment over trees using schema information. (English) Zbl 1386.68066 Acta Inf. 55, No. 1, 17-56 (2018). MSC: 68Q25 68P05 68P15 68Q17 PDFBibTeX XMLCite \textit{H. Björklund} et al., Acta Inf. 55, No. 1, 17--56 (2018; Zbl 1386.68066) Full Text: DOI
Lu, Ping; Wu, Zhilin; Chen, Haiming The complexity of SORE-definability problems. (English) Zbl 1441.68126 Larsen, Kim G. (ed.) et al., 42nd international symposium on mathematical foundations of computer science, MFCS 2017, August 21–25, 2017, Aalborg, Denmark. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 83, Article 22, 15 p. (2017). MSC: 68Q45 PDFBibTeX XMLCite \textit{P. Lu} et al., LIPIcs -- Leibniz Int. Proc. Inform. 83, Article 22, 15 p. (2017; Zbl 1441.68126) Full Text: DOI
Groz, B.; Maneth, S. Efficient testing and matching of deterministic regular expressions. (English) Zbl 1372.68157 J. Comput. Syst. Sci. 89, 372-399 (2017). MSC: 68Q45 68W32 PDFBibTeX XMLCite \textit{B. Groz} and \textit{S. Maneth}, J. Comput. Syst. Sci. 89, 372--399 (2017; Zbl 1372.68157) Full Text: DOI Link
Losemann, Katja; Martens, Wim; Niewerth, Matthias Closure properties and descriptional complexity of deterministic regular expressions. (English) Zbl 1338.68154 Theor. Comput. Sci. 627, 54-70 (2016). MSC: 68Q45 PDFBibTeX XMLCite \textit{K. Losemann} et al., Theor. Comput. Sci. 627, 54--70 (2016; Zbl 1338.68154) Full Text: DOI
Lu, Ping; Peng, Feifei; Chen, Haiming; Zheng, Lixiao Deciding determinism of unary languages. (English) Zbl 1332.68122 Inf. Comput. 245, 181-196 (2015). MSC: 68Q45 68Q17 68Q25 PDFBibTeX XMLCite \textit{P. Lu} et al., Inf. Comput. 245, 181--196 (2015; Zbl 1332.68122) Full Text: DOI
Latte, Markus; Niewerth, Matthias Definability by weakly deterministic regular expressions with counters is decidable. (English) Zbl 1465.68159 Italiano, F. (ed.) et al., Mathematical foundations of computer science 2015. 40th international symposium, MFCS 2015, Milan, Italy, August 24–28, 2015. Proceedings. Part I. Berlin: Springer. Lect. Notes Comput. Sci. 9234, 369-381 (2015). MSC: 68Q45 68Q25 PDFBibTeX XMLCite \textit{M. Latte} and \textit{M. Niewerth}, Lect. Notes Comput. Sci. 9234, 369--381 (2015; Zbl 1465.68159) Full Text: DOI
Lu, Ping; Bremer, Joachim; Chen, Haiming Deciding determinism of regular languages. (English) Zbl 1339.68151 Theory Comput. Syst. 57, No. 1, 97-139 (2015). Reviewer: Michal Kunc (Brno) MSC: 68Q45 68Q25 PDFBibTeX XMLCite \textit{P. Lu} et al., Theory Comput. Syst. 57, No. 1, 97--139 (2015; Zbl 1339.68151) Full Text: DOI
Chen, Haiming; Lu, Ping Checking determinism of regular expressions with counting. (English) Zbl 1330.68151 Inf. Comput. 241, 302-320 (2015). Reviewer: Vladimir Komendantsky (St Andrews) MSC: 68Q45 68Q17 PDFBibTeX XMLCite \textit{H. Chen} and \textit{P. Lu}, Inf. Comput. 241, 302--320 (2015; Zbl 1330.68151) Full Text: DOI