×

Found 617 Documents (Results 1–100)

On the minimisation of transition-based rabin automata and the chromatic memory requirements of Muller conditions. (English) Zbl 07830368

Manea, Florin (ed.) et al., 30th EACSL annual conference on computer science logic, CSL 2022, Göttingen, Germany, virtual conference, February 14–19, 2022. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 216, Article 12, 17 p. (2022).
MSC:  03B70
PDFBibTeX XMLCite
Full Text: DOI arXiv

Minimization of automata for liveness languages. (English) Zbl 1522.68259

Bouajjani, Ahmed (ed.) et al., Automated technology for verification and analysis. 20th international symposium, ATVA 2022, virtual event, October 25–28, 2022. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13505, 191-207 (2022).
MSC:  68Q45
PDFBibTeX XMLCite
Full Text: DOI

Nominal Büchi automata with name allocation. (English) Zbl 07730606

Haddad, Serge (ed.) et al., 32nd international conference on concurrency theory, CONCUR 2021, August 24–27, 2021, virtual conference. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 203, Article 4, 16 p. (2021).
MSC:  68Q85
PDFBibTeX XMLCite
Full Text: DOI arXiv

A hierarchy of nondeterminism. (English) Zbl 07724258

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 85, 21 p. (2021).
MSC:  68Qxx
PDFBibTeX XMLCite
Full Text: DOI arXiv

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

Synthesis of computable regular functions of infinite words. (English) Zbl 07559499

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 43, 17 p. (2020).
MSC:  68Q85
PDFBibTeX XMLCite
Full Text: DOI

Uniformisations of regular relations over bi-infinite words. (English) Zbl 1498.03092

Proceedings of the 2020 35th annual ACM/IEEE symposium on logic in computer science, LICS 2020, virtual event, July 8–11, 2020. New York, NY: Association for Computing Machinery (ACM). 384-396 (2020).
MSC:  03D05 03B16 03B25
PDFBibTeX XMLCite
Full Text: DOI

The automatic Baire property and an effective property of \(\omega\)-rational functions. (English) Zbl 1484.03075

Leporati, Alberto (ed.) et al., Language and automata theory and applications. 14th international conference, LATA 2020, Milan, Italy, March 4–6, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12038, 303-314 (2020).
MSC:  03D05 03D45 03E15
PDFBibTeX XMLCite
Full Text: DOI arXiv

A verified and compositional translation of LTL to deterministic Rabin automata. (English) Zbl 07649960

Harrison, John (ed.) et al., 10th international conference on interactive theorem proving, ITP 2019, September 9–12, 2019, Portland, OR, USA. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 141, Article 11, 19 p. (2019).
MSC:  68Q45
PDFBibTeX XMLCite
Full Text: DOI

Some variations on Lyndon words (invited talk). (English) Zbl 07559170

Pisanti, Nadia (ed.) et al., 30th annual symposium on combinatorial pattern matching, CPM 2019, Pisa, Italy, June 18–20, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 128, Article 2, 14 p. (2019).
MSC:  68W32
PDFBibTeX XMLCite
Full Text: DOI

On infinite prefix normal words. (English) Zbl 1445.68184

Catania, Barbara (ed.) et al., SOFSEM 2019: theory and practice of computer science. 45th international conference on current trends in theory and practice of computer science, Nový Smokovec, Slovakia, January 27–30, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11376, 122-135 (2019).
MSC:  68R15
PDFBibTeX XMLCite
Full Text: DOI arXiv

A Dialectica-like interpretation of a linear MSO on infinite words. (English) Zbl 1429.03214

Bojańczyk, Mikołaj (ed.) et al., Foundations of software science and computation structures. 22nd international conference, FOSSACS 2019, held as part of the European joint conferences on theory and practice of software, ETAPS 2019, Prague, Czech Republic, April 6–11, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11425, 470-487 (2019).
MSC:  03F52 03D05 03B16
PDFBibTeX XMLCite
Full Text: DOI

New results on pseudosquare avoidance. (English) Zbl 1444.68154

Mercaş, Robert (ed.) et al., Combinatorics on words. 12th international conference, WORDS 2019, Loughborough, UK, September 9–13, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11682, 264-274 (2019).
MSC:  68R15
PDFBibTeX XMLCite
Full Text: DOI arXiv

On canonical models for rational functions over infinite words. (English) Zbl 1528.68181

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 30, 17 p. (2018).
MSC:  68Q45 03D05
PDFBibTeX XMLCite
Full Text: DOI

On the complexity of infinite advice strings. (English) Zbl 1499.68173

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 122, 13 p. (2018).
MSC:  68Q45 03C57 03D05
PDFBibTeX XMLCite
Full Text: DOI

LMSO: a Curry-Howard approach to Church’s synthesis via linear logic. (English) Zbl 1453.03070

Proceedings of the 2018 33rd annual ACM/IEEE symposium on logic in computer science, LICS 2018, Oxford, UK, July 9–12, 2018. New York, NY: Association for Computing Machinery (ACM). 849-858 (2018).
PDFBibTeX XMLCite
Full Text: DOI

One theorem to rule them all: a unified translation of LTL into \(\omega \)-automata. (English) Zbl 1497.68259

Proceedings of the 2018 33rd annual ACM/IEEE symposium on logic in computer science, LICS 2018, Oxford, UK, July 9–12, 2018. New York, NY: Association for Computing Machinery (ACM). 384-393 (2018).
MSC:  68Q45 03B44 03D05
PDFBibTeX XMLCite
Full Text: DOI arXiv

How deterministic are good-for-games automata? (English) Zbl 1491.68096

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 18, 14 p. (2018).
MSC:  68Q45
PDFBibTeX XMLCite
Full Text: DOI arXiv

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

Backward deterministic Büchi automata on infinite words. (English) Zbl 1491.68103

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 6, 9 p. (2018).
MSC:  68Q45 03B44 03D05
PDFBibTeX XMLCite
Full Text: DOI

Decidable inequalities over infinite trees. (English) Zbl 1415.68059

Barthe, Gilles (ed.) et al., LPAR-22. 22nd international conference on logic for programming, artificial intelligence and reasoning, Awassa, Ethiopia, November 17–21, 2018. Selected papers. Manchester: EasyChair. EPiC Ser. Comput. 57, 111-130 (2018).
PDFBibTeX XMLCite
Full Text: DOI

On linear groups with the property of order finiteness of all primitive words in generators. (English. Russian original) Zbl 1401.20052

J. Math. Sci., New York 233, No. 5, 616-625 (2018); translation from Fundam. Prikl. Mat. 21, No. 1, 23-35 (2016).
PDFBibTeX XMLCite
Full Text: DOI

Bubble-flip – a new generation algorithm for prefix normal words. (English) Zbl 1455.68291

Klein, Shmuel Tomi (ed.) et al., Language and automata theory and applications. 12th international conference, LATA 2018, Ramat Gan, Israel, April 9–11, 2018. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10792, 207-219 (2018).
MSC:  68W32 68Q45 68R15
PDFBibTeX XMLCite
Full Text: DOI arXiv

Filter Results by …

Document Type

Database

all top 5

Author

all top 5

Serial

all top 5

Year of Publication

all top 3

Main Field

Biographic Reference