×

Found 160 Documents (Results 1–100)

\( \omega \)-automata. (English) Zbl 07469504

Pin, Jean-Éric (ed.), Handbook of automata theory. Volume I. Theoretical foundations. Berlin: European Mathematical Society (EMS). 189-234 (2021).
MSC:  68Q45
PDF BibTeX XML Cite
Full Text: DOI

Certifying inexpressibility. (English) Zbl 07410435

Kiefer, Stefan (ed.) et al., Foundations of software science and computation structures. 24th international conference, FOSSACS 2021, held as part of the European joint conferences on theory and practice of software, ETAPS 2021, Luxembourg City, Luxembourg, March 27 – April 1, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12650, 385-405 (2021).
MSC:  68Nxx 68Qxx
PDF BibTeX XML Cite
Full Text: DOI arXiv

On repetition languages. (English) Zbl 07559430

Esparza, Javier (ed.) et al., 45th international symposium on mathematical foundations of computer science, MFCS 2020, August 25–26, 2020, Prague, Czech Republic. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 170, Article 59, 14 p. (2020).
MSC:  68Qxx
PDF BibTeX XML Cite
Full Text: DOI

Determinization of Büchi automata: unifying the approaches of Safra and Muller-Schupp. (English) Zbl 07561613

Baier, Christel (ed.) et al., 46th international colloquium on automata, languages, and programming, ICALP 2019, Patras, Greece, July 9–12, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 132, Article 120, 13 p. (2019).
MSC:  68Nxx 68Qxx
PDF BibTeX XML Cite
Full Text: DOI arXiv

New optimizations and heuristics for determinization of Büchi automata. (English) Zbl 1437.68101

Chen, Yu-Fang (ed.) et al., Automated technology for verification and analysis. 17th international symposium, ATVA 2019, Taipei, Taiwan, October 28–31, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11781, 317-333 (2019).
MSC:  68Q45
PDF BibTeX XML Cite
Full Text: DOI arXiv

On the way to alternating weak automata. (English) Zbl 07561326

Ganguly, Sumit (ed.) et al., 38th IARCS annual conference on foundations of software technology and theoretical computer science, FSTTCS 2018, Ahmedabad, India, December 11–13, 2018. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 122, Article 21, 22 p. (2018).
MSC:  68N30 68Qxx
PDF BibTeX XML Cite
Full Text: DOI

Rabin vs. Streett automata. (English) Zbl 1491.68095

Lokam, Satya (ed.) et al., 37th IARCS annual conference on foundations of software technology and theoretical computer science, FSTTCS 2017, IIT Kanpur, India, December 12–14, 2017. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 93, Article 17, 15 p. (2018).
MSC:  68Q45
PDF BibTeX XML Cite
Full Text: DOI

Beyond \(\omega BS\)-regular languages: \(\omega T\)-regular expressions and counter-check automata. (English) Zbl 1483.68160

Bouyer, Patricia (ed.) et al., Proceedings of the eighth international symposium on games, automata, logics and formal verification, GandALF 2017, Roma, Italy, September 20–22, 2017. Waterloo: Open Publishing Association (OPA). Electron. Proc. Theor. Comput. Sci. (EPTCS) 256, 223-237 (2017).
MSC:  68Q45
PDF BibTeX XML Cite
Full Text: arXiv Link

A Curry-Howard approach to Church’s synthesis. (English) Zbl 1434.03104

Miller, Dale (ed.), 2nd international conference on formal structures for computation and deduction. FSCD 2017, Oxford, UK, September 3–9, 2017. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 84, Article 30, 16 p. (2017).
PDF BibTeX XML Cite
Full Text: DOI

On expressive power of regular expressions over infinite orders. (English) Zbl 1475.68166

Kulikov, Alexander S. (ed.) et al., Computer science – theory and applications. 11th international computer science symposium in Russia, CSR 2016, St. Petersburg, Russia, June 9–13, 2016. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 9691, 382-393 (2016).
MSC:  68Q45 03D05
PDF BibTeX XML Cite
Full Text: DOI

Level two of the quantifier alternation hierarchy over infinite words. (English) Zbl 1386.03043

Kulikov, Alexander S. (ed.) et al., Computer science – theory and applications. 11th international computer science symposium in Russia, CSR 2016, St. Petersburg, Russia, June 9–13, 2016. Proceedings. Cham: Springer (ISBN 978-3-319-34170-5/pbk; 978-3-319-34171-2/ebook). Lecture Notes in Computer Science 9691, 223-236 (2016).
MSC:  03D05 03B25 03C13
PDF BibTeX XML Cite
Full Text: DOI arXiv Link

