FAZEKAS SZILARD ZSOLT

写真a

Affiliation

Graduate School of Engineering Science  Department of Mathematical Science and Electrical-Electronic-Computer Engineering  Mathematical Science Course 

Laboratory Address

1-1, Tegata Gakuen-machi, Akita, Japan

Laboratory Phone number

2474

Mail Address

E-mail address

To the head of this page.▲

Research Interests 【 display / non-display 】

  • Combinatorics on words

  • Molecular computing

  • String algorithms

  • formal languages

  • automata

display all >>

To the head of this page.▲

Graduating School 【 display / non-display 】

  • 1998.09
    -
    2003.06

    University of Debrecen   Faculty of Science   Institute of Mathematics and Informatics   Graduated

To the head of this page.▲

Graduate School 【 display / non-display 】

  • 2004.04
    -
    2010.02

    Rovira i Virgili University  International PhD School in Formal Languages and Applications  Doctor's Course  Completed

To the head of this page.▲

Degree 【 display / non-display 】

  • Rovira i Virgili University -  PhD

  • University of Debrecen -  M. Sc. Software Engineering

To the head of this page.▲

Campus Career 【 display / non-display 】

  • 2013.10
    -
    2020.03

    Akita University   Abolished organization   Graduate School of Engineering and Resource Science   Akita University   Lecturer  

  • 2020.04
    -
    Now

    Akita University   Graduate School of Engineering Science   Department of Mathematical Science and Electrical-Electronic-Computer Engineering   Mathematical Science Course   Associate Professor  

To the head of this page.▲

External Career 【 display / non-display 】

  • 2013.10
    -
    2020.03

    Akita University   Lecturer  

To the head of this page.▲

Academic Society Affiliations 【 display / non-display 】

  • 2019.10
    -
    Now
     

    Japan

     

    IPSJ

To the head of this page.▲
 

Thesis for a degree 【 display / non-display 】

  • Repetitive subwords

    Szilárd Zsolt Fazekas 

      2010.02

    Single author

To the head of this page.▲

