×

Found 50 Documents (Results 1–50)

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

Introduction to data science. A Python approach to concepts, techniques and applications. With contributions from Jordi Vitrià, Eloi Puertas Petia Radeva, Oriol Pujol, Sergio Escalera, Francesc Dantí and Lluís Garrido. (English) Zbl 1365.62003

Undergraduate Topics in Computer Science. Cham: Springer (ISBN 978-3-319-50016-4/pbk; 978-3-319-50017-1/ebook). xiv, 218 p. (2017).
PDFBibTeX XMLCite
Full Text: DOI

Complexity of aperiodicity for topological properties of regular \(\omega \)-languages. (English) Zbl 1143.68039

Beckmann, Arnold (ed.) et al., Logic and theory of algorithms. 4th conference on computability in Europe, CiE 2008, Athens, Greece, June 15–20, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-69405-2/pbk). Lecture Notes in Computer Science 5028, 533-543 (2008).
PDFBibTeX XMLCite
Full Text: DOI

An \(\omega\)-power of a context-free language which is Borel above \(\Delta^0_{\omega}\). (English) Zbl 1213.03057

Bold, Stefan (ed.) et al., Foundations of the formal sciences V. Infinite games. Papers of the 5th conference, FotFS V, Bonn, Germany, November 26–29, 2004. London: King’s College Publications (ISBN 978-1-904987-75-8/pbk). Studies in Logic (London) 11, 109-122 (2007).
MSC:  03E15 03D05 68Q45
PDFBibTeX XMLCite

Fine hierarchy of regular aperiodic \(\omega \)-languages. (English) Zbl 1155.03310

Harju, Tero (ed.) et al., Developments in language theory. 11th international conference, DLT 2007, Turku, Finland, July 3–6, 2007. Proceedings. Berlin: Springer (ISBN 978-3-540-73207-5/pbk). Lecture Notes in Computer Science 4588, 399-410 (2007).
PDFBibTeX XMLCite
Full Text: DOI

Monadic second-order logic and transitive closure logics over trees. (English) Zbl 1262.03050

Mints, G. (ed.) et al., Proceedings of the 13th workshop on logic, language, information and computation (WoLLIC 2006), Stanford, CA, USA, July 18–21, 2006. Amsterdam: Elsevier. Electronic Notes in Theoretical Computer Science 165, 189-199 (2006).
MSC:  03B65 68Q19 68Q42
PDFBibTeX XMLCite
Full Text: DOI

Wadge degrees of \(\omega\)-languages of deterministic Turing machines. (English) Zbl 1036.03033

Alt, Helmut (ed.) et al., STACS 2003. 20th annual symposium of theoretical aspects on computer science, Berlin, Germany, February 27 – March 1, 2003. Proceedings. Berlin: Springer (ISBN 3-540-00623-0/pbk). Lect. Notes Comput. Sci. 2607, 97-108 (2003).
PDFBibTeX XMLCite
Full Text: Link

A generalized quantifier concept in computational complexity theory. (English) Zbl 0967.03035

Väänänen, Jouko (ed.), Generalized quantifiers and computation. 9th European summer school in Logic, language, and information, ESSLLI ’97 workshop, Aix-en-Provence, France, August 11-22, 1997. Revised lectures. Berlin: Springer. Lect. Notes Comput. Sci. 1754, 99-123 (1999).
Reviewer: U.Schöning (Ulm)
PDFBibTeX XMLCite

Descriptive complexity theory over the real numbers. (English) Zbl 0861.03034

Renegar, James (ed.) et al., The mathematics of numerical analysis. 1995 AMS-SIAM summer seminar in applied mathematics, July 17–August 11, 1995, Park City, UT, USA. Providence, RI: American Mathematical Society. Lect. Appl. Math. 32, 381-403 (1996).
MSC:  03D15 68Q15 68Q05 03C13
PDFBibTeX XMLCite

Filter Results by …

Document Type

Database

all top 5

Author

all top 5

Year of Publication

all top 3

Main Field

all top 3

Software