×

Found 9 Documents (Results 1–9)

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
Full Text: DOI

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
Full Text: DOI

Filter Results by …

Document Type

Year of Publication

Main Field

all top 3

Software