Zobrazeno 1 - 10
of 22
pro vyhledávání: '"Mikolaj Bojanczyk"'
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 223, Iss Proc. ICE 2016, Pp 1-23 (2016)
Subzero automata is a class of tree automata whose acceptance condition can express probabilistic constraints. Our main result is that the problem of determining if a subzero automaton accepts some regular tree is decidable.
Externí odkaz:
https://doaj.org/article/41e1618aa939453283feac141bf52a08
Publikováno v:
Logical Methods in Computer Science, Vol Volume 8, Issue 3 (2012)
We use the recently developed theory of forest algebras to find algebraic characterizations of the languages of unranked trees and forests definable in various logics. These include the temporal logics CTL and EF, and first-order logic over the ances
Externí odkaz:
https://doaj.org/article/5cdbbadc51304f259610407358ec04a3
Autor:
Mikolaj Bojanczyk, Luc Segoufin
Publikováno v:
Logical Methods in Computer Science, Vol Volume 6, Issue 4 (2010)
We study tree languages that can be defined in \Delta_2 . These are tree languages definable by a first-order formula whose quantifier prefix is forall exists, and simultaneously by a first-order formula whose quantifier prefix is . For the quantifie
Externí odkaz:
https://doaj.org/article/b70412283e974614a95773d3af9dec23
Autor:
Mikolaj Bojanczyk
Publikováno v:
Logical Methods in Computer Science, Vol Volume 5, Issue 3 (2009)
We consider a temporal logic EF+F^-1 for unranked, unordered finite trees. The logic has two operators: EF\phi, which says "in some proper descendant \phi holds", and F^-1\phi, which says "in some proper ancestor \phi holds". We present an algorithm
Externí odkaz:
https://doaj.org/article/5d4c317d7f9944f8b18c5930701c4828
Autor:
Mikołaj Bojańczyk, Alex Simpson
This open access book constitutes the proceedings of the 22nd International Conference on Foundations of Software Science and Computational Structures, FOSSACS 2019, which took place in Prague, Czech Republic, in April 2019, held as part of the Europ
Autor:
Mikolaj Bojanczyk
Publikováno v:
Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::05bb0f05e18238a20256046ddb1348d3
https://doi.org/10.1145/3531130.3533326
https://doi.org/10.1145/3531130.3533326
Autor:
Mikolaj Bojanczyk
Publikováno v:
ICALP
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::f663929036d2399f9ffd46bb6dcc4806
https://doi.org/https://doi.org/10.4230/lipics.icalp.2017.1
https://doi.org/https://doi.org/10.4230/lipics.icalp.2017.1
Publikováno v:
Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) - CSL-LICS '14.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=erc_________::e47e7202db3f602c7872c5e83a8d21a0
Autor:
Mikolaj Bojanczyk, Szymon Torunczyk
We define an imperative programming language, which extends while programs with a type for storing atoms or hereditarily orbit-finite sets. To deal with an orbit-finite set, the language has a loop construction, which is executed in parallel for all
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3c92d60114b26dedf265f6bb0965dac2
Autor:
Mikolaj Bojanczyk
We develop an algebraic theory for languages of data words. We prove that, under certain conditions, a language of data words is definable in first-order logic if and only if its syntactic monoid is aperiodic.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6bf1493cd1a0ca3b77d592f1d0008458
https://hal.science/hal-00573630
https://hal.science/hal-00573630