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

E-ISSN： 1290-385x|43|4|779-790

ISSN： 0988-3754

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

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 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

INNOVATIVE SELECTION PROCESS OF EQUIPMENT MANUFACTURERS USING THE UNRANKED-PAIRED COMPARISON TECHNIQUE

By Margheim Waldo A. Umble K. Niec Jay H.

Proceedings of the Water Environment Federation, Vol. 2004, Iss. 13, 2004-01 ,pp. : 61-72

Water Environment Federation

Access to resources Recommend Favorite

Applying an Innovative Equipment Selection Process Using the Unranked-Paired Comparison Technique

By Niec Jay H. Margheim Waldo Umble Art K.

Proceedings of the Water Environment Federation, Vol. 2011, Iss. 15, 2011-01 ,pp. : 2021-2032

Water Environment Federation

Access to resources Recommend Favorite

A novel idea of pseudo-code generator in quantum-dot cellular automata (QCA)

By Ahmad Firdous Mustafa M. Wani Nisar Ahmad Mir Feroz A

International Journal for Simulation and Multidisciplinary Design Optimization, Vol. 5, Iss. issue, 2014-02 ,pp. : A04-A04

Edp Sciences

Access to resources Recommend Favorite

Research of the method of pseudo-random number generation based on asynchronous cellular automata with several active cells

MATEC Web of conference, Vol. 125, Iss. issue, 2017-10 ,pp. : 02018-02018

Edp Sciences

Access to resources Recommend Favorite