scientific article; zbMATH DE number 7559401

DOI10.4230/LIPIcs.MFCS.2020.30MaRDI QIDQ5089196

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

Publication date: 18 July 2022

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

randomizationfinite automatanon-uniform computation

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items

Two-way non-uniform finite automata, Two-Way Non-Uniform Finite Automata, Unnamed Item, Advice hierarchies among finite automata

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Turing machines that take advice
• Theory of one-tape linear-time Turing machines
• On randomized one-round communication complexity
• Amount of nonconstructivity in deterministic finite automata
• Multitape one-way nonwriting automata
• Automata that take advice
• Sublogarithmic-space turing machines, nonuniform space complexity, and closure properties
• Computational Complexity of Probabilistic Turing Machines
• On Relating Time and Space to Size and Depth
• Communication Complexity
• FINITE AUTOMATA WITH ADVICE TAPES
• Probabilistic automata
• Determinism and Nondeterminism in Finite Automata with Advice