Complete formal systems for equivalence problems - Their relevance to formal languages and automata

By Senizergues G.  

Theoretical Computer Science, Vol. 231, Iss. 2, 2000-01 ,pp. : 309-334

Elsevier

Access to resources Recommend Favorite

PSPACE-complete problems for subgroups of free groups and inverse finite automata

By Birget J.-C.   Margolis S.   Meakin J.   Weil P.  

Theoretical Computer Science, Vol. 242, Iss. 1, 2000-07 ,pp. : 247-281

Elsevier

Access to resources Recommend Favorite

A Random NP-complete problem for inversion of 2D cellular automata

By Durand B.  

Theoretical Computer Science, Vol. 148, Iss. 1, 1995-08 ,pp. : 19-32

Elsevier

Access to resources Recommend Favorite

An Automata-Theoretic Approach to the Reachability Analysis of RPPS Systems

By Labroue A.   Schnoebelen P.  

Electronic Notes in Theoretical Computer Science, Vol. 52, Iss. 1, 2004-01 ,pp. : 1-20

Elsevier

Access to resources Recommend Favorite

Stabilization of Finite Automata with Application to Hybrid Systems Control

By Kobayashi Koichi  

Discrete Event Dynamic Systems, Vol. 21, Iss. 4, 2011-12 ,pp. : 519-545

Springer Publishing Company

Access to resources Recommend Favorite