On groups with EDT0L word problem
From MaRDI portal
Cites work
- A decision procedure for string logic with quadratic equations, regular expressions and length constraints
- Applications of L systems to group theory
- Bounded automata groups are co-ET0L
- EDT0L solutions to equations in group extensions
- Extension of tabled 0L-systems and languages
- Groups and NTS languages
- GROUPS AND SEMIGROUPS WITH A ONE-COUNTER WORD PROBLEM
- Groups whose word problem is a Petri net language
- Groups whose word problems are accepted by abelian G-automata
- Groups with multiple context-free word problems
- Groups, the theory of ends, and context-free languages
- scientific article; zbMATH DE number 3480115 (Why is no real title available?)
- scientific article; zbMATH DE number 3589737 (Why is no real title available?)
- scientific article; zbMATH DE number 3381862 (Why is no real title available?)
- On a subclass of context-free groups
- On ETOL systems of finite index
- ON GROUPS AND COUNTER AUTOMATA
- Permutations of context-free, ET0L and indexed languages
- Solution sets for equations over free groups are EDT0L languages
- Stack Machines and Classes of Nonnested Macro Languages
- Sur les générateurs algébriques et linéaires
- The complexity of solution sets to equations in hyperbolic groups
- The complexity of verbal languages over groups
- The Dyck language \(D_ 1^{'*}\) is not generated by any matrix grammar of finite index
- Top-down tree transducers with regular look-ahead
- Using \textsc{edt0l} systems to solve some equations in the solvable Baumslag-Solitar groups
This page was built for publication: On groups with EDT0L word problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7255008)
