Symbolic computations on first-order definable objects
2016/21/B/ST6/01505
Keywords
Descriptors
- ST6_4: Metody formalne, teoretyczne podstawy informatyki w tym informatyka teoretyczna
- ST1_15: Matematyczne aspekty informatyki
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
Principal investigator (from the host institution)
prof. Sławomir Grzegorz Lasota
Number of co-investigators in the project: 6
Call
OPUS 11 – announced on 2016-03-15
- Amount awarded
- 599 600 PLN
- Project start date
- 2017-02-14
- Project end date
- 2020-04-13
- Project duration
- 38 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]
- Komputery przenośne (3 pcs). Cost: 17 074 PLN
- Tablet. Cost: 4 511 PLN
Information in the final report
Publication in academic press/journals (3)
-
Definable isomorphism problem
- Authors:
- Keshvardoost, Khadijeh; Klin, Bartek; Lasota, Sławomir; Ochremiak, Joanna and Toruńczyk, Szymon
- Academic press:
- Logical Methods in Computer Science (year: 2019, volume: 15(4), pages: 14:1--14:19), Publisher: Free Journal Network
- Status:
- Published
- DOI:
- 10.23638/LMCS-15(4:14)2019 – link to the publication
-
WQO Dichotomy for 3-graphs
- Authors:
- S.Lasota, R.Piórkowski
- Status:
- Accepted for publication
-
Binary reachability of timed-register pushdown automata, and branching vector addition systems
- Authors:
- Lorenzo Clemente, Sławomir Lasota, Ranko Lazic, Filip Mazowiecki
- Status:
- Accepted for publication
Articles in post-conference publications (6)
-
Regular Separability of Parikh Automata
- Authors:
- L.Clemente, W.Czerwinski, S.Lasota, C.Paperman
- Conference:
- ICALP'17 (year: 2017, pages: 117:1--117:13), Publisher: LIPIcs
- Date:
- conference 10-14.07.2017
- Status:
- Published
- DOI:
- link to the publication
-
Timed pushdown automata and branching vector addition systems
- Authors:
- L.Clemente, S.Lasota, R.Lazic, F.Mazowiecki
- Conference:
- LICS'17 (year: 2017, pages: b.d.), Publisher: ACM/IEEE
- Date:
- conference 20-23.06.2017
- Status:
- Published
-
Unboundedness problems for languages of vector addition systems
- Authors:
- Wojciech Czerwiński, Piotr Hofman, Georg Zetzsche
- Conference:
- ICALP 2018 (year: 2018, pages: 119:1-119:15), Publisher: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik
- Date:
- conference 9-13.07.2018
- Status:
- Published
- DOI:
- link to the publication
-
Linear Equations with Ordered Data
- Authors:
- Piotr Hofman, Sławomir Lasota
- Conference:
- CONCUR 2018 (year: 2018, pages: 24:1-24:17), Publisher: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik
- Date:
- conference 4-7.09.2018
- Status:
- Published
- DOI:
- link to the publication
-
WQO dichotomy for 3-graphs
- Authors:
- S.Lasota, R.Piórkowski
- Conference:
- FOSSACS'18 (year: 2018, pages: 548-564), Publisher: Springer
- Status:
- Accepted for publication
-
Binary Reachability of Timed Pushdown Automata via Quantifier Elimination and Cyclic Order Atoms
- Authors:
- Lorenzo Clemente, Sławomir Lasota
- Conference:
- ICALP 2018 (year: 2018, pages: 118:1-118:14), Publisher: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik
- Status:
- Accepted for publication