×

Found 99 Documents (Results 1–99)

On the complexity of intersection non-emptiness for star-free language classes. (English) Zbl 07799612

Bojańczyk, Mikołaj (ed.) et al., 41st IARCS annual conference on foundations of software technology and theoretical computer science, FSTTCS 2021, virtual conference, December 15–17, 2021. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 213, Article 34, 15 p. (2021).
MSC:  68N30 68Qxx
PDFBibTeX XMLCite
Full Text: DOI arXiv

Decision questions for probabilistic automata on small alphabets. (English) Zbl 07724188

Bonchi, Filippo (ed.) et al., 46th international symposium on mathematical foundations of computer science, MFCS 2021, August 23–27, 2021, Tallinn, Estonia. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 202, Article 15, 17 p. (2021).
MSC:  68Qxx
PDFBibTeX XMLCite
Full Text: DOI arXiv

On the decidability of finding a positive ILP-instance in a regular set of ILP-instances. (English) Zbl 1434.68291

Hospodár, Michal (ed.) et al., Descriptional complexity of formal systems. 21st IFIP WG 1.02 international conference, DCFS 2019, Košice, Slovakia, July 17–19, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11612, 272-284 (2019).
MSC:  68Q45 03B25 90C10
PDFBibTeX XMLCite
Full Text: DOI HAL

Decision problems for restricted variants of two-dimensional automata. (English) Zbl 1434.68288

Hospodár, Michal (ed.) et al., Implementation and application of automata. 24th international conference, CIAA 2019, Košice, Slovakia, July 22–25, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11601, 222-234 (2019).
MSC:  68Q45
PDFBibTeX XMLCite
Full Text: DOI arXiv

Intersection non-emptiness and hardness within polynomial time. (English) Zbl 1517.68183

Hoshi, Mizuho (ed.) et al., Developments in language theory. 22nd international conference, DLT 2018, Tokyo, Japan, September 10–14, 2018. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11088, 282-290 (2018).
MSC:  68Q45 68Q25
PDFBibTeX XMLCite
Full Text: DOI

Probabilistic automata of bounded ambiguity. (English) Zbl 1442.68092

Meyer, Roland (ed.) et al., 28th international conference on concurrency theory. CONCUR 2017, Berlin, Germany, September 5–8, 2017. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 85, Article 19, 14 p. (2017).
PDFBibTeX XMLCite
Full Text: DOI

Automata on infinite trees with equality and disequality constraints between siblings. (English) Zbl 1401.68152

Proceedings of the 2016 31st annual ACM/IEEE symposium on logic in computer science, LICS 2016, New York City, NY, USA, July 5–8, 2016. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-4391-6). 227-236 (2016).
MSC:  68Q45 03B25 03D05
PDFBibTeX XMLCite
Full Text: DOI HAL

Problems on finite automata and the exponential time hypothesis. (English) Zbl 1475.68152

Han, Yo-Sub (ed.) et al., Implementation and application of automata. 21st international conference, CIAA 2016, Seoul, South Korea, July 19–22, 2016. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 9705, 89-100 (2016).
MSC:  68Q45 68Q17 68Q25
PDFBibTeX XMLCite
Full Text: DOI

On density, threshold and emptiness queries for intervals in the streaming model. (English) Zbl 1366.68052

Harsha, Prahladh (ed.) et al., 35th IARCS annual conference on foundations of software technology and theoretical computer science, FSTTCS 2015, Bangalore, India, December 16–18, 2015. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-97-2). LIPIcs – Leibniz International Proceedings in Informatics 45, 336-349 (2015).
MSC:  68Q05 68Q10 68Q25
PDFBibTeX XMLCite
Full Text: DOI

What’s decidable about availability languages? (English) Zbl 1366.68130

Harsha, Prahladh (ed.) et al., 35th IARCS annual conference on foundations of software technology and theoretical computer science, FSTTCS 2015, Bangalore, India, December 16–18, 2015. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-97-2). LIPIcs – Leibniz International Proceedings in Informatics 45, 192-205 (2015).
MSC:  68Q45 03D05 68Q25
PDFBibTeX XMLCite
Full Text: DOI

Control of \(\omega\)-automata, Church’s problem, and the emptiness problem for tree \(\omega\)-automata. (English) Zbl 0783.03019

Börger, Egon (ed.) et al., Computer science logic. 5th workshop, CSL ’91, Berne, Switzerland, October 7-11, 1991. Proceedings. Berlin etc.: Springer-Verlag. Lect. Notes Comput. Sci. 626, 367-381 (1992).
Reviewer: N.Curteanu (Iaşi)
PDFBibTeX XMLCite

Memory efficient algorithms for the verification of temporal properties. (English) Zbl 0786.68060

Computer-aided verification ’90, Proc. 2nd DIMACS Workshop, New Brunswick/NJ (USA) 1990, DIMACS, Ser. Discret. Math. Theor. Comput. Sci. 3, 207-218 (1991).
MSC:  68Q60
PDFBibTeX XMLCite

Filter Results by …

Document Type

all top 5

Author

all top 5

Year of Publication

all top 3

Main Field

all top 3

Software