On generalized language equations

DOI10.1016/0304-3975(81)90005-0MaRDI QIDQ1149791zbMATH OpenOpenAlexFDO

Authors Ernst L. Leiss

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

Mathematics Subject Classification ID

Artificial intelligence (68T99)

Cites work

• scientific article; zbMATH DE number 3497806 (Why is no real title available?)
• scientific article; zbMATH DE number 3307592 (Why is no real title available?)
• scientific article; zbMATH DE number 3366846 (Why is no real title available?)
• Derivatives of Regular Expressions
• On equations for regular languages, finite automata, and sequential networks

Cited in

(11)

• Implicit language equations: existence and uniqueness of solutions
• On solving star equations
• On classes of tractable unrestricted regular expressions
• Generalized language equations with multiple solutions
• Language equations over a one-letter alphabet with union, concatenation and star: A complete solution
• Basic notions of universal algebra for language theory and graph grammars
• Succinct representation of regular languages by Boolean automata. II
• Alternation in two-way finite automata
• Unrestricted complementation in language equations over a one-letter alphabet
• The complexity of concatenation on deterministic and alternating finite automata
• New types of automata to solve fixed point problems

This page was built for publication: On generalized language equations

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