Research Achievements 【 display / non-display 】

    ◆Original paper【 display / non-display 】

  • 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

    Theoretical Computer Science ( Elsevier )  999   114550 - 114550   2024.06  [Refereed]

    Research paper (journal)  

    Gliders have been underpinning various computations in oritatami, a model of computation by letting an RNA sequence fold while being synthesized (transcribed). It has proven quite powerful to let them shrink and stretch, shifting the (abstraction of the) RNA sequence in the direction of synthesis. Here we demonstrate how easy-to-program and versatile it is to merely combine such elastic gliders by thus building up a binary counter, which is used as a for-loop, and an interface to nest such counters.

    DOI DOI2

  • Complexities for jumps and sweeps

    Fazekas S.Z., Mercas R.

    Journal of Automata, Languages and Combinatorics ( Justus-Liebig-Universität Giessen )  27 ( 1-3 ) 131 - 149   2022.08  [Refereed]

    Research paper (journal)   International Co-author

    DOI

  • The effect of jumping modes on various automata models

    Fazekas S.Z., Hoshi K., Yamamura A.

    Natural Computing ( Springer )  21   17 - 30   2022.03  [Refereed]

    Research paper (journal)   Domestic Co-author

    DOI

  • Square network on a word

    Fazekas S.Z., Seki S.

    Theoretical Computer Science ( Elsevier )  894   121 - 134   2021.11  [Refereed]

    Research paper (journal)  

    DOI

  • Linear bounds on the size of conformations in greedy deterministic oritatami

    Fazekas S.Z., Kim H., Matsuoka R., Morita R., Seki S.

    International Journal of Foundations of Computer Science ( World Scientific )  32 ( 5 ) 575 - 596   2021.08  [Refereed]

    Research paper (journal)  

    DOI

    • display all >>

    To the head of this page.▲

    ◆Introduction and explanation【 display / non-display 】

  • SPECIAL ISSUE DEDICATED TO MASAMI ITO AND PÁL DÖMÖSI

    Fazekas S.

    Journal of Automata, Languages and Combinatorics ( Journal of Automata, Languages and Combinatorics )  26 ( 1-2 ) 3 - 5   2021

    Introduction and explanation (scientific journal)   Single author

    DOI

    • To the head of this page.▲

    ◆International conference proceedings【 display / non-display 】

  • Subsequence Matching and Analysis Problems for Formal Languages

    Fazekas S.Z., T. Koss, F. Manea, R. Mercas, T. Specht

    Leibniz International Proceedings in Informatics, LIPIcs ( Leibniz International Proceedings in Informatics, LIPIcs )  322   28 - 23   2024.12  [Refereed]

    Research paper (international conference proceedings)   International Co-author

    DOI

  • Generalized Parikh Matrices for Tracking Subsequence Occurrences

    S.Z. Fazekas, X. Huang

    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) ( Springer )  15373 LNCS   164 - 181   2024.11  [Refereed]

    Research paper (international conference proceedings)   International Co-author

    DOI

  • Jump Complexity of Deterministic Finite Automata with Translucent Letters

    S.Z. Fazekas, V. Mitrana

    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) ( Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) )  15373 LNCS   62 - 77   2024.11  [Refereed]

    Research paper (international conference proceedings)   International Co-author

    DOI

  • Automated Extraction of Sediment Core and Scale Segments from Core Scanner Images

    S.Z. Fazekas, S. Isawa, S. Obrochta

    2023 15th International Conference on Information Technology and Electrical Engineering, ICITEE 2023 ( IEEE )    1 - 6   2023.10  [Refereed]

    Research paper (international conference proceedings)  

    In this paper we report on semantic segmentation of images of sediment cores obtained from core scanners. Such images usually encompass several objects beyond the essential parts showing the core itself and the measuring scale (typically a ruler or some sort of tape measure), which might be necessary for imaging or physically holding the material, but are irrelevant for the analysis of cores. Moreover, such objects are obstacles to analyzing cores in an automated manner by image processing or deep learning methods. As part of development of a toolkit for automated analysis of sediment cores, we show that the essential parts of the images - core itself and scale reference - can be extracted with high accuracy, using well-established convolutional architectures for semantic segmentation, such as Unet.

    DOI

  • Sweep Complexity Revisited

    Fazekas S.Z., Mercas R.

    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) ( Springer )  14151   116 - 127   2023.09  [Refereed]

    Research paper (international conference proceedings)   International Co-author

    We study the sweep complexity of DFA in one-way jumping mode answering several questions posed earlier. This measure is the number of times in the worst case that such machines have to return to the beginning of their input after having skipped some of the symbols. The class of languages accepted by these machines strictly includes the regular class and constant sweep complexity allows exactly the acceptance of regular languages. However, we show that there exist machines with higher than constant complexity still only accepting regular languages and that in general the sweep complexity of an automaton does not distinguish between accepting regular and non-regular languages. We establish separation results for asymptotic classes defined by this complexity measure and give a surprising exponential/logarithmic relation between factors of certain inputs which can be verified by such machines.

    DOI DOI2

    • display all >>

    To the head of this page.▲

    ◆University bulletin, Research institution【 display / non-display 】

  • Some Results on Bounded Context-Free Languages

    P. Dömösi,, S.Z. Fazekas, Z. Kovács

    Discrete Mathematics and Computer Science. In Memoriam Alexandru Mateescu (1952-2005)     2014.12  [Refereed]  [Invited]

    Research paper (university bulletin, research institution)   Domestic Co-author

    • To the head of this page.▲

    ◆Other【 display / non-display 】

  • Automata with One-way Jumping Mode (Algebraic system, Logic, Language and Related Areas in Computer Sciences II)

    Hoshi Kaito, Yamamura Akihiro, Fazekas Szilard Zsolt

    数理解析研究所講究録 ( 京都大学数理解析研究所 )  ( 2188 ) 125 - 130   2021.07

    Recently, new types of non-sequential machine models have been introduced and studied, such as jumping automata and one-way jumping automata. We study the abilities and limitations of automata with these two jumping modes of tape heads with respect to how they affect the class of accepted languages. We give several methods to determine whether a language is accepted by a machine with jumping mode. We also consider relationships among the classes of languages defined by the new machines and their classical counterparts.

    Repository

  • (代数系、論理、言語と計算機科学の周辺(2))

    Fazekas Szilard Zsolt, Mercas Robert

    数理解析研究所講究録 ( 京都大学数理解析研究所 )  ( 2188 ) 131 - 140   2021.07

    This work proposes a new approach towards solving an over 20 years old conjecture regarding the maximum number of distinct squares that a word can contain. To this end we look at clusters of repetition roots, that is, the set of positions where the root u of a repetition u^[l] occurs. We lay the foundation of this theory by proving basic properties of these clusters and establishing upper bounds on the number of distinct squares when their roots form a chain with respect to the prefix order.

    Repository

  • An Experiment with Ant Colony Optimization for Edge Detection in Images (代数系、論理、言語とその周辺領域)

    MuhammadAsyranbinOthman, Fazekas Szilard Zsolt, Yamamura Akihiro

    数理解析研究所講究録 ( 京都大学数理解析研究所 )  ( 2096 ) 90 - 101   2018.12

    Ant colony optimization (ACO) is a simulation of the natural behavior of ant species; where ants find the shortest path between its nest and food source. Image edge detection is a basic image processing task, where the outlines of the objects in an image are identified, and then extracted. We present the results of an experiment conducted with the ACO algorithm applied to the edge detection problem.

    Repository

  • An experiment with ant colony optimization for edge detection in images

    Muhammad Asyran, bin, Othman, Szilard, Zsolt Fazekas, Akihiro Yamamura

      2096   90 - 101   2018.12

  • Firefly Algorithm for Uncapacitated Facility Location Problem and Number of Fireflies (言語、論理、代数系と計算機科学の展開)

    Tsuya Kohei, Takaya Mayumi, Fazekas Szilard Zsolt, Yamamura Akihiro

    数理解析研究所講究録 ( 京都大学数理解析研究所 )  ( 2051 ) 149 - 157   2017.10

    We apply the firefly algorithm to the uncapacitatcd facility location problem which is one of optimization problems and investigate the optimum number of the fireflies. The light absorption coefficient parameter $gamma$ of the firefly algorithm is examined to obtain better performance and suitable values of $gamma$ are explored for the uncapacitated facility location problem. Effectiveness of local search in the firefly algorithm is also investigated. In addition, we investigate the optimum number of fireflies for the firefly algorithm.

    Repository

    • display all >>

