Minimal partial languages and automata

Author： Blanchet-Sadri Francine   Goldner K.   Shackleton A.  

Publisher： Edp Sciences

E-ISSN： 1290-385x|51|2|99-119

ISSN： 0988-3754

Source： RAIRO - Theoretical Informatics and Applications, Vol.51, Iss.2, 2017-11, pp. : 99-119

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Minimal NFA and biRFSA Languages

By Latteux Michel   Roos Yves   Terlutte Alain  

RAIRO - Theoretical Informatics and Applications, Vol. 43, Iss. 2, 2008-05 ,pp. : 221-237

Edp Sciences

Access to resources Recommend Favorite

On the classes of languages accepted by limited context restarting automata∗∗∗∗∗∗

By Otto Friedrich   Černo Peter   Mráz František  

RAIRO - Theoretical Informatics and Applications, Vol. 48, Iss. 1, 2014-03 ,pp. : 61-84

Edp Sciences

Access to resources Recommend Favorite

Atoms and partial orders of infinite languages

By Kuich Werner   Sauer N. W.  

RAIRO - Theoretical Informatics and Applications, Vol. 35, Iss. 4, 2010-03 ,pp. : 389-401

Edp Sciences

Access to resources Recommend Favorite

A perfect hashing incremental scheme for unranked trees using pseudo-minimal automata

By Carrasco Rafael C.   Daciuk Jan  

RAIRO - Theoretical Informatics and Applications, Vol. 43, Iss. 4, 2009-09 ,pp. : 779-790

Edp Sciences

Access to resources Recommend Favorite

Left-to-right regular languages and two-way restarting automata

By Otto Friedrich  

RAIRO - Theoretical Informatics and Applications, Vol. 43, Iss. 3, 2009-04 ,pp. : 653-665

Edp Sciences

Access to resources Recommend Favorite