Probabilistic Length-Reducing Automata

DOI10.1007/11821069_49MaRDI QIDQ5756663zbMATH OpenOpenAlexFDO

Authors Tomasz Jurdziński

Publication date 5 September 2007

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11821069_49

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Randomized algorithms (68W20)

Recommendations

• Probabilistic length-reducing two-pushdown automata
• scientific article; zbMATH DE number 2087229
• On probabilistic pushdown automata
• scientific article; zbMATH DE number 2038700
• scientific article; zbMATH DE number 1405658

Cited in

(4)

• Lower bound technique for length-reducing automata
• scientific article; zbMATH DE number 2087229 (Why is no real title available?)
• On the power of nondeterminism and Las Vegas randomization for two-dimensional finite automata
• Probabilistic length-reducing two-pushdown automata

This page was built for publication: Probabilistic Length-Reducing Automata

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