To the head of this page.▲

Books 【 display / non-display 】

To the head of this page.▲

Industrial Property 【 display / non-display 】

  • Method for aligning sentences at the word level enforcing selective contiguity constraints

    Patent

    Examination request：Yes

    Industrial Property No US 11/756,684  Unexpectedly No US9020804 B2 

    Application date： 2007.06.01

    Publication date： 2015.04.28

    Madalina Barbaiani, Nicola Cancedda, Christopher R. Dance, Szilárd Zsolt Fazekas, Tamas Gaal, Eric Gaussier

To the head of this page.▲

Grant-in-Aid for Scientific Research 【 display / non-display 】

  • Non-regular complexity theory

    Grant-in-Aid for Scientific Research(C)

    Project Year： 2023.04  -  2026.03 

  • Clusters of distinct repetition roots

    Grant-in-Aid for Scientific Research(C)

    Project Year： 2019.04  -  2021.03 

  • Lower bounds of universality in Oritatami systems.

    Grant-in-Aid for Challenging Research (Pioneering)/(Exploratory)

    Project Year： 2018.06  -  2020.03  Investigator(s): Shinnosuke Seki

To the head of this page.▲

Presentations 【 display / non-display 】

  • Automated Extraction of Sediment Core and Scale Segments from Core Scanner Images

    Szilard Zsolt Fazekas

    15th International Conference on Information Technology and Electrical Engineering (ICITEE 2023)  (Le Méridien Chiang Mai, Chiang Mai, Thailand)  2023.10  -  2023.10  IEEE Computational Intelligence Society Thailand Chapter

  • Freezing 1-Tag Systems with States

    Szilard Zsolt Fazekas

    16TH INTERNATIONAL CONFERENCE ON AUTOMATA AND FORMAL LANGUAGES (AFL 2023)  (Eszterházy Károly Catholic University of Eger, Hungary)  2023.09  -  2023.09  Eszterházy Károly Catholic University of Eger

    DOI

  • Sweep Complexity Revisited

    Szilard Zsolt Fazekas

    27th International Conference on Implementation and Application of Automata (CIAA 2023)  (Salamis Bay Conti Resort Hotel, Salamis, North Cyprus)  2023.09  -  2023.09  Eastern Mediterranean University, North Cyprus

  • The general case of the clusters conjecture

    Szilard Zsolt Fazekas

    RIMS Workshop "Group, Ring, Language and Related Areas in Computer Science"  (RIMS, Kyoto University)  2023.02  -  2023.02 

  • Clusters of Repetition Roots Forming Prefix Chains

    Szilárd Zsolt Fazekas

    24th International Conference on Descriptional Complexity of Formal systems, Debrecen, Hungary  2022.08  -  2022.08 

display all >>

To the head of this page.▲