default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSzilárd Zsolt Fazekas
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j19]Szilárd Zsolt Fazekas, Naoya Iwano, Yu Kihara, Ryuichi Matsuoka, Shinnosuke Seki, Hinano Takeuchi:
Towards composable computations by RNA co-transcriptional folding: A proof-of-concept demonstration of nested loops in oritatami. Theor. Comput. Sci. 999: 114550 (2024)- [c17]Szilárd Zsolt Fazekas, Victor Mitrana, Andrei Paun, Mihaela Paun:
Jump Complexity of Deterministic Finite Automata with Translucent Letters. ICTAC 2024: 62-77 - [c16]Szilárd Zsolt Fazekas, Xinhao Huang:
Generalized Parikh Matrices for Tracking Subsequence Occurrences. ICTAC 2024: 164-181 - [c15]Szilárd Zsolt Fazekas, Tore Koß, Florin Manea, Robert Mercas, Timo Specht:
Subsequence Matching and Analysis Problems for Formal Languages. ISAAC 2024: 28:1-28:23 - [e2]Szilárd Zsolt Fazekas
:
Implementation and Application of Automata - 28th International Conference, CIAA 2024, Akita, Japan, September 3-6, 2024, Proceedings. Lecture Notes in Computer Science 15015, Springer 2024, ISBN 978-3-031-71111-4 [contents] - [i3]Szilárd Zsolt Fazekas, Xinhao Huang:
Generalized Parikh Matrices For Tracking Subsequence Occurrences. CoRR abs/2407.04462 (2024) - [i2]Szilárd Zsolt Fazekas, Tore Koß, Florin Manea, Robert Mercas, Timo Specht:
Subsequence Matching and Analysis Problems for Formal Languages. CoRR abs/2410.07992 (2024) - 2023
- [c14]Szilárd Zsolt Fazekas, Robert Mercas:
Sweep Complexity Revisited. CIAA 2023: 116-127 - [c13]Szilárd Zsolt Fazekas, Shinnosuke Seki:
Freezing 1-Tag Systems with States. AFL 2023: 82-95 - [i1]Szilárd Zsolt Fazekas, Robert Mercas:
Sweep Complexity Revisited. CoRR abs/2308.06683 (2023) - 2022
- [j18]Szilárd Zsolt Fazekas, Robert Mercas, Olívia Wu:
Complexities for Jumps and Sweeps. J. Autom. Lang. Comb. 27(1-3): 131-149 (2022) - [j17]Szilárd Zsolt Fazekas, Kaito Hoshi, Akihiro Yamamura:
The effect of jumping modes on various automata models. Nat. Comput. 21(1): 17-30 (2022) - [c12]Szilárd Zsolt Fazekas, Robert Mercas:
Clusters of Repetition Roots Forming Prefix Chains. DCFS 2022: 43-56 - [c11]Szilárd Zsolt Fazekas, Hwee Kim, Ryuichi Matsuoka, Shinnosuke Seki, Hinano Takeuchi:
On Algorithmic Self-Assembly of Squares by Co-Transcriptional Folding. ISAAC 2022: 37:1-37:15 - 2021
- [j16]Szilárd Zsolt Fazekas, Hwee Kim, Ryuichi Matsuoka, Reoto Morita, Shinnosuke Seki:
Linear Bounds on the Size of Conformations in Greedy Deterministic Oritatami. Int. J. Found. Comput. Sci. 32(5): 575-596 (2021) - [j15]Szilárd Zsolt Fazekas:
Preface. J. Autom. Lang. Comb. 26(1-2): 3-5 (2021) - [j14]Szilárd Zsolt Fazekas, Kaito Hoshi, Akihiro Yamamura:
Two-way deterministic automata with jumping mode. Theor. Comput. Sci. 864: 92-102 (2021) - [j13]Szilárd Zsolt Fazekas, Shinnosuke Seki:
Square network on a word. Theor. Comput. Sci. 894: 121-134 (2021) - [c10]Szilárd Zsolt Fazekas, Robert Mercas:
Clusters of Repetition Roots: Single Chains. SOFSEM 2021: 400-409 - 2020
- [j12]Szilárd Zsolt Fazekas, Robert Mercas, Daniel Reidenbach:
On the Prefix-Suffix Duplication Reduction. Int. J. Found. Comput. Sci. 31(1): 91-102 (2020) - [c9]Szilárd Zsolt Fazekas, Kaito Hoshi, Akihiro Yamamura:
Two-Way Jumping Automata. FAW 2020: 108-120
2010 – 2019
- 2019
- [c8]Szilárd Zsolt Fazekas, Kaito Hoshi, Akihiro Yamamura:
Enhancement of Automata with Jumping Modes. Automata 2019: 62-76 - [c7]Szilárd Zsolt Fazekas, Kohei Maruyama, Reoto Morita, Shinnosuke Seki:
On the Power of Oritatami Cotranscriptional Folding with Unary Bead Sequence. TAMC 2019: 188-207 - 2016
- [j11]Pál Dömösi, Szilárd Zsolt Fazekas, Masami Ito:
On Chomsky Hierarchy of Palindromic Languages. Acta Cybern. 22(3): 703-713 (2016) - [j10]Szilárd Zsolt Fazekas, Kayoko Shikishima-Tsuji, Akihiro Yamamura:
Preface. Int. J. Found. Comput. Sci. 27(3): 301-304 (2016) - [j9]Hiroyuki Chigahara, Szilárd Zsolt Fazekas, Akihiro Yamamura:
One-Way Jumping Finite Automata. Int. J. Found. Comput. Sci. 27(3): 391- (2016) - 2015
- [c6]Hikari Kato, Szilárd Zsolt Fazekas, Mayumi Takaya, Akihiro Yamamura:
Comparative Study of Monte-Carlo Tree Search and Alpha-Beta Pruning in Amazons. ICT-EurAsia/CONFENIS 2015: 139-148 - 2014
- [j8]Szilárd Zsolt Fazekas, Florin Manea, Robert Mercas, Kayoko Shikishima-Tsuji:
The pseudopalindromic completion of regular languages. Inf. Comput. 239: 222-236 (2014) - [c5]Pál Dömösi, Szilárd Zsolt Fazekas, Zita Kovács:
Some Results on Bounded Context-Free Languages. Discrete Mathematics and Computer Science 2014: 119-136 - 2013
- [j7]Szilárd Zsolt Fazekas, Robert Mercas:
A Note on the Decidability of subword inequalities. Int. J. Found. Comput. Sci. 24(4): 445-452 (2013) - [j6]Szilárd Zsolt Fazekas, Hiro Ito, Yasushi Okuno, Shinnosuke Seki, Kei Taneishi:
On computational complexity of graph inference from counting. Nat. Comput. 12(4): 589-603 (2013) - 2012
- [j5]Szilárd Zsolt Fazekas, Peter Leupold, Kayoko Shikishima-Tsuji:
On Non-Primitive Palindromic Context-Free Languages. Int. J. Found. Comput. Sci. 23(6): 1277-1290 (2012) - [c4]Szilárd Zsolt Fazekas, Robert Mercas, Kayoko Shikishima-Tsuji:
Hairpin Completion with Bounded Stem-Loop. Developments in Language Theory 2012: 428-439 - 2011
- [j4]Szilárd Zsolt Fazekas:
Powers of Regular Languages. Int. J. Found. Comput. Sci. 22(2): 323-330 (2011) - [c3]Szilárd Zsolt Fazekas, Peter Leupold, Kayoko Shikishima-Tsuji:
Palindromes and Primitivity. AFL 2011: 184-196 - 2010
- [b1]Szilárd Zsolt Fazekas:
Repetitive subwords. University of Rovira i Virgili, Spain, 2010 - [j3]Maxime Crochemore, Szilárd Zsolt Fazekas, Costas S. Iliopoulos, Inuka Jayasekera:
Number of Occurrences of powers in Strings. Int. J. Found. Comput. Sci. 21(4): 535-547 (2010)
2000 – 2009
- 2009
- [c2]Szilárd Zsolt Fazekas:
Powers of Regular Languages. Developments in Language Theory 2009: 221-227 - 2008
- [j2]Szilárd Zsolt Fazekas:
On Inequalities between Subword Histories. Int. J. Found. Comput. Sci. 19(4): 1039-1047 (2008) - [j1]Szilárd Zsolt Fazekas, Benedek Nagy:
Scattered Subword Complexity of non-Primitive Words. J. Autom. Lang. Comb. 13(3/4): 233-247 (2008) - [c1]Maxime Crochemore, Szilárd Zsolt Fazekas, Costas S. Iliopoulos, Inuka Jayasekera:
Bounds on Powers in Strings. Developments in Language Theory 2008: 206-215 - 2007
- [e1]Remco Loos, Szilárd Zsolt Fazekas, Carlos Martín-Vide:
LATA 2007. Proceedings of the 1st International Conference on Language and Automata Theory and Applications. Research Group on Mathematical Linguistics, Universitat Rovira i Virgili, Tarragona 2007 [contents]
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 13:17 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
