Q3114378
type: Item
instance of: scholarly article
zbMATH Open document ID: 1231.68188
author: Veikko Keränen
publication date: 2012-02-04T00:00:00Z
Mathematics Subject Classification ID: 68R15
Mathematics Subject Classification ID: 05A99
zbMATH DE Number: 6003273
MaRDI profile type: Publication
Recommended article: Computing regularities in strings: a survey
Recommended article: Generalized approximate regularities in strings
Recommended article: A new approach to regular \& indeterminate strings
Recommended article: Computational and Proof Complexity of Partial String Avoidability
Recommended article: Q4608614
Recommended article: The frequent paucity of trivial strings
Recommended article: Q5506327
Recommended article: Some variations on a theme of Irina Mel'nichuk concerning the avoidability of patterns in strings of symbols
Recommended article: On Regularity-Preservation by String-Rewriting Systems
Recommended article: Enumerating the strings of regular languages
description: scientific article