Szilárd Zsolt Fazekas

According to our database, Szilárd Zsolt Fazekas authored at least 34 papers between 2008 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

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, Hinano Takeuchi

Theor. Comput. Sci., 2024

Generalized Parikh Matrices For Tracking Subsequence Occurrences.

Szilárd Zsolt Fazekas, Xinhao Huang

CoRR, 2024

2023

Freezing 1-Tag Systems with States.

Szilárd Zsolt Fazekas, Shinnosuke Seki

Proceedings of the 16th International Conference on Automata and Formal Languages, 2023

Sweep Complexity Revisited.

Szilárd Zsolt Fazekas, Robert Mercas

Proceedings of the Implementation and Application of Automata, 2023

2022

The effect of jumping modes on various automata models.

Szilárd Zsolt Fazekas, Kaito Hoshi, Akihiro Yamamura

Nat. Comput., 2022

Complexities for Jumps and Sweeps.

Szilárd Zsolt Fazekas, Robert Mercas, Olívia Wu

J. Autom. Lang. Comb., 2022

On Algorithmic Self-Assembly of Squares by Co-Transcriptional Folding.

Szilárd Zsolt Fazekas, Hwee Kim, Ryuichi Matsuoka, Shinnosuke Seki, Hinano Takeuchi

Proceedings of the 33rd International Symposium on Algorithms and Computation, 2022

Clusters of Repetition Roots Forming Prefix Chains.

Szilárd Zsolt Fazekas, Robert Mercas

Proceedings of the Descriptional Complexity of Formal Systems, 2022

2021

Square network on a word.

Szilárd Zsolt Fazekas, Shinnosuke Seki

Theor. Comput. Sci., 2021

Two-way deterministic automata with jumping mode.

Szilárd Zsolt Fazekas, Kaito Hoshi, Akihiro Yamamura

Theor. Comput. Sci., 2021

Preface.

Szilárd Zsolt Fazekas

J. Autom. Lang. Comb., 2021

Linear Bounds on the Size of Conformations in Greedy Deterministic Oritatami.

Szilárd Zsolt Fazekas, Hwee Kim, Ryuichi Matsuoka, Reoto Morita, Shinnosuke Seki

Int. J. Found. Comput. Sci., 2021

Clusters of Repetition Roots: Single Chains.

Szilárd Zsolt Fazekas, Robert Mercas

Proceedings of the SOFSEM 2021: Theory and Practice of Computer Science, 2021

2020

On the Prefix-Suffix Duplication Reduction.

Szilárd Zsolt Fazekas, Robert Mercas, Daniel Reidenbach

Int. J. Found. Comput. Sci., 2020

Two-Way Jumping Automata.

Szilárd Zsolt Fazekas, Kaito Hoshi, Akihiro Yamamura

Proceedings of the Frontiers in Algorithmics - 14th International Workshop, 2020

2019

On the Power of Oritatami Cotranscriptional Folding with Unary Bead Sequence.

Szilárd Zsolt Fazekas, Kohei Maruyama, Reoto Morita, Shinnosuke Seki

Proceedings of the Theory and Applications of Models of Computation, 2019

Enhancement of Automata with Jumping Modes.

Szilárd Zsolt Fazekas, Kaito Hoshi, Akihiro Yamamura

Proceedings of the Cellular Automata and Discrete Complex Systems, 2019

2016

Preface.

Szilárd Zsolt Fazekas, Kayoko Shikishima-Tsuji, Akihiro Yamamura

Int. J. Found. Comput. Sci., 2016

One-Way Jumping Finite Automata.

Hiroyuki Chigahara, Szilárd Zsolt Fazekas, Akihiro Yamamura

Int. J. Found. Comput. Sci., 2016

On Chomsky Hierarchy of Palindromic Languages.

Pál Dömösi, Szilárd Zsolt Fazekas, Masami Ito

Acta Cybern., 2016

2015

Comparative Study of Monte-Carlo Tree Search and Alpha-Beta Pruning in Amazons.

Hikari Kato, Szilárd Zsolt Fazekas, Mayumi Takaya, Akihiro Yamamura

Proceedings of the Information and Communication Technology, 2015

2014

The pseudopalindromic completion of regular languages.

Szilárd Zsolt Fazekas, Florin Manea, Robert Mercas, Kayoko Shikishima-Tsuji

Inf. Comput., 2014

Some Results on Bounded Context-Free Languages.

Pál Dömösi, Szilárd Zsolt Fazekas, Zita Kovács

Proceedings of the Discrete Mathematics and Computer Science. In Memoriam Alexandru Mateescu (1952-2005)., 2014

2013

On computational complexity of graph inference from counting.

Szilárd Zsolt Fazekas, Hiro Ito, Yasushi Okuno, Shinnosuke Seki, Kei Taneishi

Nat. Comput., 2013

A Note on the Decidability of subword inequalities.

Szilárd Zsolt Fazekas, Robert Mercas

Int. J. Found. Comput. Sci., 2013

2012

On Non-Primitive Palindromic Context-Free Languages.

Szilárd Zsolt Fazekas, Peter Leupold, Kayoko Shikishima-Tsuji

Int. J. Found. Comput. Sci., 2012

Hairpin Completion with Bounded Stem-Loop.

Szilárd Zsolt Fazekas, Robert Mercas, Kayoko Shikishima-Tsuji

Proceedings of the Developments in Language Theory - 16th International Conference, 2012

2011

Powers of Regular Languages.

Szilárd Zsolt Fazekas

Int. J. Found. Comput. Sci., 2011

Palindromes and Primitivity.

Szilárd Zsolt Fazekas, Peter Leupold, Kayoko Shikishima-Tsuji

Proceedings of the Automata and Formal Languages, 13th International Conference, 2011

2010

Repetitive subwords.

Szilárd Zsolt Fazekas

PhD thesis, 2010

Number of Occurrences of powers in Strings.

Maxime Crochemore, Szilárd Zsolt Fazekas, Costas S. Iliopoulos, Inuka Jayasekera

Int. J. Found. Comput. Sci., 2010

2008

Scattered Subword Complexity of non-Primitive Words.

Szilárd Zsolt Fazekas, Benedek Nagy

J. Autom. Lang. Comb., 2008

On Inequalities between Subword Histories.

Szilárd Zsolt Fazekas

Int. J. Found. Comput. Sci., 2008

Bounds on Powers in Strings.

Maxime Crochemore, Szilárd Zsolt Fazekas, Costas S. Iliopoulos, Inuka Jayasekera

Proceedings of the Developments in Language Theory, 12th International Conference, 2008