Optimal estimation on the order of local testability of finite automata

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.231, Iss.1, 2000-01, pp. : 59-74

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

Algorithms finding the order of local testability of deterministic finite automaton and estimations of the order

By Trahtman A.N.

Theoretical Computer Science, Vol. 235, Iss. 1, 2000-03 ,pp. : 183-204

Elsevier

Access to resources Recommend Favorite

Optimal simulation of two-dimensional alternating finite automata by three-way nondeterministic Turing machines

By Ito A. Inoue K. Takanami I. Wang Y.

Theoretical Computer Science, Vol. 143, Iss. 1, 1995-07 ,pp. : 123-135

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