Descriptive Complexity of Reversible Languages Having Finitely Many Reduced Automata (Q6114868)

From MaRDI portal
Revision as of 18:35, 30 December 2024 by Import241228121245 (talk | contribs) (Normalize DOI.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 7726984
Language Label Description Also known as
English
Descriptive Complexity of Reversible Languages Having Finitely Many Reduced Automata
scientific article; zbMATH DE number 7726984

    Statements

    Descriptive Complexity of Reversible Languages Having Finitely Many Reduced Automata (English)
    0 references
    0 references
    0 references
    15 August 2023
    0 references
    reversible regular languages
    0 references
    reversible automaton
    0 references
    forbidden pattern
    0 references
    reduced reversible automaton
    0 references
    NL-completeness
    0 references
    descriptional complexity
    0 references

    Identifiers