A characterization of strictly locally testable languages and its application to subsemigroups of a free semigroup

Formal languages and automata (68Q45) Free semigroups, generators and relations, word problems (20M05) Semigroups in automata theory, linguistics, etc. (20M35)

Cited In (26)

The syntactic monoid of hairpin-free languages
Codes and local constraints
A conjugacy invariant for reducible sofic shifts and its semigroup characterizations
Strict local testability with consensus equals regularity, and other properties
Transductions and the parallel generation of languages^†
Simple splicing systems
Pseudo-cyclic renewal systems
Existence of constants in regular splicing languages
Splicing representations of stricly locally testable languages
Families of locally testable languages
Relativized adjacency
Cyclic renewal systems
Formal language theory and DNA: An analysis of the generative capacity of specific recombinant behaviors
Two-Sided Strictly Locally Testable Languages
Regular splicing languages and subclasses
A synchronization property of pure subsemigroups of a free semigroup
Linear splicing and syntactic monoid
WATSON-CRICK BORDERED WORDS AND THEIR SYNTACTIC MONOID
On the bound of the synchronization delay of a local automaton
Reducing the local alphabet size in tiling systems by means of 2D comma-free codes
Regular languages as images of local functions over small alphabets
From regular to strictly locally testable languages
THE SYNTACTIC GRAPH OF A SOFIC SHIFT IS INVARIANT UNDER SHIFT EQUIVALENCE
Star-free sets of integers
Right and left locally testable languages
On the splicing operation

This page was built for publication: A characterization of strictly locally testable languages and its application to subsemigroups of a free semigroup

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3883540)