Peg-solitaire, string rewriting systems and finite automata

DOI10.1016/j.tcs.2004.05.005zbMath1068.68073OpenAlexW2063328934MaRDI QIDQ1885909

Bala Ravikumar

Publication date: 12 November 2004

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2004.05.005

zbMATH Keywords

Change-bounded rewriting ruleLength-preservingPeg-solitaireString rewriting system

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42)

Related Items

On the PSPACE-completeness of Peg Duotaire and other Peg-Jumping Games ⋮ Taking-and-merging games as rewrite games ⋮ A canonical automaton for one-rule length-preserving string rewrite systems ⋮ Automatic Termination

Cites Work

• Prefix grammars: An alternative characterization of the regular languages
• Linear cellular automata and the garden-of-eden
• On the binary solitaire cone
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item