scientific article
From MaRDI portal
Publication:2708966
zbMath1013.68151MaRDI QIDQ2708966
Publication date: 4 April 2001
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (17)
Reconstructing Words from Right-Bounded-Block Words ⋮ Some characterizations of Parikh matrix equivalent binary words ⋮ Word equations in the context of string solving ⋮ Absent Subsequences in Words ⋮ Reconstruction from subsequences. ⋮ Counting subwords in circular words and their Parikh matrices ⋮ Relations on words ⋮ Spectral concepts in genome informational analysis ⋮ Separating the Words of a Language by Counting Factors ⋮ On Rough Approximations of Languages under Infinite Index Indiscernibility Relations ⋮ Connections between subwords and certain matrix mappings ⋮ Nearly \(k\)-universal words -- investigating a part of Simon's congruence ⋮ On highly palindromic words ⋮ Parikh matrices for powers of words ⋮ Core words and Parikh matrices ⋮ Reconstructing Words from Right-Bounded-Block Words ⋮ Nearly \(k\)-universal words -- investigating a part of Simon's congruence
This page was built for publication:
