A new family of nonstochastic languages
From MaRDI portal
Publication:656590
DOI10.1016/J.IPL.2010.03.011zbMATH Open1229.68048OpenAlexW1978637767MaRDI QIDQ656590FDOQ656590
Authors: Rūsiņš Freivalds, Abuzer Yakaryılmaz, A. C. Cem Say Error creating thumbnail:
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
Cites Work
- Title not available (Why is that?)
- Languages Recognized with Unbounded Error by Quantum Finite Automata
- Stochasticity of the languages acceptable by two-way finite probabilistic automata
- On nonstochastic languages and homomorphic images of stochastic languages
- Title not available (Why is that?)
- Complexity of probabilistic versus deterministic automata
Cited In (8)
- Quantifying matrix product state
- Periodic and Sturmian languages
- Power of the interactive proof systems with verifiers modeled by semi-quantum two-way finite automata
- Quantum computation with devices whose contents are never read
- How does adiabatic quantum computation fit into quantum automata theory?
- Debates with small transparent quantum verifiers
- Generalized Sturmian languages
- The Family of Languages Generated by Non-cooperative Membrane Systems
This page was built for publication: A new family of nonstochastic languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q656590)
