Computing the prefix of an automaton

Author： Béal Marie-Pierre   Carton Olivier  

Publisher： Edp Sciences

E-ISSN： 1290-385x|34|6|503-514

ISSN： 0988-3754

Source： RAIRO - Theoretical Informatics and Applications, Vol.34, Iss.6, 2010-03, pp. : 503-514

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

Computing the Rabin Index of a Parity Automaton

By Carton Olivier   Maceiras Ramón  

RAIRO - Theoretical Informatics and Applications, Vol. 33, Iss. 6, 2010-03 ,pp. : 495-505

Edp Sciences

Access to resources Recommend Favorite

Complexity results for prefix grammars

By Lohrey Markus   Petersen Holger  

RAIRO - Theoretical Informatics and Applications, Vol. 39, Iss. 2, 2010-03 ,pp. : 391-401

Edp Sciences

Access to resources Recommend Favorite

On the size of transducers for bidirectional decoding of prefix codes

By Giambruno Laura   Mantaci Sabrina  

RAIRO - Theoretical Informatics and Applications, Vol. 46, Iss. 2, 2012-04 ,pp. : 315-328

Edp Sciences

Access to resources Recommend Favorite

Construction of a Deterministic ω-Automaton Using Derivatives

By Redziejowski Roman R.  

RAIRO - Theoretical Informatics and Applications, Vol. 33, Iss. 2, 2010-03 ,pp. : 133-158

Edp Sciences

Access to resources Recommend Favorite

Linear grammars with one-sided contexts and their automaton representation∗

By Barash Mikhail   Okhotin Alexander  

RAIRO - Theoretical Informatics and Applications, Vol. 49, Iss. 2, 2015-07 ,pp. : 153-178

Edp Sciences

Access to resources Recommend Favorite