Peg-solitaire, string rewriting systems and finite automata (Q1885909): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2004.05.005 / rank
Normal rank
 
Property / OpenAlex ID
 
Property / OpenAlex ID: W2063328934 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2004.05.005 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2063328934 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the binary solitaire cone / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3944542 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4846257 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4281539 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4407712 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Prefix grammars: An alternative characterization of the regular languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3862379 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4124327 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4223673 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear cellular automata and the garden-of-eden / rank
 
Normal rank

Latest revision as of 15:13, 7 June 2024

scientific article
Language Label Description Also known as
English
Peg-solitaire, string rewriting systems and finite automata
scientific article

    Statements

    Peg-solitaire, string rewriting systems and finite automata (English)
    0 references
    12 November 2004
    0 references
    0 references
    Peg-solitaire
    0 references
    String rewriting system
    0 references
    Length-preserving
    0 references
    Change-bounded rewriting rule
    0 references
    0 references
    0 references