Better-quasi-orderings and coinduction

Author： Forster T.  

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.309, Iss.1, 2003-12, pp. : 111-123

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

Involutive divisions and monomial orderings

By Semenov A.   Zyuzikov P.  

Programming and Computer Software, Vol. 33, Iss. 3, 2007-05 ,pp. : 139-146

MAIK Nauka/Interperiodica

Access to resources Recommend Favorite

Intelligent variable orderings and re-orderings in DAC-based solvers for WCSP

By Heras Federico   Larrosa Javier  

Journal of Heuristics, Vol. 12, Iss. 4-5, 2006-09 ,pp. : 287-306

Springer Publishing Company

Access to resources Recommend Favorite

Characterisations of balanced words via orderings

By Jenkinson O.   Zamboni L.Q.  

Theoretical Computer Science, Vol. 310, Iss. 1, 2004-01 ,pp. : 247-271

Elsevier

Access to resources Recommend Favorite

Control of Discrete-Event Systems with Partial Observations Using Coalgebra and Coinduction

By Komenda Jan   Schuppen Jan  

Discrete Event Dynamic Systems, Vol. 15, Iss. 3, 2005-09 ,pp. : 257-315

Springer Publishing Company

Access to resources Recommend Favorite

Fuzzy orderings in flexible query answering systems

By Bodenhofer U.   Küng J.  

Soft Computing, Vol. 8, Iss. 7, 2004-07 ,pp. : 512-522

Springer Publishing Company

Access to resources Recommend Favorite