×

Found 606 Documents (Results 1–100)

Newest Citations Relevance
Urbat, Henning; Hausmann, Daniel; Milius, Stefan; Schröder, Lutz

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
PDF BibTeX XML Cite
\textit{H. Urbat} et al., LIPIcs -- Leibniz Int. Proc. Inform. 203, Article 4, 16 p. (2021; Zbl 07730606)
Full Text: DOI arXiv
Abu, Radi Bader; Kupferman, Orna; Leshkowitz, Ofer

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
PDF BibTeX XML Cite
\textit{R. B. Abu} et al., LIPIcs -- Leibniz Int. Proc. Inform. 202, Article 85, 21 p. (2021; Zbl 07724258)
Full Text: DOI arXiv
Kupferman, Orna; Sickert, Salomon

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
\textit{O. Kupferman} and \textit{S. Sickert}, Lect. Notes Comput. Sci. 12650, 385--405 (2021; Zbl 07410435)
Full Text: DOI arXiv
Dave, Vrunda; Filiot, Emmanuel; Krishna, Shankara Narayanan; Lhote, Nathan

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
PDF BibTeX XML Cite
\textit{V. Dave} et al., LIPIcs -- Leibniz Int. Proc. Inform. 171, Article 43, 17 p. (2020; Zbl 07559499)
Full Text: DOI
Fabiański, Grzegorz; Skrzypczak, Michał; Toruńczyk, Szymon

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
PDF BibTeX XML Cite
\textit{G. Fabiański} et al., in: 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; Zbl 1498.03092)
Full Text: DOI
Finkel, Olivier

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
PDF BibTeX XML Cite
\textit{O. Finkel}, Lect. Notes Comput. Sci. 12038, 303--314 (2020; Zbl 1484.03075)
Full Text: DOI arXiv
Brunner, Julian; Seidl, Benedikt; Sickert, Salomon

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:  68T15
PDF BibTeX XML Cite
\textit{J. Brunner} et al., LIPIcs -- Leibniz Int. Proc. Inform. 141, Article 11, 19 p. (2019; Zbl 07649960)
Full Text: DOI
Dolce, Francesco; Restivo, Antonio; Reutenauer, Christophe

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
PDF BibTeX XML Cite
\textit{F. Dolce} et al., LIPIcs -- Leibniz Int. Proc. Inform. 128, Article 2, 14 p. (2019; Zbl 07559170)
Full Text: DOI
Cicalese, Ferdinando; Lipták, Zsuzsanna; Rossi, Massimiliano

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
PDF BibTeX XML Cite
\textit{F. Cicalese} et al., Lect. Notes Comput. Sci. 11376, 122--135 (2019; Zbl 1445.68184)
Full Text: DOI arXiv
Pradic, Pierre; Riba, Colin

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
PDF BibTeX XML Cite
\textit{P. Pradic} and \textit{C. Riba}, Lect. Notes Comput. Sci. 11425, 470--487 (2019; Zbl 1429.03214)
Full Text: DOI
Ng, Tim; Ochem, Pascal; Rampersad, Narad; Shallit, Jeffrey

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).
Reviewer: Zoltán Kása (Cluj-Napoca)
MSC:  68R15
PDF BibTeX XML Cite
\textit{T. Ng} et al., Lect. Notes Comput. Sci. 11682, 264--274 (2019; Zbl 1444.68154)
Full Text: DOI arXiv
Puzynina, Svetlana

Abelian properties of words. (English) Zbl 1436.68287

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, 28-45 (2019).
MSC:  68R15
PDF BibTeX XML Cite
\textit{S. Puzynina}, Lect. Notes Comput. Sci. 11682, 28--45 (2019; Zbl 1436.68287)
Full Text: DOI
Filiot, Emmanuel; Gauwin, Olivier; Lhote, Nathan; Muscholl, Anca

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

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:  68N30 68Qxx
PDF BibTeX XML Cite
\textit{E. Filiot} et al., LIPIcs -- Leibniz Int. Proc. Inform. 122, Article 30, 17 p. (2018; Zbl 07561335)
Full Text: DOI
Douéneau-Tabot, Gaëtan

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
PDF BibTeX XML Cite
\textit{G. Douéneau-Tabot}, LIPIcs -- Leibniz Int. Proc. Inform. 107, Article 122, 13 p. (2018; Zbl 1499.68173)
Full Text: DOI
Pradic, Pierre; Riba, Colin

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).
MSC:  03F52 03D05 68Q45 68Q60
PDF BibTeX XML Cite
\textit{P. Pradic} and \textit{C. Riba}, in: 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; Zbl 1453.03070)
Full Text: DOI
Esparza, Javier; Křetínský, Jan; Sickert, Salomon

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
PDF BibTeX XML Cite
\textit{J. Esparza} et al., in: 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; Zbl 1497.68259)
Full Text: DOI arXiv
Boker, Udi; Kupferman, Orna; Skrzypczak, Michał

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
PDF BibTeX XML Cite
\textit{U. Boker} et al., LIPIcs -- Leibniz Int. Proc. Inform. 93, Article 18, 14 p. (2018; Zbl 1491.68096)
Full Text: DOI arXiv
Boker, Udi

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
\textit{U. Boker}, LIPIcs -- Leibniz Int. Proc. Inform. 93, Article 17, 15 p. (2018; Zbl 1491.68095)
Full Text: DOI
Wilke, Thomas

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
PDF BibTeX XML Cite
\textit{T. Wilke}, LIPIcs -- Leibniz Int. Proc. Inform. 93, Article 6, 9 p. (2018; Zbl 1491.68103)
Full Text: DOI
Bauer, Sabine; Jost, Steffen; Hofmann, Martin

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).
MSC:  68N30 03B25 03D05 68R15
PDF BibTeX XML Cite
\textit{S. Bauer} et al., EPiC Ser. Comput. 57, 111--130 (2018; Zbl 1415.68059)
Full Text: DOI
Admiralova, A. N.; Beniash-Kryvets, V. V.

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).
MSC:  20G20 20F05 20F10 20F28 20F36 20G05
PDF BibTeX XML Cite
\textit{A. N. Admiralova} and \textit{V. V. Beniash-Kryvets}, J. Math. Sci., New York 233, No. 5, 616--625 (2018; Zbl 1401.20052); translation from Fundam. Prikl. Mat. 21, No. 1, 23--35 (2016)
Full Text: DOI
Cicalese, Ferdinando; Lipták, Zsuzsanna; Rossi, Massimiliano

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
PDF BibTeX XML Cite
\textit{F. Cicalese} et al., Lect. Notes Comput. Sci. 10792, 207--219 (2018; Zbl 1455.68291)
Full Text: DOI arXiv
Droste, Manfred

