scientific article; zbMATH DE number 4005620

zbMATH Open0619.68048MaRDI QIDQ3756527FDOQ3756527

Pavol Ďuriš, Juraj Hromkovič

Publication date: 1987

Full work available at URL: https://eudml.org/doc/27930

Title of this publication is not available (Why is that?)

Recommendations

• scientific article
• scientific article; zbMATH DE number 3932419
• scientific article; zbMATH DE number 3982518
• scientific article; zbMATH DE number 3928351
• scientific article; zbMATH DE number 4007730

zbMATH Keywords

timenondeterminismcounter reversalsOne-way multicounter machineszero-tests

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Cites Work

• Title not available (Why is that?)
• Reversal-Bounded Multicounter Machines and Their Decision Problems
• Remarks on blind and partially blind one-way multicounter machines
• Title not available (Why is that?)
• On reversal-bounded counter machines and on pushdown automata with a bound on the size of the pushdown store
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (5)

• Complexity bounds for zero-test algorithms
• Title not available (Why is that?)
• Some hierarchies for the communication complexity measures of cooperating grammar systems
• Title not available (Why is that?)
• Title not available (Why is that?)

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3756527)