Hyper-minimizing minimized deterministic finite state automata

Author： Badr Andrew   Geffert Viliam   Shipman Ian  

Publisher： Edp Sciences

E-ISSN： 1290-385x|43|1|69-94

ISSN： 0988-3754

Source： RAIRO - Theoretical Informatics and Applications, Vol.43, Iss.1, 2007-12, pp. : 69-94

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

Closure properties of hyper-minimized automata

By Szepietowski Andrzej  

RAIRO - Theoretical Informatics and Applications, Vol. 45, Iss. 4, 2012-01 ,pp. : 459-466

Edp Sciences

Access to resources Recommend Favorite

Note on the Succinctness of Deterministic, Nondeterministic, Probabilistic and Quantum Finite Automata

By Mereghetti Carlo   Palano Beatrice   Pighizzini Giovanni  

RAIRO - Theoretical Informatics and Applications, Vol. 35, Iss. 5, 2010-03 ,pp. : 477-490

Edp Sciences

Access to resources Recommend Favorite

On the state complexity of semi-quantum finite automata⋆⋆⋆

By Zheng Shenggen   Gruska Jozef   Qiu Daowen  

RAIRO - Theoretical Informatics and Applications, Vol. 48, Iss. 2, 2014-05 ,pp. : 187-207

Edp Sciences

Access to resources Recommend Favorite

Spelling Correction for Text Documents in Bahasa Indonesia Using Finite State Automata and Levinshtein Distance Method

By  

MATEC Web of conference, Vol. 164, Iss. issue, 2018-04 ,pp. : 01047-01047

Edp Sciences

Access to resources Recommend Favorite

Quantum finite automata with control language

By Mereghetti Carlo   Palano Beatrice  

RAIRO - Theoretical Informatics and Applications, Vol. 40, Iss. 2, 2006-07 ,pp. : 315-332

Edp Sciences

Access to resources Recommend Favorite