|
所属 |
大学院理工学研究科 数理・電気電子情報学専攻 数理科学コース |
|
研究室住所 |
〒010-8502 秋田市手形学園町 1番1号 |
|
研究室電話 |
2474 |
|
メールアドレス |
|
FAZEKAS SZILARD ZSOLT (フアゼカス シラード ゾルト)
FAZEKAS SZILARD ZSOLT
|
|
|
研究キーワード 【 表示 ／ 非表示 】
-
Combinatorics on words
-
Molecular computing
-
String algorithms
-
形式言語
-
オートマトン
出身大学 【 表示 ／ 非表示 】
-
1998年09月-2003年06月
University of Debrecen Faculty of Science Institute of Mathematics and Informatics 卒業
出身大学院 【 表示 ／ 非表示 】
-
2004年04月-2010年02月
Rovira i Virgili University International PhD School in Formal Languages and Applications 博士課程 修了
取得学位 【 表示 ／ 非表示 】
-
Rovira i Virgili University - PhD
-
University of Debrecen - M. Sc. Software Engineering
職務経歴（学内） 【 表示 ／ 非表示 】
-
2013年10月-2020年03月
秋田大学 ■廃止組織■ 大学院工学資源学研究科 秋田大学 講師
-
2020年04月-継続中
秋田大学 大学院理工学研究科 数理・電気電子情報学専攻 数理科学コース 准教授
研究等業績 【 表示 ／ 非表示 】
-
Fazekas S.Z.
Theoretical Computer Science ( Theoretical Computer Science ) 999 114550 - 114550 2024年06月 [査読有り]
研究論文（学術雑誌）
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.
-
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月 [査読有り]
研究論文（学術雑誌） 国際共著
-
The effect of jumping modes on various automata models
Fazekas S.Z., Hoshi K., Yamamura A.
Natural Computing ( Springer ) 21 17 - 30 2022年03月 [査読有り]
研究論文（学術雑誌） 国内共著
-
Fazekas S.Z., Seki S.
Theoretical Computer Science ( Elsevier ) 894 121 - 134 2021年11月 [査読有り]
研究論文（学術雑誌）
-
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月 [査読有り]
研究論文（学術雑誌）
-
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年
総説・解説（学術雑誌） 単著
-
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月 [査読有り]
研究論文（国際会議プロシーディングス） 国際共著
-
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月 [査読有り]
研究論文（国際会議プロシーディングス） 国際共著
-
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月 [査読有り]
研究論文（国際会議プロシーディングス） 国際共著
-
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月 [査読有り]
研究論文（国際会議プロシーディングス）
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.
-
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月 [査読有り]
研究論文（国際会議プロシーディングス） 国際共著
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.
-
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月 [査読有り] [招待有り]
研究論文（大学，研究機関紀要） 国内共著
-
Complexities of One-way Jumping Finite Automata
Fazekas S.Z.
Electronic Proceedings in Theoretical Computer Science, EPTCS ( Electronic Proceedings in Theoretical Computer Science, EPTCS ) 407 1 - 4 2024年09月
-
On Algorithmic Self-Assembly of Squares by Co-Transcriptional Folding
Fazekas Szilard
Leibniz International Proceedings in Informatics (LIPIcs) 248 2022年 [査読有り]
-
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.
-
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.
-
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.
◆原著論文【 表示 ／ 非表示 】
◆総説・解説【 表示 ／ 非表示 】
◆国際会議プロシーディングス【 表示 ／ 非表示 】
◆⼤学，研究機関紀要【 表示 ／ 非表示 】
◆その他【 表示 ／ 非表示 】
Book（書籍） 【 表示 ／ 非表示 】
-
International Conference on Implementation and Application of Automata, Fazekas Szilárd Zsolt ( 担当： その他 )
Springer 2024年 ISBN: 9783031711114
-
Szilárd Zsolt Fazekas (ed.) ( 担当： 編者 )
Justus-Liebig-Universität Giessen 2021年06月
-
International Journal of Foundations of Computer Science, Special Issue - Semigroups, Languages and Algebras
Szilárd Zsolt Fazekas, Kayoko Shikishima-Tsuji, Akihiro Yamamura ( 担当： 共編者 )
World Scientific 2016年04月
産業財産権 【 表示 ／ 非表示 】
-
Method for aligning sentences at the word level enforcing selective contiguity constraints
特許
審査請求有無：あり
特願 US 11/756,684 特開 US9020804 B2
出願日： 2007年06月01日
公開日： 2015年04月28日
Madalina Barbaiani, Nicola Cancedda, Christopher R. Dance, Szilárd Zsolt Fazekas, Tamas Gaal, Eric Gaussier
科研費（文科省・学振）獲得実績 【 表示 ／ 非表示 】
-
Non-regular complexity theory
Grant-in-Aid for Scientific Research (C)
研究期間: 2023年04月 - 2026年03月
-
Non-regular complexity theory
基盤研究(C)
研究期間: 2023年04月 - 2026年03月
-
Clusters of distinct repetition roots
基盤研究(C)
研究期間: 2019年04月 - 2021年03月
-
万能折り畳みシステムの小型化とその限界
挑戦的研究（開拓・萌芽）
研究期間: 2018年06月 - 2020年03月 代表者: 関 新之助
学会等発表 【 表示 ／ 非表示 】
-
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
-
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月