Bounds on Powers in Strings. - Maxime Crochemore; Szilárd Zsolt Fazekas; Costas S. Iliopoulos; Inuka Jayasekera (Developments in Language Theory, 2008)

On Inequalities between Subword Histories. - Szilárd Zsolt Fazekas (Int. J. Found. Comput. Sci., 2008)

Scattered Subword Complexity of non-Primitive Words. - Szilárd Zsolt Fazekas; Benedek Nagy (J. Autom. Lang. Comb., 2008)

Number of Occurrences of powers in Strings. - Maxime Crochemore; Szilárd Zsolt Fazekas; Costas S. Iliopoulos; Inuka Jayasekera (Int. J. Found. Comput. Sci., 2010)

Repetitive subwords. - Szilárd Zsolt Fazekas (2010)

Palindromes and Primitivity. - Szilárd Zsolt Fazekas; Peter Leupold; Kayoko Shikishima-Tsuji (AFL, 2011)

Powers of Regular Languages. - Szilárd Zsolt Fazekas (Int. J. Found. Comput. Sci., 2011)

Hairpin Completion with Bounded Stem-Loop. - Szilárd Zsolt Fazekas; Robert Mercas; Kayoko Shikishima-Tsuji (Developments in Language Theory, 2012)

On Non-Primitive Palindromic Context-Free Languages. - Szilárd Zsolt Fazekas; Peter Leupold; Kayoko Shikishima-Tsuji (Int. J. Found. Comput. Sci., 2012)

A Note on the Decidability of subword inequalities. - Szilárd Zsolt Fazekas; Robert Mercas (Int. J. Found. Comput. Sci., 2013)

On computational complexity of graph inference from counting. - Szilárd Zsolt Fazekas; Hiro Ito; Yasushi Okuno; Shinnosuke Seki 001; Kei Taneishi (Nat. Comput., 2013)

Some Results on Bounded Context-Free Languages. - Pál Dömösi; Szilárd Zsolt Fazekas; Zita Kovács (Discrete Mathematics and Computer Science, 2014)

The pseudopalindromic completion of regular languages. - Szilárd Zsolt Fazekas; Florin Manea; Robert Mercas; Kayoko Shikishima-Tsuji (Inf. Comput., 2014)

Comparative Study of Monte-Carlo Tree Search and Alpha-Beta Pruning in Amazons. - Hikari Kato; Szilárd Zsolt Fazekas; Mayumi Takaya; Akihiro Yamamura (ICT-EurAsia/CONFENIS, 2015)

On Chomsky Hierarchy of Palindromic Languages. - Pál Dömösi; Szilárd Zsolt Fazekas; Masami Ito (Acta Cybern., 2016)

One-Way Jumping Finite Automata. - Hiroyuki Chigahara; Szilárd Zsolt Fazekas; Akihiro Yamamura (Int. J. Found. Comput. Sci., 2016)

Preface. - Szilárd Zsolt Fazekas; Kayoko Shikishima-Tsuji; Akihiro Yamamura (Int. J. Found. Comput. Sci., 2016)

Enhancement of Automata with Jumping Modes. - Szilárd Zsolt Fazekas; Kaito Hoshi; Akihiro Yamamura (Automata, 2019)

On the Power of Oritatami Cotranscriptional Folding with Unary Bead Sequence. - Szilárd Zsolt Fazekas; Kohei Maruyama; Reoto Morita; Shinnosuke Seki 001 (TAMC, 2019)

Two-Way Jumping Automata. - Szilárd Zsolt Fazekas; Kaito Hoshi; Akihiro Yamamura (FAW, 2020)

On the Prefix-Suffix Duplication Reduction. - Szilárd Zsolt Fazekas; Robert Mercas; Daniel Reidenbach (Int. J. Found. Comput. Sci., 2020)

Clusters of Repetition Roots: Single Chains. - Szilárd Zsolt Fazekas; Robert Mercas (SOFSEM, 2021)

Linear Bounds on the Size of Conformations in Greedy Deterministic Oritatami. - Szilárd Zsolt Fazekas; Hwee Kim; Ryuichi Matsuoka; Reoto Morita; Shinnosuke Seki 001 (Int. J. Found. Comput. Sci., 2021)

Preface. - Szilárd Zsolt Fazekas (J. Autom. Lang. Comb., 2021)

Two-way deterministic automata with jumping mode. - Szilárd Zsolt Fazekas; Kaito Hoshi; Akihiro Yamamura (Theor. Comput. Sci., 2021)

Square network on a word. - Szilárd Zsolt Fazekas; Shinnosuke Seki 001 (Theor. Comput. Sci., 2021)

Clusters of Repetition Roots Forming Prefix Chains. - Szilárd Zsolt Fazekas; Robert Mercas (DCFS, 2022)

On Algorithmic Self-Assembly of Squares by Co-Transcriptional Folding. - Szilárd Zsolt Fazekas; Hwee Kim; Ryuichi Matsuoka; Shinnosuke Seki 001; Hinano Takeuchi (ISAAC, 2022)

Complexities for Jumps and Sweeps. - Szilárd Zsolt Fazekas; Robert Mercas; Olívia Wu (J. Autom. Lang. Comb., 2022)

The effect of jumping modes on various automata models. - Szilárd Zsolt Fazekas; Kaito Hoshi; Akihiro Yamamura (Nat. Comput., 2022)

Sweep Complexity Revisited. - Szilárd Zsolt Fazekas; Robert Mercas (CIAA, 2023)

Freezing 1-Tag Systems with States. - Szilárd Zsolt Fazekas; Shinnosuke Seki 001 (AFL, 2023)

Generalized Parikh Matrices for Tracking Subsequence Occurrences. - Szilárd Zsolt Fazekas; Xinhao Huang (ICTAC, 2024)

Jump Complexity of Deterministic Finite Automata with Translucent Letters. - Szilárd Zsolt Fazekas; Victor Mitrana; Andrei Paun; Mihaela Paun (ICTAC, 2024)

Subsequence Matching and Analysis Problems for Formal Languages. - Szilárd Zsolt Fazekas; Tore Koß; Florin Manea; Robert Mercas; Timo Specht (ISAAC, 2024)

Towards composable computations by RNA co-transcriptional folding: A proof-of-concept demonstration of nested loops in oritatami. - Szilárd Zsolt Fazekas; Naoya Iwano; Yu Kihara; Ryuichi Matsuoka; Shinnosuke Seki 001; Hinano Takeuchi (Theor. Comput. Sci., 2024)

Programmable Co‑Transcriptional Splicing: Realizing Regular Languages via Hairpin Deletion. - Da-Jung Cho; Szilárd Zsolt Fazekas; Shinnosuke Seki 001; Max Wiedenhöft (DNA, 2025)

Subsequence Matching and Analysis Problems for Automata with Translucent Letters. - Szilárd Zsolt Fazekas; Béla Klein; Tore Koß; Florin Manea; Robert Mercas; Timo Specht (CIAA, 2025)

A Formalization of Co-Transcriptional Splicing as an Operation on Formal Languages. - Da-Jung Cho; Szilárd Zsolt Fazekas; Shinnosuke Seki 001; Max Wiedenhöft (CoRR, 2025)