Ad Astra Awards
Ad Astra Journal
Science library
White book
University rankings
Who's who
Publications
Theses and dissertations
Ad Astra association
 
Press releases
News
Events
Funding opportunities
 
Login
Registration
 
>> Românã
 
   
 

Cezar Campeanu, Andrei Paun, Jason R. Smith. An Incremental Algorithm for Constructing Minimal Deterministic Finite Cover Automata. Theoretical Computer Science, 363(2), pp. 135-148, 2006.

Abstract: We present a fast incremental algorithm for constructing minimal Deterministic Finite Cover Automata (DFCA) for a given language. Since it was shown that the minimal DFCA for a language L has less states than the minimal Deterministic Finite Automata (DFA) for the same language L, this technique seems to be the best choice for incrementally building the automaton for a large language, especially when the number of states in the DFCA is significantly less than the number of states in the corresponding minimal DFA. We have implemented the proposed algorithm and have tested it against the best-known DFCA minimization technique.

Keywords: Deterministic Finite Cover Automata (DFCA); DFA; DFCA minimization; Incremental construction

URL: http://www.sciencedirect.com/science?_ob=GatewayURL&_origin=inwardhub&_urlversion=4&_method=citationSearch&_piikey=S0304397506004567&_referrer=www.informatik.uni-trier.de&_version=1&md5=2836b2b2019a78cf7c5adf8758d52149

Posted by Cezar Campeanu

Back

   
© Ad Astra 2001-2013