Extending regular expressions with homomorphic replacement

Author： Bordihn Henning Dassow Jürgen Holzer Markus

E-ISSN： 1290-385x|44|2|229-255

ISSN： 0988-3754

Source： RAIRO - Theoretical Informatics and Applications, Vol.44, Iss.2, 2010-05, pp. : 229-255

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

Conversion of regular expressions into realtime automata

By Geffert Viliam Ištoňová L'ubomíra

RAIRO - Theoretical Informatics and Applications, Vol. 40, Iss. 4, 2006-11 ,pp. : 611-629

Edp Sciences

Access to resources Recommend Favorite

A Finite Axiomatization of Nondeterministic Regular Expressions

By Corradini Flavio De Nicola Rocco Labella Anna

RAIRO - Theoretical Informatics and Applications, Vol. 33, Iss. 4-5, 2010-03 ,pp. : 447-465

Edp Sciences

Access to resources Recommend Favorite

A general framework for the derivation of regular expressions

By Caron Pascal Champarnaud Jean-Marc Mignot Ludovic

RAIRO - Theoretical Informatics and Applications, Vol. 48, Iss. 3, 2014-07 ,pp. : 281-305

Edp Sciences

Access to resources Recommend Favorite

Construction of tree automata from regular expressions

By Kuske Dietrich Meinecke Ingmar

RAIRO - Theoretical Informatics and Applications, Vol. 45, Iss. 3, 2011-09 ,pp. : 347-370

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