×

Found 123 Documents (Results 1–100)

100
MathJax

Deciding \(\mathrm{FO}^2\) alternation for automata over finite and infinite words. (English) Zbl 07498725

Moreira, Nelma (ed.) et al., Developments in language theory. 25th international conference, DLT 2021, Porto, Portugal, August 16–20, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12811, 180-191 (2021).
MSC:  68Q45
PDF BibTeX XML Cite
Full Text: DOI

The polycyclic inverse monoids and the Thompson groups revisited. (English) Zbl 1482.20034

Romeo, P. G. (ed.) et al., Semigroups, categories, and partial algebras. ICSAA 2019. Proceedings of the conference, Kochi, India, December 9–12, 2019. Singapore: Springer. Springer Proc. Math. Stat. 345, 179-214 (2021).
MSC:  20M18 18B40 20F29
PDF BibTeX XML Cite
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
PDF BibTeX XML Cite
Full Text: DOI arXiv

Well-quasi orders and hierarchy theory. (English) Zbl 07218745

Schuster, Peter M. (ed.) et al., Well-quasi orders in computation, logic, language and reasoning. A unifying concept of proof theory, automata theory, formal languages and descriptive set theory. Based on the minisymposium on well-quasi orders: from theory to applications within the Jahrestagung der Deutschen Mathematiker-Vereinigung (DMV), Hamburg, Germany, September 21–25, 2015 and the Dagstuhl seminar 16031 on well quasi-orders in computer science, Schloss Dagstuhl, Germany, January 17–22, 2016. Cham: Springer. Trends Log. Stud. Log. Libr. 53, 271-319 (2020).
MSC:  03-XX
PDF BibTeX XML Cite
Full Text: DOI arXiv

Regular \(\omega\)-languages with an informative right congruence. (English) Zbl 07447748

Orlandini, Andrea (ed.) et al., Proceedings of the ninth international symposium on games, automata, logics, and formal verification, GandALF 2018, Saarbrücken, Germany, September 26–28, 2018. Waterloo: Open Publishing Association (OPA). Electron. Proc. Theor. Comput. Sci. (EPTCS) 277, 265-279 (2018).
MSC:  68Q45 68Q60 91A80
PDF BibTeX XML Cite
Full Text: arXiv Link

A coalgebraic take on regular and \(\omega\)-regular behaviour for systems with internal moves. (English) Zbl 07378569

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 25, 18 p. (2018).
MSC:  68Q85
PDF BibTeX XML Cite
Full Text: DOI

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

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:  68N30 68Qxx
PDF BibTeX XML Cite
Full Text: DOI

The triple-pair construction for weighted \(\omega\)-pushdown automata. (English) Zbl 1483.68163

Csuhaj-Varjú, Erzsébet (ed.) et al., Proceedings of the 15th international conference on automata and formal languages, AFL’17, Debrecen, Hungary, September 4–6, 2017. Waterloo: Open Publishing Association (OPA). Electron. Proc. Theor. Comput. Sci. (EPTCS) 252, 101-113 (2017).
MSC:  68Q45 16Y60 68Q70
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

A characterisation of \(\Pi^0_2\) regular tree languages. (English) Zbl 1441.68118

Larsen, Kim G. (ed.) et al., 42nd international symposium on mathematical foundations of computer science, MFCS 2017, August 21–25, 2017, Aalborg, Denmark. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 83, Article 56, 14 p. (2017).
MSC:  68Q45
PDF BibTeX XML Cite
Full Text: DOI

Language games. (English) Zbl 1482.68226

Amblard, Maxime (ed.) et al., Logical aspects of computational linguistics. Celebrating 20 years of LACL (1996–2016). 9th international conference, LACL 2016, Nancy, France, December 5–7, 2016. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 10054, 1-17 (2016).
MSC:  68T27 03B65 91A44
PDF BibTeX XML Cite
Full Text: DOI Link

Operations on weakly recognizing morphisms. (English) Zbl 1476.68159

Câmpeanu, Cezar (ed.) et al., Descriptional complexity of formal systems. 18th IFIP WG 1.2 international conference, DCFS 2016, Bucharest, Romania, July 5–8, 2016. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 9777, 126-137 (2016).
MSC:  68Q70 20M35
PDF BibTeX XML Cite
Full Text: DOI arXiv Link

MSO-definable properties of Muller context-free languages are decidable. (English) Zbl 1476.03050

Câmpeanu, Cezar (ed.) et al., Descriptional complexity of formal systems. 18th IFIP WG 1.2 international conference, DCFS 2016, Bucharest, Romania, July 5–8, 2016. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 9777, 87-97 (2016).
MSC:  03D05
PDF BibTeX XML Cite
Full Text: DOI Link

The word problem for omega-terms over the Trotter-Weil hierarchy (extended abstract). (English) Zbl 1386.20037

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, 237-250 (2016).
PDF BibTeX XML Cite
Full Text: DOI arXiv

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

Incompleteness theorems, large cardinals, and automata over infinite words. (English) Zbl 1440.03056

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, 222-233 (2015).
PDF BibTeX XML Cite
Full Text: DOI HAL

Decidable expansions of labelled linear orderings. (English) Zbl 1287.03025

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, 95-107 (2010).
MSC:  03B25 06A05
PDF BibTeX XML Cite
Full Text: DOI

Security policies enforcement using finite edit automata. (English) Zbl 1291.68279

Bonchi, Filippo (ed.) et al., Proceedings of the 1st interaction and concurrency experiences workshop (ICE 2008), Reykjavik, Iceland, July 6, 2008. Amsterdam: Elsevier. Electronic Notes in Theoretical Computer Science 229, No. 3, 19-35 (2009).
MSC:  68Q85 68Q45
PDF BibTeX XML Cite
Full Text: DOI

Decidable extensions of Church’s problem. (English) Zbl 1257.03034

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, 424-439 (2009).
MSC:  03B25
PDF BibTeX XML Cite
Full Text: DOI Link

Power of randomization in automata on infinite strings. (English) Zbl 1254.68131

Bravetti, Mario (ed.) et al., CONCUR 2009 – concurrency theory. 20th international conference, CONCUR 2009, Bologna, Italy, September 1–4, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-04080-1/pbk). Lecture Notes in Computer Science 5710, 229-243 (2009).
MSC:  68Q45 68Q87
PDF BibTeX XML Cite
Full Text: DOI arXiv

A generalization of Semenov’s theorem to automata over real numbers. (English) Zbl 1250.03061

Schmidt, Renate A. (ed.), Automated deduction – CADE-22. 22nd international conference on automated deduction, Montreal, Canada, August 2–7, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-02958-5/pbk). Lecture Notes in Computer Science 5663. Lecture Notes in Artificial Intelligence, 469-484 (2009).
MSC:  03D05 68Q45
PDF BibTeX XML Cite
Full Text: DOI HAL

Filter Results by …

Document Type

Reviewing State

all top 5

Author

all top 5

Year of Publication

all top 3

Classification

all top 3

Software