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)
Growing context-sensitive languages and Church-Rosser languages
Information and Computation
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
FoSSaCS '98 Proceedings of the First International Conference on Foundations of Software Science and Computation Structure
On determinism versus non-determinism and related problems
SFCS '83 Proceedings of the 24th Annual Symposium on Foundations of Computer Science
On determinism versus non-determinism and related problems
SFCS '83 Proceedings of the 24th Annual Symposium on Foundations of Computer Science
Time-bounded grammars and their languages
Journal of Computer and System Sciences
Flip-pushdown automata: k + 1 pushdown reversals are better than k
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
DLT'04 Proceedings of the 8th 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
DLT'06 Proceedings of the 10th international conference on Developments in Language Theory
Growing Grammars and Length-reducing Automata
Fundamenta Informaticae - Non-Classical Models of Automata and Applications II
The Boolean Closure of Growing Context-Sensitive Languages
Fundamenta Informaticae
| Hi-index | 0.00 |
The shrinking two-pushdown automaton is known to charactize the class of growing context-sensitive languages, while its deterministic variant accepts the Church-Rosser languages. Here we study the expressive power of shrinking pushdown automata with more than two pushdown stores, obtaining a close correspondence to linear time-bounded multi-tape Turing machines.