Language equations over a one-letter alphabet with union, concatenation and star: A complete solution
From MaRDI portal
Publication:1331941
DOI10.1016/0304-3975(94)90177-5zbMath0861.68052MaRDI QIDQ1331941
Publication date: 11 May 1997
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(94)90177-5
Related Items
Implicit language equations: existence and uniqueness of solutions, Unrestricted complementation in language equations over a one-letter alphabet
Cites Work