On determinisation of good-for-games automata. (English) Zbl 1440.68158

Halldórsson, Magnús M. (ed.) et al., Automata, languages, and programming. 42nd international colloquium, ICALP 2015, Kyoto, Japan, July 6–10, 2015. Proceedings. Part II. Berlin: Springer. Lect. Notes Comput. Sci. 9135, 299-310 (2015).
MSC:  68Q45
PDF BibTeX XML Cite
Full Text: DOI

Limited set quantifiers over countable linear orderings. (English) Zbl 1443.03006

Halldórsson, Magnús M. (ed.) et al., Automata, languages, and programming. 42nd international colloquium, ICALP 2015, Kyoto, Japan, July 6–10, 2015. Proceedings. Part II. Berlin: Springer. Lect. Notes Comput. Sci. 9135, 146-158 (2015).
MSC:  03B16 03B25 06A05
PDF BibTeX XML Cite
Full Text: DOI

The Wadge hierarchy of Petri nets \(\omega\)-languages. (English) Zbl 1437.68096

Artemov, Sergei (ed.) et al., Logical foundations of computer science. International symposium, LFCS 2013, San Diego, CA, USA, January 6–8, 2013. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 7734, 179-193 (2013).
PDF BibTeX XML Cite
Full Text: DOI

The quest for a tight translation of Büchi to co-Büchi automata. (English) Zbl 1287.68092

Blass, Andreas (ed.) et al., Fields of logic and computation. Essays dedicated to Yuri Gurevich on the occasion of his 70th birthday. Berlin: Springer (ISBN 978-3-642-15024-1/pbk). Lecture Notes in Computer Science 6300, 147-164 (2010).
MSC:  68Q45 03D05
PDF BibTeX XML Cite
Full Text: DOI

Cardinality quantifiers in MLO over trees. (English) Zbl 1257.03062

Grädel, Erich (ed.) et al., Computer science logic. 23rd international workshop, CSL 2009, 18th annual conference of the EACSL, Coimbra, Portugal, September 7–11, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-04026-9/pbk). Lecture Notes in Computer Science 5771, 117-131 (2009).
PDF BibTeX XML Cite
Full Text: DOI

Lower bounds on witnesses for nonemptiness of universal co-Büchi automata. (English) Zbl 1234.68221

de Alfaro, Luca (ed.), Foundations of software science and computational structures. 12th international conference, FOSSACS 2009, held as part of the joint European conferences on theory and practice of software, ETAPS 2009, York, UK, March 22–29, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-00595-4/pbk). Lecture Notes in Computer Science 5504, 182-196 (2009).
MSC:  68Q45 68Q60
PDF BibTeX XML Cite
Full Text: DOI

Tighter bounds for the determinisation of Büchi automata. (English) Zbl 1234.68239

de Alfaro, Luca (ed.), Foundations of software science and computational structures. 12th international conference, FOSSACS 2009, held as part of the joint European conferences on theory and practice of software, ETAPS 2009, York, UK, March 22–29, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-00595-4/pbk). Lecture Notes in Computer Science 5504, 167-181 (2009).
MSC:  68Q45 68Q60
PDF BibTeX XML Cite
Full Text: DOI

Facets of synthesis: Revisiting Church’s problem. (English) Zbl 1234.68081

de Alfaro, Luca (ed.), Foundations of software science and computational structures. 12th international conference, FOSSACS 2009, held as part of the joint European conferences on theory and practice of software, ETAPS 2009, York, UK, March 22–29, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-00595-4/pbk). Lecture Notes in Computer Science 5504, 1-14 (2009).
PDF BibTeX XML Cite
Full Text: DOI

Model checking quantitative linear time logic. (English) Zbl 1286.68313

Aldini, Alessandro (ed.) et al., Proceedings of the 6th workshop on quantitative aspects of programming languages (QAPL 2008), Budapest, Hungary, March 29–30, 2008. Amsterdam: Elsevier. Electronic Notes in Theoretical Computer Science 220, No. 3, 61-77 (2008).
MSC:  68Q60 03B44 68Q87
PDF BibTeX XML Cite
Full Text: DOI

On the minimization problem for \(\omega \)-automata. (English) Zbl 1493.68193

Privara, Igor (ed.) et al., Mathematical foundations of computer science 1994. 19th international symposium, MFCS ’94, Košice, Slovakia, August 22–26, 1994. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 841, 504-514 (1994).
MSC:  68Q45
PDF BibTeX XML Cite
Full Text: DOI

Filter Results by …

Document Type

Reviewing State

all top 5

Author

all top 5

Year of Publication

all top 3

Main Field

all top 3

Software