Pages that link to "Item:Q5623234"
From MaRDI portal
The following pages link to A context-free language which is not acceptable by a probabilistic automaton (Q5623234):
Displaying 13 items.
- Unbounded-error quantum computation with small space bounds (Q550246) (← links)
- Theory of one-tape linear-time Turing machines (Q1041220) (← links)
- Probabilistic automata (Q1151262) (← links)
- Classes of formal grammars (Q1248342) (← links)
- Quantum computation with write-only memory (Q1761714) (← links)
- Quantum alternation (Q2361668) (← links)
- THE ROLES OF ADVICE TO ONE-TAPE LINEAR-TIME TURING MACHINES AND FINITE AUTOMATA (Q3069734) (← links)
- Languages Recognized with Unbounded Error by Quantum Finite Automata (Q3392970) (← links)
- The notion of a probabilistic cellular acceptor (Q3862454) (← links)
- Stochastic grammars and languages (Q4045668) (← links)
- Lower space bounds for randomized computation (Q4632458) (← links)
- QUANTUM COUNTER AUTOMATA (Q4902895) (← links)
- Propriétés booléennes des langages stochastiques (Q5678784) (← links)
