Monadic Thue systems
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3174044 (Why is no real title available?)
- scientific article; zbMATH DE number 3528212 (Why is no real title available?)
- scientific article; zbMATH DE number 3407189 (Why is no real title available?)
- A modification of a substitution theorem and some necessary and sufficient conditions for sets to be context-free
- Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
- Confluent and Other Types of Thue Systems
- Full AFLs and nested iterated substitution
- How to Make Arbitrary Grammars Look Like Context-Free Grammars
- On a special monoid with a single defining relation
- On theories with a combinatorial definition of 'equivalence'
- Partial algorithm problems for context free languages
- Testing for the Church-Rosser property
- The Hardest Context-Free Language
- Tree-Manipulating Systems and Church-Rosser Theorems
- Une généralisation des ensembles de Dyck
Cited in
(60)- Groups Presented by Finite Two-Monadic Church-Rosser Thue Systems
- Non-finitely generated maximal subgroups of context-free monoids
- A note on regular classes in special Thue systems
- Undecidable questions related to Church-Rosser Thue systems
- Rational subsets of polycyclic monoids and valence automata
- Some undecidability results for non-monadic Church-Rosser Thue systems
- Thue systems as rewriting systems
- RATIONAL SUBSETS IN HNN-EXTENSIONS AND AMALGAMATED PRODUCTS
- On the word problem for special monoids
- On a subclass of context-free groups
- On the word problem for free products of semigroups and monoids
- On the computing powers of \(\mathcal{L}\)-reductions of insertion languages
- Automatic Termination
- FINDING FINITE AUTOMATA THAT CERTIFY TERMINATION OF STRING REWRITING SYSTEMS
- Power of controlled insertion and deletion
- Deleting string rewriting systems preserve regularity
- Bottom-up tree pushdown automata and rewrite systems
- Computing presentations for subgroups of polycyclic groups and of context-free groups
- On characterizations of recursively enumerable languages
- Elements of Finite Order for Finite Monadic Church-Rosser Thue Systems
- Commutativity in groups presented by finite Church-Rosser Thue systems
- Some undecidability results concerning the property of preserving regularity
- Deterministic tree pushdown automata and monadic tree rewriting systems
- A polynomial algorithm testing partial confluence of basic semi-Thue systems
- A polynomial algorithm testing partial confluence of basic semi-Thue systems
- Decidable sentences of Church-Rosser congruences
- Decidability of reachability for disjoint union of term rewriting systems
- Bottom-up rewriting for words and terms
- On deciding the confluence of a finite string-rewriting system on a given congruence class
- On regularity of context-free languages
- On the rational subset problem for groups.
- Testing for the Church-Rosser property
- When is a monoid a group? The Church-Rosser case is tractable
- A closure property of regular languages
- On language equations with invertible operations
- Cancellation in context-free languages: enrichment by reduction
- \(\mathcal{L}\)-reduction computation revisited
- Infinite regular Thue systems
- Match-bounded string rewriting systems
- McNaughton families of languages.
- The word problem for one-relation monoids: a survey
- About the descriptive power of certain classes of finite string-rewriting systems
- Some decision problems about controlled rewriting systems
- A characterisation of deterministic context-free languages by means of right-congruences
- Reductions in tree replacement systems
- Cancellation rules and extended word problems
- Church-Rosser controlled rewriting systems and equivalence problems for deterministic context-free languages
- An efficient algorithm to decide whether a monoid presented by a regular Church-Rosser Thue system is a group
- On one-relator groups and units of special one-relation inverse monoids
- MULTIPLICATION TABLES AND WORD-HYPERBOLICITY IN FREE PRODUCTS OF SEMIGROUPS, MONOIDS AND GROUPS
- Complexity results on the conjugacy problem for monoids
- Polycyclic and Bicyclic Valence Automata
- On the word problem for weakly compressible monoids
- The undecidability of a word problem: On a conjecture of Strong, Maggiolo-Schettini and Rosen
- Homomorphic images of sentential form languages defined by semi-Thue systems
- Decidability of confluence and termination of monadic term rewriting systems
- On the regular equivalence problem for regular Thue systems
- Church-Rosser systems with respect to formal languages
- Conjugacy in monoids with a special Church-Rosser presentation is decidable
- NTS grammars and Church-Rosser systems
This page was built for publication: Monadic Thue systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1165842)
