A new family of nonstochastic languages

DOI10.1016/J.IPL.2010.03.011zbMath1229.68048OpenAlexW1978637767MaRDI QIDQ656590

A. C. Cem Say, Rūsiņš Freivalds, Abuzer Yakaryılmaz

Publication date: 18 January 2012

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2010.03.011

zbMATH Keywords

context-free languagesnonstochastic languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (5)

Quantifying matrix product state ⋮ Quantum computation with write-only memory ⋮ Debates with Small Transparent Quantum Verifiers ⋮ How does adiabatic quantum computation fit into quantum automata theory? ⋮ Power of the interactive proof systems with verifiers modeled by semi-quantum two-way finite automata

Cites Work

• Unnamed Item
• Unnamed Item
• On nonstochastic languages and homomorphic images of stochastic languages
• Languages Recognized with Unbounded Error by Quantum Finite Automata
• Stochasticity of the languages acceptable by two-way finite probabilistic automata
• Complexity of probabilistic versus deterministic automata

This page was built for publication: A new family of nonstochastic languages