On the language of primitive words
type: Item
instance of: scholarly article
title: On the language of primitive words
zbMATH Open document ID: 0872.68091
DOI: 10.1016/0304-3975(95)00098-4
author: O. Diekmann
published in: Theoretical Computer Science
publication date: 1997-02-27T00:00:00Z
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 984572
describes a project that uses: ALGOL 60
MaRDI profile type: Publication
full work available at URL: 0304-3975(95)00098-4
OpenAlex ID: W2028755743
cites work: Q4101884
cites work: On uniformity within \(NC^ 1\)
cites work: Lexicographically least circular substrings
cites work: Q5526125
cites work: Calcul pratique des coefficients de Taylor d'une fonction algébrique
cites work: Q5670175
cites work: Q4293470
cites work: Q4284240
cites work: Q4348008
cites work: Analytic models and ambiguity of context-free languages
cites work: Parity, circuits, and the polynomial-time hierarchy
cites work: Q5576254
cites work: Bounded Algol-Like Languages
cites work: Q5772619
cites work: Q4198075
cites work: Q5592246
cites work: Optimal algorithms for computing the canonical form of a circular string
cites work: Automata accepting primitive words
cites work: Q4385525
cites work: Fast Pattern Matching in Strings
cites work: Q3659988
cites work: The equation \(a_ M=b^ Nc^ P\) in a free group
cites work: An “Interchange Lemma” for Context-Free Languages
cites work: On Context-Free Languages
cites work: Q3951572
cites work: Q4142707
cites work: Q3855186
cites work: Q5636862
description: scientific article; zbMATH DE number 984572