Publikacje

Czasopismo: International Journal Of Foundations Of Computer Science

Liczba publikacji: 6

2018

• Henryk Michalewski i Michał Paweł Skrzypczak, On the Strength of Unambiguous Tree Automata, International Journal Of Foundations Of Computer Science 29 (5) 2018.zobacz w PBN
• Michał Adamczyk, Mai Alzamel, Panagiotis Charalampopoulos i Jakub Jan Radoszewski, Palindromic Decompositions with Gaps and Errors, International Journal Of Foundations Of Computer Science 29 (08) 2018, s. 1311–1329.zobacz w PBN

2012

• Marcin Piatkowski i Wojciech Rytter, Asymptotic Behaviour of the Maximal Number of Squares in Standard Sturmian Words, International Journal Of Foundations Of Computer Science 23 (2) 2012, s. 303–321.zobacz w PBN

2011

• Markku Laine i Wojciech Plandowski, Word Equations with One Unknown, International Journal Of Foundations Of Computer Science 22 (2) 2011, s. 345–375.zobacz w PBN

2009

• Marcin Piątkowski i Wojciech Rytter, Usefullness of directed acyclic graphs in problems related to standard Sturmian words, International Journal Of Foundations Of Computer Science 20 (6) 2009, s. 1005–1023.zobacz w PBN

2005

• Costas Iliopoulos, James MCHugh, Pierre Peterlongo, Nadia Pisanti, Wojciech Rytter i Marie-France Sagot, A first approach to finding common motifs with gaps, International Journal Of Foundations Of Computer Science 16 (6) 2005, s. 1145–1155.zobacz w PBN