×

Found 1,450 Documents (Results 1–100)

Iterated uniform finite-state transducers on unary languages. (English) Zbl 1490.68128

Bureš, Tomáš (ed.) et al., SOFSEM 2021: theory and practice of computer science. 47th international conference on current trends in theory and practice of computer science, SOFSEM 2021, Bolzano-Bozen, Italy, January 25–29, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12607, 218-232 (2021).
MSC:  68Q45 68Q80
PDF BibTeX XML Cite
Full Text: DOI

The Diophantine problem in the classical matrix groups. (English. Russian original) Zbl 1487.20011

Izv. Math. 85, No. 6, 1220-1256 (2021); translation from Izv. Ross. Akad. Nauk, Ser. Mat. 85, No. 6, 205-244 (2021).
PDF BibTeX XML Cite
Full Text: DOI

Algorithmic properties of first-order modal logics of the natural number line in restricted languages. (English) Zbl 07585731

Olivetti, Nicola (ed.) et al., Advances in modal logic. Vol. 13. Proceedings of the 13th conference (AiML 2020), Helsinki, Finland, virtual conference, August 24–28, 2020. London: College Publications. 523-539 (2020).
MSC:  03B45
PDF BibTeX XML Cite

The ‘long rule’ in the Lambek calculus with iteration: undecidability without meets and joins. (English) Zbl 07585726

Olivetti, Nicola (ed.) et al., Advances in modal logic. Vol. 13. Proceedings of the 13th conference (AiML 2020), Helsinki, Finland, virtual conference, August 24–28, 2020. London: College Publications. 425-440 (2020).
MSC:  03B45
PDF BibTeX XML Cite

Regular resynchronizability of origin transducers is undecidable. (English) Zbl 07559429

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 58, 14 p. (2020).
MSC:  68Qxx
PDF BibTeX XML Cite
Full Text: DOI arXiv

The undecidability of the domino problem. (English) Zbl 1457.52017

Akiyama, Shigeki (ed.) et al., Substitution and tiling dynamics: introduction to self-inducing structures. Lecture notes from the research school on tiling dynamical systems, CIRM Jean-Morlet Chair, Marseille, France, Fall 2017. Cham: Springer. Lect. Notes Math. 2273, 293-357 (2020).
MSC:  52C20 37B52 52C23
PDF BibTeX XML Cite
Full Text: DOI

Computability. Models of computation and undecidability. (Berechenbarkeit. Berechnungsmodelle und Unentscheidbarkeit.) (German) Zbl 1452.68002

Essentials. Wiesbaden: Springer Spektrum (ISBN 978-3-658-31738-6/pbk; 978-3-658-31739-3/ebook). xiii, 67 p. (2020).
PDF BibTeX XML Cite
Full Text: DOI

Substitution and tiling dynamics: introduction to self-inducing structures. Lecture notes from the research school on tiling dynamical systems, CIRM Jean-Morlet Chair, Marseille, France, Fall 2017. (English) Zbl 1454.37001

Lecture Notes in Mathematics 2273. Cham: Springer (ISBN 978-3-030-57665-3/pbk; 978-3-030-57666-0/ebook). xix, 453 p. (2020).
PDF BibTeX XML Cite
Full Text: DOI

Physical computability theses. (English) Zbl 1498.68109

Hemmo, Meir (ed.) et al., Quantum, probability, logic. The work and influence of Itamar Pitowsky. Cham: Springer. Jerus. Stud. Philos. Hist. Sci., 217-231 (2020).
PDF BibTeX XML Cite
Full Text: DOI

A new model in firefighting theory. (English) Zbl 1453.68207

Changat, Manoj (ed.) et al., Algorithms and discrete applied mathematics. 6th international conference, CALDAM 2020, Hyderabad, India, February 13–15, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12016, 371-383 (2020).
PDF BibTeX XML Cite
Full Text: DOI arXiv

Acceptance ambiguity for quantum automata. (English) Zbl 07561714

Rossmanith, Peter (ed.) et al., 44th international symposium on mathematical foundations of computer science, MFCS 2019, Aachen, Germany, August 26–30, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 138, Article 70, 14 p. (2019).
MSC:  68Qxx
PDF BibTeX XML Cite
Full Text: DOI

Polynomially ambiguous probabilistic automata on restricted languages. (English) Zbl 07561598

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 105, 14 p. (2019).
MSC:  68Nxx 68Qxx
PDF BibTeX XML Cite
Full Text: DOI

A simpler undecidability proof for system F inhabitation. (English) Zbl 07561487

Dybjer, Peter (ed.) et al., 24th international conference on types for proofs and programs, TYPES 2018, Braga, Portugal, June 18–21, 2018. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 130, Article 2, 11 p. (2019).
MSC:  03B70 68N30
PDF BibTeX XML Cite
Full Text: DOI

Hilbert’s tenth problem in Coq. (English) Zbl 07559293

Geuvers, Herman (ed.), 4th international conference on formal structures for computation and deduction, FSCD 2019, Dortmund, Germany, June 24–30, 2019. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 131, Article 27, 20 p. (2019).
MSC:  03B70 68Qxx
PDF BibTeX XML Cite
Full Text: DOI

From mathesis universalis to provability, computability, and constructivity. (English) Zbl 1469.03113

Centrone, Stefania (ed.) et al., Mathesis universalis, computability and proof. Based on the Humboldt-Kolleg “Proof theory as mathesis universalis”, held at the German-Italian Centre for European Excellence, Villa Vigoni, Loveno di Menaggio, Como, Italy, July 24–28, 2017. Cham: Springer. Synth. Libr. 412, 203-234 (2019).
PDF BibTeX XML Cite
Full Text: DOI

More intensional versions of Rice’s theorem. (English) Zbl 1434.03110

Manea, Florin (ed.) et al., Computing with foresight and industry. 15th conference on computability in Europe, CiE 2019, Durham, UK, July 15–19, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11558, 217-229 (2019).
PDF BibTeX XML Cite
Full Text: DOI

L-models and R-models for Lambek calculus enriched with additives and the multiplicative unit. (English) Zbl 07176937

Iemhoff, Rosalie (ed.) et al., Logic, language, information, and computation. 26th international workshop, WoLLIC 2019, Utrecht, The Netherlands, July 2–5, 2019. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 11541, 373-391 (2019).
MSC:  03B70
PDF BibTeX XML Cite
Full Text: DOI

On the right path: a modal logic for supervised learning. (English) Zbl 07160597

Blackburn, Patrick (ed.) et al., Logic, rationality, and interaction. 7th international workshop, LORI 2019, Chongqing, China, October 18–21, 2019. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 11813, 1-14 (2019).
MSC:  68T27
PDF BibTeX XML Cite
Full Text: DOI arXiv

On the algorithmic undecidability of the embeddability problem for algebraic varieties over a field of characteristic zero. (English. Russian original) Zbl 1442.14185

Math. Notes 106, No. 2, 299-302 (2019); translation from Mat. Zametki 106, No. 2, 307-310 (2019).
MSC:  14Q20 11U05 14E25
PDF BibTeX XML Cite
Full Text: DOI

On decidability of regular languages theories. (English) Zbl 07121061

van Bevern, René (ed.) et al., Computer science – theory and applications. 14th international computer science symposium in Russia, CSR 2019, Novosibirsk, Russia, July 1–5, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11532, 119-130 (2019).
MSC:  68Qxx
PDF BibTeX XML Cite
Full Text: DOI

Filter Results by …

Document Type

Database

Reviewing State

all top 5

Author

all top 5

Serial

all top 5

Year of Publication

all top 3

Main Field

all top 3

Software