×

Found 10 Documents (Results 1–10)

Reachability in fixed dimension vector addition systems with states. (English) Zbl 07559504

Konnov, Igor (ed.) et al., 31st international conference on concurrency theory. CONCUR 2020, September 1–4, 2020, Vienna, Austria, virtual conference. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 171, Article 48, 21 p. (2020).
MSC:  68Q85
PDFBibTeX XMLCite
Full Text: DOI arXiv

Universality problem for unambiguous VASS. (English) Zbl 07559492

Konnov, Igor (ed.) et al., 31st international conference on concurrency theory. CONCUR 2020, September 1–4, 2020, Vienna, Austria, virtual conference. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 171, Article 36, 15 p. (2020).
MSC:  68Q85
PDFBibTeX XMLCite
Full Text: DOI arXiv

New pumping technique for 2-dimensional VASS. (English) Zbl 07561706

Rossmanith, Peter (ed.) et al., 44th international symposium on mathematical foundations of computer science, MFCS 2019, Aachen, Germany, August 26–30, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 138, Article 62, 14 p. (2019).
MSC:  68Qxx
PDFBibTeX XMLCite
Full Text: DOI arXiv

Regular separability of well-structured transition systems. (English) Zbl 1520.68092

Schewe, Sven (ed.) et al., 29th international conference on concurrency theory. CONCUR 2018, Beijing, China, September 4–7, 2018. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 118, Article 35, 18 p. (2018).
MSC:  68Q85 68Q45
PDFBibTeX XMLCite
Full Text: DOI arXiv

Unboundedness problems for languages of vector addition systems. (English) Zbl 1499.68170

Chatzigiannakis, Ioannis (ed.) et al., 45th international colloquium on automata, languages, and programming. ICALP 2018, Prague, Czech Republic, July 9–13, 2018. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 107, Article 119, 15 p. (2018).
MSC:  68Q45 68Q85
PDFBibTeX XMLCite
Full Text: DOI arXiv

A note on decidable separability by piecewise testable languages. (English) Zbl 1434.68242

Kosowski, Adrian (ed.) et al., Fundamentals of computation theory. 20th international symposium, FCT 2015, Gdańsk, Poland, August 17–19, 2015. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 9210, 173-185 (2015).
MSC:  68Q45
PDFBibTeX XMLCite
Full Text: DOI

Filter Results by …

Document Type

all top 5

Year of Publication

Main Field

all top 3

Software