Abstract
We generalize the following two language- and automata-theoretic results to ω-continuous semirings. • (i) The family of languages accepted by finite automata is the smallest class containing all finite languages and closed under union, product and star (Kleene's Theorem). • (ii) The family of languages accepted by pushdown automata is the family ofcontext-free languages.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
