Publikacje

Czasopismo: Logical Methods In Computer Science

Liczba publikacji: 20

2018

• Matteo Mio, Michał Paweł Skrzypczak i Henryk Michalewski, Monadic Second Order Logic with Measure and Category Quantifiers, Logical Methods In Computer Science 14 (2) 2018.zobacz w PBN
• Eryk Kopczyński i Tony Tan, A note on first-order spectra with binary relations, Logical Methods In Computer Science 14 (2) 2018.zobacz w PBN

2017

• Anuj Dawar i Eryk Kopczyński, Bounded degree and planar spectra, Logical Methods In Computer Science Volume 13, Issue 4 2017.zobacz w PBN

2016

• Bartosz Klin i Jurriaan Rot, Coalgebraic trace semantics via forgetful logics, Logical Methods In Computer Science 12 (4) 2016, s. 1–34.zobacz w PBN
• Aleksy Andrzej Schubert, Paweł Urzyczyn i Konrad Zdanowski, On the Mints Hierarchy in First-Order Intuitionistic Logic, Logical Methods In Computer Science 12 (4) 2016, s. 1–25.zobacz w PBN
• Piotr Hofman, Sławomir Lasota, Richard Mayr i Patrick Totzke, Simulation Problems Over One-Counter Nets, Logical Methods In Computer Science 12 (1) 2016.zobacz w PBN

2015

• Eryk Kopczyński, Complexity of Problems of Commutative Grammars, Logical Methods In Computer Science 11 (1) 2015.zobacz w PBN

2014

• Samuel R. Buss i Leszek Aleksander Kołodziejczyk, Small stone in pool, Logical Methods In Computer Science 10 (2) 2014, s. 1–22.zobacz w PBN
• Mikołaj Bojańczyk, Bartosz Klin i Sławomir Lasota, Automata theory in nominal sets, Logical Methods In Computer Science 10 (3:4) 2014.zobacz w PBN
• Michał Paweł Skrzypczak, Separation Property for wB- and wS-regular Languages, Logical Methods In Computer Science 10 (1:8) 2014, s. 1–20.zobacz w PBN

2013

• Wojciech Czerwiński, Piotr Hofman i Sławomir Lasota, Reachability problem for weak multi-pushdown automata, Logical Methods In Computer Science 9 (3:13) 2013.zobacz w PBN
• Anuj Dawar, Eryk Kopczyński, Bjarki Holm, Erich Graedel i Wied Pakusa, Definability of linear equation systems over groups and rings, Logical Methods In Computer Science 9 (4) 2013, s. 12.zobacz w PBN

2012

• Mikołaj Bojańczyk i Sławomir Lasota, An extension of data automata that captures XPath, Logical Methods In Computer Science 8 (1) 2012.zobacz w PBN
• Paweł Parys i Igor Walukiewicz, Weak Alternating Timed Automata, Logical Methods In Computer Science 8 (3) 2012.zobacz w PBN
• Mikołaj Bojańczyk, Howard Straubing i Igor Walukiewicz, Wreath Products of Forest Algebras, with Applications to Tree Logics, Logical Methods In Computer Science 8 (3) 2012, s. 1–39.zobacz w PBN
• Mikołaj Bojańczyk, Luc Segoufin i Howard Straubing, Piecewise testable tree languages, Logical Methods In Computer Science 8 (3) 2012.zobacz w PBN

2010

• Mikołaj Bojańczyk i Luc Segoufin, Tree Languages Defined in First-Order Logic with One Quantifier Alternation, Logical Methods In Computer Science 6 (4) 2010, s. 1–26.zobacz w PBN

2009

• Mikołaj Bojańczyk, Two-Way Unary Temporal Logic over Trees, Logical Methods In Computer Science 5 (3) 2009, s. 1–29.zobacz w PBN

2008

• Filip Murlak, The Wadge Hierarchy of Deterministic Tree Languages, Logical Methods In Computer Science 4 (4) 2008, s. 1–44.zobacz w PBN
• Daria Walukiewicz-Chrząszcz i Jacek Chrząszcz, Consistency and completeness of rewriting in the Calculus of Constructions, Logical Methods In Computer Science 4 (3:8) 2008, s. 1–20.zobacz w PBN