scientific article; zbMATH DE number 7559401

DOI10.4230/LIPICS.MFCS.2020.30MaRDI QIDQ5089196zbMATH OpenFDO

Authors Pavol Ďuriš, Rastislav Královič, Richard Královič, Dana Pardubská, Martin Pašen, Peter Rossmanith

Publication date 18 July 2022

zbMATH Keywords

randomizationfinite automatanon-uniform computation

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• scientific article; zbMATH DE number 3723866 (Why is no real title available?)
• scientific article; zbMATH DE number 3765145 (Why is no real title available?)
• scientific article; zbMATH DE number 7559401 (Why is no real title available?)
• Amount of nonconstructivity in deterministic finite automata
• Automata that take advice
• Communication Complexity
• Computational Complexity of Probabilistic Turing Machines
• Determinism and Nondeterminism in Finite Automata with Advice
• Finite automata with advice tapes
• Multitape one-way nonwriting automata
• On Relating Time and Space to Size and Depth
• On randomized one-round communication complexity
• Probabilistic automata
• Sublogarithmic-space turing machines, nonuniform space complexity, and closure properties
• Theory of one-tape linear-time Turing machines
• Turing machines that take advice

Cited in

(8)

• Non-deterministic Weighted Automata on Random Words
• Advice hierarchies among finite automata
• Two-way non-uniform finite automata
• Finitely nonstationary nondeterministic automata with random input
• Two-Way Non-Uniform Finite Automata
• scientific article; zbMATH DE number 7559401 (Why is no real title available?)
• Layout Randomization and Nondeterminism
• Power of Randomization in Automata on Infinite Strings

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 Q5089196)