The following pages link to Wojciech Plandowski (Q223816):
Displaying 29 items.
- Finding all solutions of equations in free groups and monoids with involution (Q342722) (← links)
- On word equations in one variable (Q547296) (← links)
- On the complexity of decidable cases of the commutation problem of languages (Q557812) (← links)
- Parallel tree-contraction and Fibonacci numbers (Q671622) (← links)
- Shortest synchronizing strings for Huffman codes (Q837184) (← links)
- On special families of morphisms related to \(\delta \)-matching and don't care symbols (Q1007535) (← links)
- Generalized factorizations of words and their algorithmic properties (Q1292486) (← links)
- (Q1336955) (redirect page) (← links)
- Speeding up two string-matching algorithms (Q1336956) (← links)
- On the size of independent systems of equations in semigroups (Q1351001) (← links)
- The zooming method: A recursive approach to time-space efficient string-matching (Q1367541) (← links)
- Algorithms for the parallel alternating direction access machine (Q1575740) (← links)
- Fast practical multi-pattern matching (Q1606976) (← links)
- A defect theorem for bi-infinite words. (Q1853742) (← links)
- The complexity of compressing subsegments of images described by finite automata (Q1861562) (← links)
- Locally periodic versus globally periodic infinite words (Q1865395) (← links)
- On the complexity of pattern matching for highly compressed two-dimensional texts. (Q1872708) (← links)
- Polynomial size test sets for context-free languages (Q1892201) (← links)
- On systems of word equations over three unknowns with at most six occurrences of one of the unknowns (Q2271428) (← links)
- On PSPACE generation of a solution set of a word equation and its applications (Q2326385) (← links)
- On the complexity of computation maximal exponent of periodicity of word equations and expressible relations (note) (Q2326386) (← links)
- (Q2708962) (← links)
- Two-variable word equations (Q2729626) (← links)
- Complete Characterization of Zero-expressible Functions (Q2804194) (← links)
- Satisfiability of word equations with constants is in NEXPTIME (Q2819601) (← links)
- An efficient algorithm for solving word equations (Q2931409) (← links)
- (Q3024808) (← links)
- WORD EQUATIONS WITH ONE UNKNOWN (Q3086244) (← links)
- Pattern-matching problems for 2-dimensional images described by finite automata (Q5055939) (← links)