On Ore’s theorem and universal words for permutations and injections of infinite sets. (English) Zbl 1436.20115

Droste, Manfred (ed.) et al., Groups, modules, and model theory – surveys and recent developments. In Memory of Rüdiger Göbel. Proceedings of the conference on new pathways between group theory and model theory, Mülheim an der Ruhr, Germany, February 1–4, 2016. Cham: Springer. 269-275 (2017).
MSC:  20M20 20B27
PDF BibTeX XML Cite
\textit{M. Droste}, in: Groups, modules, and model theory -- surveys and recent developments. In Memory of Rüdiger Göbel. Proceedings of the conference on new pathways between group theory and model theory, Mülheim an der Ruhr, Germany, February 1--4, 2016. Cham: Springer. 269--275 (2017; Zbl 1436.20115)
Full Text: DOI
Pradic, Pierre; Riba, Colin

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).
MSC:  03D05 03B16 03F35 03F55 68Q45
PDF BibTeX XML Cite
\textit{P. Pradic} and \textit{C. Riba}, LIPIcs -- Leibniz Int. Proc. Inform. 84, Article 30, 16 p. (2017; Zbl 1434.03104)
Full Text: DOI
Carton, Olivier; Finkel, Olivier; Lecomte, Dominique

Polishness of some topologies related to automata. (English) Zbl 1434.03100

Goranko, Valentin (ed.) et al., 26th EACSL annual conference on computer science logic, CSL 2017, Stockholm, Sweden, August 20–24, 2017. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 82, Article 22, 16 p. (2017).
MSC:  03D05 03E15 03D10 68Q45
PDF BibTeX XML Cite
\textit{O. Carton} et al., LIPIcs -- Leibniz Int. Proc. Inform. 82, Article 22, 16 p. (2017; Zbl 1434.03100)
Full Text: DOI
Böhm, Stanislav; Göller, Stefan; Halfon, Simon; Hofman, Piotr

On Büchi one-counter automata. (English) Zbl 1402.68114

Vollmer, Heribert (ed.) et al., 34th symposium on theoretical aspects of computer science (STACS 2017), Hannover, Germany, March 8–11, 2017. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-028-6). LIPIcs – Leibniz International Proceedings in Informatics 66, Article 14, 13 p. (2017).
MSC:  68Q45 03D05
PDF BibTeX XML Cite
\textit{S. Böhm} et al., LIPIcs -- Leibniz Int. Proc. Inform. 66, Article 14, 13 p. (2017; Zbl 1402.68114)
Full Text: DOI
Kaboré, Idrissa; Kientéga, Boucaré

Abelian complexity of Thue-Morse word over a ternary alphabet. (English) Zbl 1405.68265

Brlek, Srečko (ed.) et al., Combinatorics on words. 11th international conference, WORDS 2017, Montréal, QC, Canada, September 11–15, 2017. Proceedings. Cham: Springer (ISBN 978-3-319-66395-1/pbk; 978-3-319-66396-8/ebook). Lecture Notes in Computer Science 10432, 132-143 (2017).
MSC:  68R15 11B85
PDF BibTeX XML Cite
\textit{I. Kaboré} and \textit{B. Kientéga}, Lect. Notes Comput. Sci. 10432, 132--143 (2017; Zbl 1405.68265)
Full Text: DOI

Filter Results by …

Document Type

Reviewing State

all top 5

Author

all top 5

Serial

all top 5

Year of Publication

all top 3

Main Field

Biographic Reference

all top 3

Software