Even Linear Simple Matrix Languages: Formal Language Aspects
We investigate formal language properties of even linear simple matrix languages and related language classes. More precisely, we discuss characterizations, (proper) inclusion relations, closure properties and decidability questions. In another paper , we showed the importance of these language classes for grammatical inference issues.
Unable to display preview. Download preview PDF.
- 2.J. A. Brzozowski. Regular-like expressions for some irregular languages. In 9th IEEE SWAT (FOCS), pages 278–280, 1968.Google Scholar
- 3.J. Dassow and Gh. Păun. Regulated Rewriting in Formal Language Theory, vol. 18 of EATCS Monographs in Theoretical Computer Science. Berlin: Springer, 1989.Google Scholar
- 4.H. Fernau. Efficient learning of some linear matrix languages. In 5th COCOON, vol. 1627 of LNCS, pages 221–230, 1999. Extended version as Technical Report WSI-2000–9, Universität Tübingen (Germany), Wilhelm-Schickard-Institut für Informatik.Google Scholar
- 5.H. Fernau and J. M. Sempere. Permutations and control sets for learning non-regular language families. In 5th ICGI, vol. 1891 of LNCS/LNAI, pages 75–88, 2000.Google Scholar
- 13.H. Maurer and W. Kuich. Tuple languages. In Proc. of the ACM International Computing Symposium, pages 882–891, 1970.Google Scholar
- 15.J. M. Sempere and P. García. A characterization of even linear languages and its application to the learning problem. In 2nd ICGI, vol. 862 of LNCS/LNAI, pages 38–44, 1994.Google Scholar
- 18.Y. Takada. Learning even equal matrix languages based on control sets. In ICPIA’92, vol. 652 of LNCS, pages 274–289, 1992.Google Scholar
- 20.Y. Takada. Learning formal languages based on control sets. In Algorithmic Learning for Knowledge-Based Systems, vol. 961 of LNCS/LNAI, pages 317–339, 1995.Google Scholar