Characterizing Classes of Regular Languages Using Prefix Codes of Bounded Synchronization Delay

DOI10.4230/LIPICS.ICALP.2016.129zbMath1388.68165OpenAlexW2740164658MaRDI QIDQ4598271

Tobias Walter, Volker Diekert

Publication date: 19 December 2017

Full work available at URL: https://dblp.uni-trier.de/db/conf/icalp/icalp2016.html#DiekertW16a

zbMATH Keywords

varietyformal languagesynchronization delayRees extension

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Varieties and pseudovarieties of semigroups (20M07) Algebraic theory of languages and automata (68Q70) Semigroups in automata theory, linguistics, etc. (20M35) Prefix, length-variable, comma-free codes (94A45)

Related Items (2)

Parikh-reducing Church-Rosser representations for some classes of regular languages ⋮ On All Things Star-Free

This page was built for publication: Characterizing Classes of Regular Languages Using Prefix Codes of Bounded Synchronization Delay