Clusters of Repetition Roots Forming Prefix Chains

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	DCFS (24. : 2022 : Debrecen) Descriptional complexity of formal systems
1. Verfasser:	Fazekas, Szilárd Zsolt (VerfasserIn)
Weitere Verfasser:	Mercaş, Robert (VerfasserIn)
Format:	UnknownFormat
Sprache:	eng
Veröffentlicht:	2022
Schlagworte:
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Titel	Jahr	Verfasser
Ranking Binary Unlabelled Necklaces in Polynomal Time	2022	Adamson, Duncan
On Simon’s Congruence Closure of a String	2022	Kim, Sungmin
Operations on Subregular Languages and Nondeterministic State Complexity	2022	Hospodár, Michal
Union-Complexities of Kleene Plus Operation	2022	Nagy, Benedek
State Complexity of Binary Coded Regular Languages	2022	Geffert, Viliam
State Complexity of Finite Partial Languages	2022	Kutrib, Martin
Yet Another Canonical Nondeterministic Automaton	2022	Maarand, Hendrik
On the Power of Recursive Word-Functions Without Concatenation	2022	Durand-Lose, Jérôme
Clusters of Repetition Roots Forming Prefix Chains	2022	Fazekas, Szilárd Zsolt
Reset Complexity and Completely Reachable Automata with Simple Idempotents	2022	Hoffmann, Stefan
On the Descriptional Complexity of the Direct Product of Finite Automata	2022	Holzer, Markus
Lazy Regular Sensing	2022	Kupferman, Orna
Approximate NFA Universality Motivated by Information Theory	2022	Konstantinidis, Stavros
The Alphabetic Complexity in Homomorphic Definitions of Word, Tree and Picture Languages	2022	Reghizzi, Stefano Crespi
Nearly k-Universal Words - Investigating a Part of Simon’s Congruence	2022	Fleischmann, Pamela