Abstract
In 2001 and 2002, Daowen Qiu has established a new theory of L-valued automata which is based on complete residuated lattices. Moreover, besides the finite automata, several other classes of machines, grammars and languages have been generalized using the ideas introduced by Qiu. This paper generalizes the concept of linear grammars and linear languages in this context, moreover, it presents some operations for L-valued languages and some closure properties for the L-valued linear languages.
Sign-in/Register to access full text options 
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.
