On the Solution Sets of Entire Systems of Word Equations
From MaRDI portal
Publication:6134879
DOI10.1007/978-3-031-33180-0_20OpenAlexW4381303032MaRDI QIDQ6134879
Publication date: 25 July 2023
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-031-33180-0_20
Cites Work
- A proof of Ehrenfeucht's conjecture
- Equations in free semigroups
- On the independence of equations in three variables.
- Systems of word equations, polynomials and linear algebra: a new approach
- On F-semigroups with three generators
- Word equations in non-deterministic linear space
- An Analysis and a Reproof of Hmelevskii’s Theorem
- On the Complexity of Hmelevskii’s Theorem and Satisfiability of Three Unknown Equations
- One-Variable Word Equations and Three-Variable Constant-Free Word Equations
- An Optimal Bound on the Solution Sets of One-Variable Word Equations and its Consequences
- Uniqueness Theorems for Periodic Functions
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On the Solution Sets of Entire Systems of Word Equations
