Author: Beal M.-P. Carton O. Prieur C. Sakarovitch J.
Publisher: Elsevier
ISSN: 0304-3975
Source: Theoretical Computer Science, Vol.292, Iss.1, 2003-01, pp. : 45-63
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
Related content
An efficient null-free procedure for deciding regular language membership
By Ponty J.-L.
Theoretical Computer Science, Vol. 231, Iss. 1, 2000-01 ,pp. :
Deciding sequentiability of finite-state transducers by finite-state pattern-matching
By Gaal T.
Theoretical Computer Science, Vol. 313, Iss. 1, 2004-02 ,pp. :
Semantics and strong sequentiality of priority term rewriting systems
Theoretical Computer Science, Vol. 208, Iss. 1, 1998-11 ,pp. :