![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Author: Kapur S. Bilardi G.
Publisher: Elsevier
ISSN: 0304-3975
Source: Theoretical Computer Science, Vol.141, Iss.1, 1995-04, pp. : 151-162
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
Related content
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Learning power and language expressiveness
By Martin E. Sharma A. Stephan F.
Theoretical Computer Science, Vol. 298, Iss. 2, 2003-04 ,pp. :
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Regular expression for a language without empty word
By Ziadi D.
Theoretical Computer Science, Vol. 163, Iss. 1, 1996-08 ,pp. :
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Language understanding and subsequential transducer learning
By Castellanos A. Vidal E. Varó M.A. Oncina J.
Computer Speech & Language, Vol. 12, Iss. 3, 1998-06 ,pp. :