On algebraic and logical specifications of classes of regular languages

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.298, Iss.2, 2003-04, pp. : 325-346

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

An algorithmic approach for checking closure properties of temporal logic specifications and -regular languages

By Peled D. Wilke T. Wolper P.

Theoretical Computer Science, Vol. 195, Iss. 2, 1998-03 ,pp. : 183-203

Elsevier

Access to resources Recommend Favorite

An algebraic characterization of deterministic regular languages over infinite alphabets

By Francez N. Kaminski M.

Theoretical Computer Science, Vol. 306, Iss. 1, 2003-09 ,pp. : 155-175

Elsevier

Access to resources Recommend Favorite

Logical systems for structured specifications

By Borzyszkowski T.

Theoretical Computer Science, Vol. 286, Iss. 2, 2002-09 ,pp. : 197-245

Elsevier

Access to resources Recommend Favorite

Regular component decomposition of regular languages

By Liu Y.J.

Theoretical Computer Science, Vol. 299, Iss. 1, 2003-04 ,pp. : 743-749

Elsevier

Access to resources Recommend Favorite

Automated Flaw Detection in Algebraic Specifications

By Dunets Andriy Schellhorn Gerhard Reif Wolfgang

Journal of Automated Reasoning, Vol. 45, Iss. 4, 2010-12 ,pp. : 359-395

Springer Publishing Company

Access to resources Recommend Favorite