Probabilistic length-reducing two-pushdown automata
From MaRDI portal
Recommendations
Cites work
- Church-Rosser Thue systems and formal languages
- Growing context-sensitive languages and Church-Rosser languages
- scientific article; zbMATH DE number 1962823 (Why is no real title available?)
- scientific article; zbMATH DE number 2038700 (Why is no real title available?)
- scientific article; zbMATH DE number 2087236 (Why is no real title available?)
- scientific article; zbMATH DE number 1408346 (Why is no real title available?)
- Lower bound technique for length-reducing automata
- Membership for growing context-sensitive grammars is polynomial
- On the power of Las Vegas II: Two-way finite automata
- Probabilistic Length-Reducing Automata
- Properties of probabilistic pushdown automata
- The Church-Rosser languages are the deterministic variants of the growing context-sensitive languages
Cited in
(4)
This page was built for publication: Probabilistic length-reducing two-pushdown automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q841617)