Author： Daley M. Ibarra O.H. Kari L.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.306, Iss.1, 2003-09, pp. : 19-38
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
Closure operations for digital topology
By Slapal J.
Theoretical Computer Science, Vol. 305, Iss. 1, 2003-08 ,pp. :
Access to resources
Recommend
On upper bound graphs with respect to operations on graphs
By Era H. Ogawa K. Tsuchiya M.
Theoretical Computer Science, Vol. 235, Iss. 2, 2000-03 ,pp. :
On metric rigidity for some classes of codes
Problems of Information Transmission, Vol. 47, Iss. 1, 2011-03 ,pp. :
Characterization and closure properties of linear -languages
By Mihoubi D.
Theoretical Computer Science, Vol. 191, Iss. 1, 1998-01 ,pp. :
On the closure properties of linear conjunctive languages
By Okhotin A.
Theoretical Computer Science, Vol. 299, Iss. 1, 2003-04 ,pp. :