The online space complexity of probabilistic languages

DOI10.1007/978-3-319-27683-0_8MaRDI QIDQ5283421zbMATH OpenOpenAlexFDO

Authors Nathanaël Fijalkow

Publication date 21 July 2017

Published in Logical Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-27683-0_8

zbMATH Keywords

automatacomplexity theoryonline algorithmsonline complexityprobabilistic languages

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Online algorithms; streaming algorithms (68W27)

Recommendations

• scientific article; zbMATH DE number 18635
• scientific article; zbMATH DE number 20623
• scientific article; zbMATH DE number 17834
• Space-Efficient Deterministic Simulation of Probabilistic Automata
• On probabilistic analog automata

Cites work

• scientific article; zbMATH DE number 1256715 (Why is no real title available?)
• Irregular behaviours for probabilistic automata
• Probabilistic automata
• Probabilistic counting algorithms for data base applications
• Selection and sorting with limited storage

This page was built for publication: The online space complexity of probabilistic languages

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