Minimal NFA and biRFSA Languages

Author： Latteux Michel Roos Yves Terlutte Alain

E-ISSN： 1290-385x|43|2|221-237

ISSN： 0988-3754

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

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

Deterministic blow-ups of minimal NFA's

By Jirásková Galina

RAIRO - Theoretical Informatics and Applications, Vol. 40, Iss. 3, 2006-10 ,pp. : 485-499

Edp Sciences

Access to resources Recommend Favorite

Minimal partial languages and automata

By Blanchet-Sadri Francine Goldner K. Shackleton A.

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

Edp Sciences

Access to resources Recommend Favorite

Computing ϵ-Free NFA from Regular Expressions in O(n log²(n)) Time

By Hagenah Christian Muscholl Anca

RAIRO - Theoretical Informatics and Applications, Vol. 34, Iss. 4, 2010-03 ,pp. : 257-277

Edp Sciences

Access to resources Recommend Favorite

On Conjugacy of Languages

By Cassaigne Julien Karhumäki Juhani Maňuch Ján

RAIRO - Theoretical Informatics and Applications, Vol. 35, Iss. 6, 2010-03 ,pp. : 535-550

Edp Sciences

Access to resources Recommend Favorite

On minimal Hamming compatible distances

By Bakhtary Parsa Echi Othman

RAIRO - Theoretical Informatics and Applications, Vol. 48, Iss. 5, 2015-01 ,pp. : 495-503

Edp Sciences

Access to resources Recommend Favorite