Membership for growing context-sensitive grammars is polynomial
Journal of Computer and System Sciences
Church-Rosser Thue systems and formal languages
Journal of the ACM (JACM)
An introduction to Kolmogorov complexity and its applications
An introduction to Kolmogorov complexity and its applications
Growing context-sensitive languages and Church-Rosser languages
Information and Computation
Properties of probabilistic pushdown automata
Theoretical Computer Science - Special issue In Memoriam of Ronald V. Book
Church-Rosser Languages vs. UCFL
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Tally Languages Accepted by Monte Carlo Pushdown Automata
RANDOM '97 Proceedings of the International Workshop on Randomization and Approximation Techniques in Computer Science
Information and Computation
Pushdown automata and multicounter machines, a comparison of computation modes
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
The boolean closure of growing context-sensitive languages
DLT'06 Proceedings of the 10th international conference on Developments in Language Theory
Lower bound technique for length-reducing automata
Information and Computation
The Boolean Closure of Growing Context-Sensitive Languages
Fundamenta Informaticae
The Boolean Closure of Growing Context-Sensitive Languages
Fundamenta Informaticae
| Hi-index | 0.00 |
Hardness of a separation of nondeterminism, randomization and determinism for polynomial time computations motivates the analysis of restricted models of computation. Following this line of research, we consider randomized length-reducing two-pushdown automata (lrTPDA), a natural extension of pushdown automata (PDA). We separate randomized lrTPDAs from deterministic and nondeterministic ones, and we compare different modes of randomization. Moreover, we prove that amplification is impossible for Las Vegas automata.