Intractability of decision problems for finite-memory automata

Author： Sakamoto H.   Ikeda D.  

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.231, Iss.2, 2000-01, pp. : 297-308

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

Decision problems for lower/upper bound parametric timed automata

By Bozzelli Laura   La Torre Salvatore  

Formal Methods in System Design, Vol. 35, Iss. 2, 2009-10 ,pp. : 121-151

Springer Publishing Company

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

ROUGH FINITE-STATE AUTOMATA

By BASU SUMITA  

Cybernetics and Systems, Vol. 36, Iss. 2, 2005-03 ,pp. : 107-124

Taylor & Francis Ltd

Access to resources Recommend Favorite

Finite automata on timed -trees

By La Torre S.   Napoli M.  

Theoretical Computer Science, Vol. 293, Iss. 3, 2003-02 ,pp. : 479-505

Elsevier

Access to resources Recommend Favorite

Finite automata and ordinals

By Bedon N.  

Theoretical Computer Science, Vol. 156, Iss. 1, 1996-03 ,pp. : 119-144

Elsevier

Access to resources Recommend Favorite