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)
String-rewriting systems
Growing context-sensitive languages and Church-Rosser languages
Information and Computation
Confluent and Other Types of Thue Systems
Journal of the ACM (JACM)
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
On Growing Context-Sensitive Languages
ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
The Variable Membership Problem: Succinctness Versus Complexity
STACS '94 Proceedings of the 11th Annual Symposium on Theoretical Aspects of Computer Science
Cross-Sections for Finitely Presented Monoids with Decidable Word Problems
RTA '97 Proceedings of the 8th International Conference on Rewriting Techniques and Applications
Church-rosser and related thue systems (word problem, rewrite rules, congruence)
Church-rosser and related thue systems (word problem, rewrite rules, congruence)
Time-bounded grammars and their languages
Journal of Computer and System Sciences
On Stateless Deterministic Restarting Automata
SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
Probabilistic length-reducing automata
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
The boolean closure of growing context-sensitive languages
DLT'06 Proceedings of the 10th international conference on Developments in Language Theory
Regular languages are church-rosser congruential
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
Growing Grammars and Length-reducing Automata
Fundamenta Informaticae - Non-Classical Models of Automata and Applications II
Fundamenta Informaticae - Non-Classical Models of Automata and Applications II
The Boolean Closure of Growing Context-Sensitive Languages
Fundamenta Informaticae
Star-free languages are Church-Rosser congruential
Theoretical Computer Science
| Hi-index | 0.00 |
The growing context-sensitive languages have been classified through the shrinking two-pushdown automaton, the deterministic version of which characterizes the class of generalized Church-Rosser languages [Inform. Comput. 141 (1998) 1]. Exploiting this characterization we prove that the latter class coincides with the class of Church-Rosser languages that was introduced by McNaughton et al. [J. ACM 35 (1988) 324]. Based on this result several open problems of McNaughton et al. are solved. In addition, we show that shrinking two-pushdown automata and length-reducing two-pushdown automata are equivalent, both in the non-deterministic and the deterministic case, thus obtaining still another characterization of the growing context-sensitive languages and the Church-Rosser languages, respectively.