A new family of nonstochastic languages

DOI10.1016/J.IPL.2010.03.011zbMATH Open1229.68048OpenAlexW1978637767MaRDI QIDQ656590FDOQ656590

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

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)

Cites work

• scientific article; zbMATH DE number 3579981 (Why is no real title available?)
• scientific article; zbMATH DE number 3371972 (Why is no real title available?)
• Complexity of probabilistic versus deterministic automata
• Languages Recognized with Unbounded Error by Quantum Finite Automata
• On nonstochastic languages and homomorphic images of stochastic languages
• Stochasticity of the languages acceptable by two-way finite probabilistic automata

Cited in

(7)

• Generalized Sturmian languages
• The Family of Languages Generated by Non-cooperative Membrane Systems
• Debates with small transparent quantum verifiers
• Periodic and Sturmian languages
• Power of the interactive proof systems with verifiers modeled by semi-quantum two-way finite automata
• Quantifying matrix product state
• How does adiabatic quantum computation fit into quantum automata theory?

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)