Author： Immerman N. Patnaik S. Stemple D.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.155, Iss.1, 1996-02, pp. : 111-140
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
On the Expressiveness of Linda-like Concurrent Languages
Electronic Notes in Theoretical Computer Science, Vol. 16, Iss. 2, 2004-01 ,pp. :
Access to resources
Recommend
Stochastic Finite Learning of the Pattern Languages
Machine Learning, Vol. 44, Iss. 1-2, 2001-07 ,pp. :
Languages recognized by finite aperiodic groupoids
By Beaudry M.
Theoretical Computer Science, Vol. 209, Iss. 1, 1998-12 ,pp. :
Minimal cover-automata for finite languages
By Campeanu C. Santean N. Yu S.
Theoretical Computer Science, Vol. 267, Iss. 1, 2001-09 ,pp. :