scientific article; zbMATH DE number 7561688
From MaRDI portal
Publication:5092406
DOI10.4230/LIPIcs.MFCS.2019.44MaRDI QIDQ5092406
Joel D. Day, Florin Manea, Dirk Nowotka
Publication date: 21 July 2022
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Finding a homomorphism between two words is NP-complete
- Word unification and transformation of generalized equations
- Automata-based model counting for string constraints
- Satisfiability of word equations with constants is in NEXPTIME
- Minimal and complete word unification
- Equations in Free Groups
- THE PROBLEM OF SOLVABILITY OF EQUATIONS IN A FREE SEMIGROUP
- The expressibility of languages and relations by word equations
- Progressive Reasoning over Recursively-Defined Strings
- The hardness of solving simple word equations
- Context Unification is in PSPACE
- Document Spanners: From Expressive Power to Decision Problems.
- Automata, Languages and Programming
This page was built for publication:
