Some decision problems about controlled rewriting systems
From MaRDI portal
Recommendations
- A characterisation of deterministic context-free languages by means of right-congruences
- Church-Rosser controlled rewriting systems and equivalence problems for deterministic context-free languages
- Complexity of certain decision problems about congruential languages
- Decision problems for finite special string-rewriting systems that are confluent on some congruence class
- Church-Rosser systems with respect to formal languages
Cites work
- scientific article; zbMATH DE number 3660804 (Why is no real title available?)
- scientific article; zbMATH DE number 3684913 (Why is no real title available?)
- scientific article; zbMATH DE number 3786151 (Why is no real title available?)
- scientific article; zbMATH DE number 3528212 (Why is no real title available?)
- scientific article; zbMATH DE number 3561239 (Why is no real title available?)
- scientific article; zbMATH DE number 3612461 (Why is no real title available?)
- scientific article; zbMATH DE number 3430632 (Why is no real title available?)
- A Note on Pushdown Store Automata and Regular Systems
- A characterisation of deterministic context-free languages by means of right-congruences
- An improvement on Valiant's decision procedure for equivalence of deterministic finite turn pushdown machines
- Church-Rosser controlled rewriting systems and equivalence problems for deterministic context-free languages
- Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
- Infinite regular Thue systems
- Monadic Thue systems
- NTS languages are deterministic and congruential
- On deciding the confluence of a finite string-rewriting system on a given congruence class
- On the complexity of some extended word problems defined by cancellation rules
- On the regular equivalence problem for regular Thue systems
- Optimization of LR(k) parsers
- Some undecidability results for non-monadic Church-Rosser Thue systems
- The equivalence and inclusion problems for NTS languages
- The equivalence problem for deterministic finite-turn pushdown automata
- The equivalence problem for real-time DPDAs
- Thue systems as rewriting systems
- Une généralisation des ensembles de Dyck
Cited in
(17)- INFINITE WORDS AND CONFLUENT REWRITING SYSTEMS: ENDOMORPHISM EXTENSIONS
- On DOS languages and DOS mappings
- On prefixal one-rule string rewrite systems
- Rational subsets of partially reversible monoids
- A characterisation of deterministic context-free languages by means of right-congruences
- On rationally controlled one-rule insertion systems
- scientific article; zbMATH DE number 5722791 (Why is no real title available?)
- A polynomial algorithm testing partial confluence of basic semi-Thue systems
- scientific article; zbMATH DE number 3902061 (Why is no real title available?)
- Deterministic pushdown-CD-systems of stateless deterministic R(1)-automata
- Complexity of certain decision problems about congruential languages
- A polynomial algorithm testing partial confluence of basic semi-Thue systems
- Term rewriting with prefix context constraints and bottom-up strategies
- On the rational subsets of the monogenic free inverse monoid
- Some undecidability results concerning the property of preserving regularity
- Church-Rosser controlled rewriting systems and equivalence problems for deterministic context-free languages
- \(L(A)=L(B)\)? decidability results from complete formal systems
This page was built for publication: Some decision problems about controlled rewriting systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q910246)
