On the role of complementation in implicit language equations and relations

DOI10.1016/J.JCSS.2013.09.001zbMath1433.68196OpenAlexW2055683627MaRDI QIDQ386049

Ernst L. Leiss, Adrian Mihai Ionescu

Publication date: 13 December 2013

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcss.2013.09.001

zbMATH Keywords

relationscomplementationequationslanguagesimplicit

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Boolean functions (06E30)

Cites Work

• Unnamed Item
• On equations for regular languages, finite automata, and sequential networks
• Implicit language equations: existence and uniqueness of solutions
• Maximal and minimal solutions to language equations
• On classes of tractable unrestricted regular expressions
• Generalized language equations with multiple solutions
• Unrestricted complementation in language equations over a one-letter alphabet

This page was built for publication: On the role of complementation in implicit language equations and relations