A characterization of strictly locally testable languages and its application to subsemigroups of a free semigroup
From MaRDI portal
Publication:3883540
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
- Transductions and the parallel generation of languages†
- Strict local testability with consensus equals regularity, and other properties
- 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
- Cyclic renewal systems
- Formal language theory and DNA: An analysis of the generative capacity of specific recombinant behaviors
- Relativized adjacency
- Two-Sided Strictly Locally Testable Languages
- A synchronization property of pure subsemigroups of a free semigroup
- Regular splicing languages and subclasses
- Linear splicing and syntactic monoid
- On the bound of the synchronization delay of a local automaton
- WATSON-CRICK BORDERED WORDS AND THEIR SYNTACTIC MONOID
- 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)
