The family of one-counter languages is closed under quotient |
| |
| Authors: | M Latteux B Leguy B Ratoandromanana |
| |
| Affiliation: | (1) U.E.R. I.E.E.A., Informatique, CNRS, LA 369, Université de Lille I, F-59655 Villeneuve d'Ascq, France |
| |
| Abstract: | Summary We study, first, the operation of quotient in connection with rational transductions. We show, afterwards, that Rocl, the family of one counter languages is closed under quotient by a context-free language. On the contrary, every recursively enumerable language is the quotient of two linear languages. |
| |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ |
|
