Understanding recursion

2017/26/D/ST6/00201

Keywords

Descriptors

  • ST6_4: Metody formalne, teoretyczne podstawy informatyki w tym informatyka teoretyczna
  • ST6_6: Algorytmika, algorytmy równoległe, rozproszone i sieciowe, algorytmiczna teoria gier

Panel

ST6 – Computer science and informatics: informatics and information systems, computer science, scientific computing, intelligent systems

Host institution

Uniwersytet Warszawski, Wydział Matematyki, Informatyki i Mechaniki

Voivodeship: mazowieckie

Other projects carried out by the institution »

Principal investigator (from the host institution)

dr Lorenzo Clemente

Number of co-investigators in the project: 4

Call

SONATA 13 – announced on 2017-06-14

Amount awarded
325 540 PLN
Project start date
2018-04-20
Project end date
2023-04-19
Project duration
60 months (the same as in the proposal)
Project status
Project settled

Project description

Download the project description in a pdf file

Note — project descriptions were prepared by the authors of the applications themselves and placed in the system in an unchanged form.

Equipment purchased [PL]

  1. Laptop. Cost: 8 000 PLN
  2. Tablet. Cost: 8 000 PLN

Information in the final report

Publication in academic press/journals (2)

  1. Determinisability of register and timed automata

    Authors:
    Lorenzo Clemente, Slawomir Lasota, Radoslaw Piórkowski
    Academic press:
    Log. Methods Comput. Sci. (year: 2022, volume: 18, pages: 37), Publisher: N/A
    Status:
    Published
    DOI:
    10.46298/lmcs-18(2:9)2022 – link to the publication
  2. Binary Reachability of Timed-register Pushdown Automata and Branching Vector Addition Systems

    Authors:
    Lorenzo Clemente, Sławomir Lasota, Ranko Lazić, Filip Mazowiecki
    Academic press:
    ACM Transactions on Computational Logic (TOCL) (year: 2019, volume: 20, pages: 31), Publisher: Association for Computing Machinery
    Status:
    Published
    DOI:
    10.1145/3326161 – link to the publication

Articles in post-conference publications (9)

  1. Timed Games and Deterministic Separability

    Authors:
    Clemente, Lorenzo ; Lasota, Sławomir ; Piórkowski, Radosław
    Conference:
    47th International Colloquium on Automata, Languages, and Programming (ICALP 2020) (year: 2020, pages: 16), Publisher: Schloss Dagstuhl--Leibniz-Zentrum f{u}r Informatik
    Date:
    conference 44050
    Status:
    Published
  2. On the Complexity of the Universality and Inclusion Problems for Unambiguous Context-Free Grammars

    Authors:
    Lorenzo Clemente
    Conference:
    Proceedings of VPT/HCVS 2020 (year: 2020, pages: 15), Publisher: EPTCS
    Date:
    conference 25-04-2020
    Status:
    Published
  3. Determinisability of One-Clock Timed Automata

    Authors:
    Lorenzo Clemente, Sławomir Lasota, Radosław Piórkowski
    Conference:
    31st International Conference on Concurrency Theory (CONCUR 2020) (year: 2020, pages: 17), Publisher: Leibniz International Proceedings in Informatics (LIPIcs)
    Date:
    conference 43839
    Status:
    Published
  4. On Rational Recursive Sequences

    Authors:
    Lorenzo Clemente, Maria Donten-Bury, Filip Mazowiecki, Michal Pilipczuk
    Conference:
    40th International Symposium on Theoretical Aspects of Computer Science (year: 2023, pages: 24), Publisher: Schloss Dagstuhl -- Leibniz-Zentrum fur Informatik
    Date:
    conference 07-03-2023 -- 09-03-2023
    Status:
    Published
  5. Bidimensional Linear Recursive Sequences and Universality of Unambiguous Register Automata

    Authors:
    Corentin Barloy, Lorenzo Clement
    Conference:
    38th International Symposium on Theoretical Aspects of Computer Science (STACS 2021) (year: 2021, pages: 12), Publisher: Schloss Dagstuhl -- Leibniz-Zentrum f{u}r Informatik
    Date:
    conference 16 -- 18/03/2021
    Status:
    Published
  6. Deterministic and Game Separability for Regular Languages of Infinite Trees

    Authors:
    Lorenzo Clemente, Michał Skrzypczak
    Conference:
    Proceedings of 48th International Colloquium on Automata, Languages, and Programming (ICALP 2021) (year: 2021, pages: 15), Publisher: Schloss Dagstuhl -- Leibniz-Zentrum f{u}r Informatik
    Date:
    conference 12 -- 16/07/2021
    Status:
    Published
  7. Multiplicity Problems on Algebraic Series and Context-Free Grammars

    Authors:
    Nikhil Balaji, Lorenzo Clemente, Klara Nosan, Mahsa Shirmohammadi, James Worrell
    Conference:
    Thirty-Eighth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) (year: 2023, pages: 12), Publisher: IEEE
    Date:
    conference 26-29 June 2023
    Status:
    Published
  8. Timed Basic Parallel Processes

    Authors:
    Lorenzo Clemente, Piotr Hofman, Patrick Totzke
    Conference:
    30th International Conference on Concurrency Theory (CONCUR 2019) (year: 2019, pages: 16), Publisher: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
    Date:
    conference 26-31 August 2019
    Status:
    Published
  9. Binary reachability of timed pushdown automata via quantifier elimination and cyclic order atoms

    Authors:
    Lorenzo Clemente and Sławomir Lasota
    Conference:
    ICALP 2018 (year: 2018, pages: 118:1--118:14), Publisher: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
    Date:
    conference From 09-07-2018 to 13-07-2018
    Status:
    Published

« New search

Graphic design and implementation: Jakub Piotrowski