Geometrical regular languages and linear Diophantine equations: the strongly connected case (Q443737)

From MaRDI portal
Revision as of 22:12, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
scientific article
Language Label Description Also known as
English
Geometrical regular languages and linear Diophantine equations: the strongly connected case
scientific article

    Statements

    Geometrical regular languages and linear Diophantine equations: the strongly connected case (English)
    0 references
    0 references
    0 references
    0 references
    13 August 2012
    0 references
    regular language
    0 references
    minimal deterministic automaton
    0 references
    Parikh image
    0 references
    geometrical language
    0 references
    Diophantine equation
    0 references

    Identifiers