Reachability via Cooperating Morphisms (Q4982083): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q3859267 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on decidability questions on presentations of word semigroups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Test sets for morphisms with bounded delay / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Purely Homomorphic Characterization of Recursively Enumerable Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Elementary homomorphisms and a solution of the DOL sequence equivalence problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equality languages and fixed point languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed Point Languages, Equality Languages, and Representation of Recursively Enumerable Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4714446 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5414545 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A variant of a recursively unsolvable problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3741057 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4194484 / rank
 
Normal rank

Revision as of 20:51, 9 July 2024

scientific article; zbMATH DE number 6418592
Language Label Description Also known as
English
Reachability via Cooperating Morphisms
scientific article; zbMATH DE number 6418592

    Statements

    Identifiers