1 citations · 1 across the 10 of their papers we have counts for
11 papers
Subsequence Analysis Problems for Binary Parikh Matrices
Szilárd Zsolt Fazekas, Xinhao Huang, Robert Mercaş
The universality index corresponding to a word is the largest integer k such that every word of length k over the given alphabet occurs in it as a subsequence. Relative to language…
Deterministic Bandwidth of Finite Languages
Da-Jung Cho, Szilárd Zsolt Fazekas, Max Wiedenhöft
Bandwidth restricts how far transitions can move under an ordering of the states in an automaton. While every finite language admits a bandwidth-2 NFA representation, the determini…
Bandwidth of Nondeterministic Finite Automata
Da-Jung Cho, Szilárd Zsolt Fazekas, Daihei Ise +3
Co-transcriptional splicing generates RNA sequences from a DNA template by deleting subsequences nondeterministically. Recent work showed how to encode an NFA into such a template,…
Binary Words Containing Few Abelian Squares
Szilard Zsolt Fazekas, Adam Mammoliti, Robert Mercas +1
Fici and Saarela ([2]) conjectured that a binary word of length n contains at least abelian squares. We slightly extend this conjecture and show that it holds…
Programmable Co-Transcriptional Splicing: Realizing Regular Languages via Hairpin Deletion
Da-Jung Cho, Szilárd Zsolt Fazekas, Shinnosuke Seki +1
RNA co-transcriptionality, where RNA is spliced or folded during transcription from DNA templates, offers promising potential for molecular programming. It enables programmable fol…
Jump Complexity of Deterministic Finite Automata with Translucent Letters
Szilárd Zsolt Fazekas, Victor Mitrana, Andrei Păun +1
We investigate a dynamical complexity measure defined for finite automata with translucent letters (FAwtl). Roughly, this measure counts the minimal number of necessary jumps for s…
A Formalization of Co-Transcriptional Splicing as an Operation on Formal Languages
Da-Jung Cho, Szilárd Zsolt Fazekas, Shinnosuke Seki +1
RNA co-transcriptionality is the process where RNA sequences are spliced while being transcribed from DNA templates. This process holds potential as a key tool for molecular progra…
Subsequence Matching and Analysis Problems for Formal Languages
Szilárd Zsolt Fazekas, Tore Koß, Florin Manea +2
In this paper, we study a series of algorithmic problems related to the subsequences occurring in the strings of a given language, under the assumption that this language is succin…
Generalized Parikh Matrices For Tracking Subsequence Occurrences
Szilárd Zsolt Fazekas, Xinhao Huang
We introduce and study a generalized Parikh matrix mapping based on tracking the occurrence counts of special types of subsequences. These matrices retain more information about a…
Freezing 1-Tag Systems with States
Szilárd Zsolt Fazekas, Shinnosuke Seki
We study 1-tag systems with states obeying the freezing property that only allows constant bounded number of rewrites of symbols. We look at examples of languages accepted by such…
Sweep Complexity Revisited
Szilárd Zsolt Fazekas, Robert Mercaş
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 hav…