A. N. Trahtman. Reducing the time complexity of testing for local threshold testability


Natural Sciences / Computer Science / Automata theory

Submitted on: Apr 01, 2012, 20:53:33

Description: New necessary and sufficient conditions for a deterministic finite automaton to be locally threshold testable are found. On the basis of these conditions, we modify the algorithm to verify local threshold testability of the automaton and to reduce the time complexity of the algorithm. The algorithm is implemented as a part of the C/C++ package TESTAS.

The abstract of this article has been published in the "Intellectual Archive Bulletin" , April 2012, ISSN 1929-1329.

The Library of Congress (USA) reference page : http://lccn.loc.gov/2012210064.
The Library and Archives Canada reference page: collectionscanada.gc.ca/ourl/res.php?url_ver=Z39.88......

To read the article posted on Intellectual Archive web site please click the link below.

A_N_Trahtman_Reducing_the_time_complexity_of_testing.pdf



© 2011-2017 Shiny World Corp. All rights reserved. To reach us please send an e-mail to support@IntellectualArchive.com