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

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1137/0207042 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2170953202 / rank
 
Normal rank

Latest revision as of 23:54, 19 March 2024

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
    0 references