The Unsolvability of the Equivalence Problem for $\varepsilon $-Free NGSM’s with Unary Input (Output) Alphabet and Applications (Q4167584)

From MaRDI portal
Revision as of 15:33, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
scientific article; zbMATH DE number 3601112
Language Label Description Also known as
English
The Unsolvability of the Equivalence Problem for $\varepsilon $-Free NGSM’s with Unary Input (Output) Alphabet and Applications
scientific article; zbMATH DE number 3601112

    Statements

    The Unsolvability of the Equivalence Problem for $\varepsilon $-Free NGSM’s with Unary Input (Output) Alphabet and Applications (English)
    0 references
    0 references
    0 references
    1978
    0 references
    0 references
    0 references
    0 references
    0 references