scientific article; zbMATH DE number 7559401
From MaRDI portal
Publication:5089196
DOI10.4230/LIPICS.MFCS.2020.30MaRDI QIDQ5089196FDOQ5089196
Authors: Pavol Ďuriš, Rastislav Královič, Richard Královič, Dana Pardubská, Martin Pašen, Peter Rossmanith 
Publication date: 18 July 2022
Title of this publication is not available (Why is that?)
Cites Work
- Title not available (Why is that?)
- Probabilistic automata
- Communication Complexity
- Computational Complexity of Probabilistic Turing Machines
- On randomized one-round communication complexity
- On Relating Time and Space to Size and Depth
- Turing machines that take advice
- Amount of nonconstructivity in deterministic finite automata
- Automata that take advice
- Theory of one-tape linear-time Turing machines
- Title not available (Why is that?)
- Multitape one-way nonwriting automata
- Sublogarithmic-space turing machines, nonuniform space complexity, and closure properties
- Title not available (Why is that?)
- Finite automata with advice tapes
- Determinism and Nondeterminism in Finite Automata with Advice
Cited In (8)
- Layout Randomization and Nondeterminism
- Power of Randomization in Automata on Infinite Strings
- Two-way non-uniform finite automata
- Two-Way Non-Uniform Finite Automata
- Finitely nonstationary nondeterministic automata with random input
- Advice hierarchies among finite automata
- Title not available (Why is that?)
- Non-deterministic Weighted Automata on Random Words
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)
