The following pages link to Szilárd Zsolt Fazekas (Q269782):
Displayed 28 items.
- On computational complexity of graph inference from counting (Q269786) (← links)
- The pseudopalindromic completion of regular languages (Q476182) (← links)
- Clusters of repetition roots: single chains (Q831839) (← links)
- The power of programmed grammars with graphs from various classes (Q854407) (← links)
- Two-way jumping automata (Q2037973) (← links)
- Clusters of repetition roots forming prefix chains (Q2112177) (← links)
- Square network on a word (Q2243587) (← links)
- Enhancement of automata with jumping modes (Q2278568) (← links)
- On the power of oritatami cotranscriptional folding with unary bead sequence (Q2327469) (← links)
- Two-way deterministic automata with jumping mode (Q2661767) (← links)
- On Chomsky Hierarchy of Palindromic Languages (Q2820788) (← links)
- A NOTE ON THE DECIDABILITY OF SUBWORD INEQUALITIES (Q2856016) (← links)
- POWERS OF REGULAR LANGUAGES (Q3086241) (← links)
- Hairpin Completion with Bounded Stem-Loop (Q3167515) (← links)
- ON INEQUALITIES BETWEEN SUBWORD HISTORIES (Q3526551) (← links)
- Bounds on Powers in Strings (Q3533012) (← links)
- NUMBER OF OCCURRENCES OF POWERS IN STRINGS (Q3586403) (← links)
- Powers of Regular Languages (Q3637227) (← links)
- ON NON-PRIMITIVE PALINDROMIC CONTEXT-FREE LANGUAGES (Q4923280) (← links)
- Scattered subword complexity of non-primitive words (Q5192983) (← links)
- On the Prefix–Suffix Duplication Reduction (Q5217116) (← links)
- (Q5740420) (← links)
- One-Way Jumping Finite Automata (Q5740533) (← links)
- (Q5867520) (← links)
- The effect of jumping modes on various automata models (Q6155031) (← links)
- Linear Bounds on the Size of Conformations in Greedy Deterministic Oritatami (Q6169891) (← links)
- Sweep complexity revisited (Q6199868) (← links)
- Freezing 1-Tag Systems with States (Q6204127) (← links)