Author： Senizergues G.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.231, Iss.2, 2000-01, pp. : 309-334
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
L(A)=L(B)? decidability results from complete formal systems
By Senizergues
Theoretical Computer Science, Vol. 251, Iss. 1, 2001-01 ,pp. :
Access to resources
Recommend
Advanced elementary formal systems
By Lange S. Grieser G. Jantke K.P.
Theoretical Computer Science, Vol. 298, Iss. 1, 2003-04 ,pp. :
On complete systems of automata
Theoretical Computer Science, Vol. 245, Iss. 1, 2000-08 ,pp. :
Formal systems for gene assembly in ciliates
By Ehrenfeucht A. Harju T. Petre I. Prescott D.M. Rozenberg G.
Theoretical Computer Science, Vol. 292, Iss. 1, 2003-01 ,pp. :
Learning elementary formal systems with queries
By Sakamoto H. Hirata K. Arimura H.
Theoretical Computer Science, Vol. 298, Iss. 1, 2003-04 ,pp. :