Interconvertibility of a class of set constraints and context-free-language reachability

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.248, Iss.1, 2000-10, pp. : 29-98

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

A Formal Language for XML Authorisations Based on Answer Set Programming and Temporal Interval Logic Constraints

International Journal of Secure Software Engineering (IJSSE), Vol. 2, Iss. 1, 2011-01 ,pp. : 22-39

IGI Global_journal

Access to resources Recommend Favorite

Rational spaces and set constraints

By Kozen D.

Theoretical Computer Science, Vol. 167, Iss. 1, 1996-10 ,pp. : 73-94

Elsevier

Access to resources Recommend Favorite

Reachability in live and safe free-choice Petri nets is NP-complete

By Esparza J.

Theoretical Computer Science, Vol. 198, Iss. 1, 1998-05 ,pp. : 211-224

Elsevier

Access to resources Recommend Favorite

Symbol Manipulation with Neural Networks: Production of a Context-free Language Using a Modifiable Working Memory

By Velde Frank Van Der

Connection Science, Vol. 7, Iss. 3-4, 1995-09 ,pp. : 247-280

Taylor & Francis Ltd

Access to resources Recommend Favorite

Cooperation in context-free grammars

By Dassow J. Mitrana V.

Theoretical Computer Science, Vol. 180, Iss. 1, 1997-06 ,pp. : 353-361

Elsevier

Access to resources Recommend Favorite