The following pages link to Marcin Piątkowski (Q496557):
Displaying 21 items.
- Computing the number of cubic runs in standard Sturmian words (Q496558) (← links)
- Tighter bounds for the sum of irreducible LCP values (Q507409) (← links)
- The maximal number of runs in standard Sturmian words (Q1953392) (← links)
- Formal translation from reversing Petri nets to coloured Petri nets (Q2097427) (← links)
- String inference from longest-common-prefix array (Q2110373) (← links)
- Generating all minimal Petri net unsolvable binary words (Q2295623) (← links)
- Square-Free Words over Partially Commutative Alphabets (Q2799194) (← links)
- ASYMPTOTIC BEHAVIOUR OF THE MAXIMAL NUMBER OF SQUARES IN STANDARD STURMIAN WORDS (Q2909197) (← links)
- Tighter Bounds for the Sum of Irreducible LCP Values (Q2942269) (← links)
- Reversible Computation vs. Reversibility in Petri Nets (Q3186587) (← links)
- Diverse Palindromic Factorization Is NP-complete (Q3451091) (← links)
- The Number of Runs in Sturmian Words (Q3602820) (← links)
- USEFULNESS OF DIRECTED ACYCLIC SUBWORD GRAPHS IN PROBLEMS RELATED TO STANDARD STURMIAN WORDS (Q3655533) (← links)
- Reversing Transitions in Bounded Petri Nets (Q4637903) (← links)
- Diverse Palindromic Factorization is NP-Complete (Q4640035) (← links)
- Indexing the bijective BWT (Q5088907) (← links)
- String Inference from Longest-Common-Prefix Array (Q5111393) (← links)
- Conditions for Petri Net Solvable Binary Words (Q5268428) (← links)
- (Q5501011) (← links)
- (Q6098777) (← links)
- Constructing and indexing the bijective and extended Burrows-Wheeler transform (Q6204171) (← links)
