Largest solutions of left-linear language inequalities
Authors | |
---|---|
Year of publication | 2005 |
Type | Article in Proceedings |
Conference | Automata and Formal Languages: 11th International Conference, AFL 2005, Dobogókő, Hungary, May 17-20. Proceedings |
MU Faculty or unit | |
Citation | |
Field | General mathematics |
Keywords | Language inequality; Regular language |
Description | We prove that largest solutions of systems of implicit one-sided linear language inequalities are regular provided all constants occurring on their right-hand sides are regular languages. |
Related projects: |