AUTOMATIC THEOREM-PROVING IN COMBINATORICS ON WORDS (Q5401556)

From MaRDI portal
Revision as of 11:21, 7 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 6266665
Language Label Description Also known as
English
AUTOMATIC THEOREM-PROVING IN COMBINATORICS ON WORDS
scientific article; zbMATH DE number 6266665

    Statements

    title
    AUTOMATIC THEOREM-PROVING IN COMBINATORICS ON WORDS (English)
    0 references
    author
    Daniel Goč
    0 references
    Dane Henshall
    0 references
    Jeffrey O. Shallit
    0 references
    publication date
    10 March 2014
    0 references
    zbMATH Keywords
    automatic theorem-proving
    0 references
    combinatorics on words
    0 references
    automatic sequences
    0 references
    finite automata
    0 references
    decidability
    0 references
    borders
    0 references
    linear recurrence
    0 references
    periods
    0 references
    enumeration
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68R15
    0 references
    05A05
    0 references
    11B85
    0 references
    68-04
    0 references
    68Q45
    0 references
    68T15
    0 references
    zbMATH DE Number
    6266665
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q5401556&oldid=35376711"
    Powered by MediaWiki