On generalized language equations
From MaRDI portal
Publication:1149791
DOI10.1016/0304-3975(81)90005-0zbMath0454.68105OpenAlexW2055516810MaRDI QIDQ1149791
Publication date: 1981
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(81)90005-0
Related Items
Language equations over a one-letter alphabet with union, concatenation and star: A complete solution, Unrestricted complementation in language equations over a one-letter alphabet, Generalized language equations with multiple solutions, On solving star equations, Basic notions of universal algebra for language theory and graph grammars, Implicit language equations: existence and uniqueness of solutions, New types of automata to solve fixed point problems, Alternation in two-way finite automata, The complexity of concatenation on deterministic and alternating finite automata, On classes of tractable unrestricted regular expressions, Succinct representation of regular languages by Boolean automata. II
Cites Work
