Peg-solitaire, string rewriting systems and finite automata
type: Item
instance of: scholarly article
title: Peg-solitaire, string rewriting systems and finite automata
zbMATH Open document ID: 1068.68073
published in: Theoretical Computer Science
publication date: 2004-11-12T00:00:00Z
Mathematics Subject Classification ID: 68Q42
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 2115300
zbMATH Keywords: Peg-solitaire
zbMATH Keywords: String rewriting system
zbMATH Keywords: Length-preserving
zbMATH Keywords: Change-bounded rewriting rule
author: B. Ravikumar
MaRDI profile type: Publication
full work available at URL: j.tcs.2004.05.005
OpenAlex ID: W2063328934
cites work: On the binary solitaire cone
cites work: Q3944542
cites work: Q4846257
cites work: Q4281539
cites work: Q4407712
cites work: Prefix grammars: An alternative characterization of the regular languages
cites work: Q3862379
cites work: Q4124327
cites work: Q4223673
cites work: Linear cellular automata and the garden-of-eden
DOI: 10.1016/J.TCS.2004.05.005
description: scientific article; zbMATH DE number 2115300