Polynomial languages with finite antidictionaries

E-ISSN： 1290-385x|43|2|269-279

ISSN： 0988-3754

Source： RAIRO - Theoretical Informatics and Applications, Vol.43, Iss.2, 2008-11, pp. : 269-279

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

Consensual languages and matching finite-state computations

By Crespi Reghizzi Stefano San Pietro Pierluigi

RAIRO - Theoretical Informatics and Applications, Vol. 45, Iss. 1, 2011-03 ,pp. : 77-97

Edp Sciences

Access to resources Recommend Favorite

Modification of the Lagrange Interpolating Polynomial Scheme for Using with the Finite Difference Method

MATEC Web of conference, Vol. 136, Iss. issue, 2017-11 ,pp. : 01005-01005

Edp Sciences

Access to resources Recommend Favorite

Comparing the succinctness of monadic query languages over finite trees

By Grohe Martin Schweikardt Nicole

RAIRO - Theoretical Informatics and Applications, Vol. 38, Iss. 4, 2010-03 ,pp. : 343-373

Edp Sciences

Access to resources Recommend Favorite

Languages of finite words occurring infinitely many times in an infinite word

By Thomsen Klaus

RAIRO - Theoretical Informatics and Applications, Vol. 39, Iss. 4, 2010-03 ,pp. : 641-650

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