Partial Derivative Automaton by Compressing Regular Expressions

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	DCFS (23. : 2021 : Online) Descriptional complexity of formal systems
1. Verfasser:	Konstantinidis, Stavros (VerfasserIn)
Weitere Verfasser:	Machiavelo, António (VerfasserIn), Moreira, Nelma (VerfasserIn), Reis, Rogério (VerfasserIn)
Format:	UnknownFormat
Sprache:	eng
Veröffentlicht:	2021
Schlagworte:
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Titel	Jahr	Verfasser
Complexity Issues for the Iterated h-Preorders	2021	Alaev, Pavel
Deterministic One-Way Simulation of Two-Way Deterministic Finite Automata over Small Alphabets	2021	Geffert, Viliam
On the Uniform Distribution of Regular Expressions	2021	Broda, Sabine
Commutative Regular Languages with Product-Form Minimal Automata	2021	Hoffmann, Stefan
Partial Derivative Automaton by Compressing Regular Expressions	2021	Konstantinidis, Stavros
Sync-Maximal Permutation Groups Equal Primitive Permutation Groups	2021	Hoffmann, Stefan
Automata Equipped with Auxiliary Data Structures and Regular Realizability Problems	2021	Rubtsov, Alexander
State Complexity of Union and Intersection on Graph-Walking Automata	2021	Martynova, Olga
Gray Cycles of Maximum Length Related to k-Character Substitutions	2021	Néraud, Jean
Improved Constructions for Succinct Affine Automata	2021	Yakaryılmaz, Abuzer
Disambiguation of Weighted Tree Automata	2021	Stier, Kevin
Width Measures of Alternating Finite Automata	2021	Keeler, C.
State Complexity of Partial Word Finite Automata	2021	Kutrib, Martin
Image-Binary Automata	2021	Kiefer, Stefan
State Complexity Investigations on Commutative Languages — the Upward and Downward Closure, Commutative Aperiodic and Commutative Group Languages	2021	Hoffmann, Stefan
More on the Descriptional Complexity of Products of Finite Automata	2021	Holzer, Markus