Visibly pushdown languages in groups

DOI10.1007/978-3-032-28404-4_8MaRDI QIDQ7356291zbMATH OpenFDO

Authors Laura Ciobanu, Daniel Turaev

Publication date 23 September 2026

Full work available at URL https://doi.org/10.1007/978-3-032-28404-4_8

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites work

• Adding Nesting Structure to Words
• Automata, Languages and Programming
• Conjugacy growth series and languages in groups.
• Conjugacy languages in groups
• Exponential growth rates of free and amalgamated products.
• Group presentations, formal languages and characterizations of one- counter groups
• Groups, the theory of ends, and context-free languages
• scientific article; zbMATH DE number 3664335 (Why is no real title available?)
• scientific article; zbMATH DE number 3696500 (Why is no real title available?)
• scientific article; zbMATH DE number 3805807 (Why is no real title available?)
• scientific article; zbMATH DE number 3339488 (Why is no real title available?)
• scientific article; zbMATH DE number 3381862 (Why is no real title available?)
• Languages, groups, and equations
• On a subclass of context-free groups
• The (nested) word problem
• The existential theory of equations with rational constraints in free groups is PSPACE-complete
• Visibly pushdown languages
• Word equations, constraints, and formal languages

This page was built for publication: Visibly pushdown languages in groups

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7356291)