scientific article; zbMATH DE number 4005620

MaRDI QIDQ3756527zbMATH OpenFDO

Authors Pavol Ďuriš, Juraj Hromkovič

Publication date 1987

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

zbMATH Keywords

timenondeterminismcounter reversalsOne-way multicounter machineszero-tests

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Cites work

• scientific article; zbMATH DE number 3928351 (Why is no real title available?)
• scientific article; zbMATH DE number 3932419 (Why is no real title available?)
• scientific article; zbMATH DE number 3982518 (Why is no real title available?)
• scientific article; zbMATH DE number 3509706 (Why is no real title available?)
• scientific article; zbMATH DE number 3639175 (Why is no real title available?)
• On reversal-bounded counter machines and on pushdown automata with a bound on the size of the pushdown store
• Remarks on blind and partially blind one-way multicounter machines
• Reversal-Bounded Multicounter Machines and Their Decision Problems

Cited in

(5)

• Complexity bounds for zero-test algorithms
• scientific article; zbMATH DE number 3982518 (Why is no real title available?)
• Some hierarchies for the communication complexity measures of cooperating grammar systems
• scientific article; zbMATH DE number 3932419 (Why is no real title available?)
• scientific article; zbMATH DE number 3928351 (Why is no real title available?)

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)