TY - JOUR
AU - Simone Brognoli, Gianfranco Lamperti, Michele Scandale
AB - Subset Construction ( SC ) is the classical algorithm for the determinization of a nondeterministic finite automaton (NFA) into an equivalent deterministic one (DFA). Although SC works fine in most application domains, it may be inappropriate when the NFA expands over time and determinization is required after each expansion, such as in diagnosis of active systems in artificial intelligence, or in model-based testing in software engineering. For such an expanding automaton, the IDEA algorithm ( Incremental Determinization of Expanding Automata ) may be more suitable. Given an NFA N N , an equivalent DFA D D , and an expansion Δ N ΔN of N N , the determinization of N ′ = N ∪ Δ N N′=N∪ΔN into D ′ D′ is performed based not only on N ′ N′ but also on Δ N ΔN and D D . Rather than starting from scratch the generation of the DFA D ′ D′ equivalent to N ′ N′ , IDEA applies the set of actions which are sufficient for transforming D D into D ′ D′ . This way, a possibly large part of the determinization process is avoided. Experiments show that the degree of convenience in determinizing expanding automata using IDEA rather than SC largely depends on the nature of the expanding automaton in the actual application domain. Key words Finite Automata Cyclic Automata Expanding Automata Determinization Subset Construction Incremental Techniques © The British Computer Society 2016. All rights reserved. For Permissions, please email: journals.permissions@oup.com « Previous | Next Article » Table of Contents This Article The Computer Journal (2016) 59 (12): 1872-1899. doi: 10.1093/comjnl/bxw044 First published online: August 3, 2016 » Abstract Free Full Text (HTML) Free Full Text (PDF) Free Supplementary Data All Versions of this Article: bxw044v1 59/12/1872 most recent Classifications Section A: Computer Science Theory, Methods and Tools Original Articles Services Article metrics Alert me when cited Alert me if corrected Find similar articles Similar articles in Web of Science Add to my archive Download citation Request Permissions Citing Articles Load citing article information Citing articles via CrossRef Citing articles via Scopus Citing articles via Web of Science Google Scholar Articles by Brognoli, S. Articles by Scandale, M. Related Content Load related web page information Share Email this article CiteULike Delicious Facebook Google+ Mendeley Twitter What's this? Search this journal: Advanced » Current Issue December 2016 59 (12) Alert me to new issues The Journal About this journal Rights & Permissions Dispatch date of the next issue The Wilkes Award We are mobile – find out more Reviewer Guidelines Guidelines for Editors Review and Appeals Process Journals Career Network Published on behalf of BCS, The Chartered Institute for IT Impact factor: 1.000 5-Yr impact factor: 1.041 View full editorial board For Authors Instructions to authors Online submission instructions Submit a manuscript Self archiving policy 3hWaciBYRk30rSOQ7UOpP6viAxsZnEle true Looking for your next opportunity? Looking for jobs... Alerting Services Email table of contents Email Advance Access CiteTrack XML RSS feed Corporate Services Advertising sales Reprints Supplements var taxonomies = ("SCI01540"); Most Most Read A Simplex Method for Function Minimization What is the Use of Operating Systems? Data Compression for a Source with Markov Characteristics Overview of Parallel Architectures for Databases Permutations by Interchanges » View all Most Read articles Most Cited A Simplex Method for Function Minimization How Many Clusters? Which Clustering Method? Answers Via Model-Based Cluster Analysis A new approach to variable metric algorithms A Rapidly Convergent Descent Method for Minimization Function minimization by conjugate gradients » View all Most Cited articles Disclaimer: Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department. Online ISSN 1460-2067 - Print ISSN 0010-4620 Copyright © 2016 British Computer Society Oxford Journals Oxford University Press Site Map Privacy Policy Cookie Policy Legal Notices Frequently Asked Questions Other Oxford University Press sites: Oxford University Press Oxford Journals China Oxford Journals Japan Academic & Professional books Children's & Schools Books Dictionaries & Reference Dictionary of National Biography Digital Reference English Language Teaching Higher Education Textbooks International Education Unit Law Medicine Music Online Products & Publishing Oxford Bibliographies Online Oxford Dictionaries Online Oxford English Dictionary Oxford Language Dictionaries Online Oxford Scholarship Online Reference Rights and Permissions Resources for Retailers & Wholesalers Resources for the Healthcare Industry Very Short Introductions World's Classics function fnc_onDomLoaded() { var query_context = getQueryContext(); PF_initOIUnderbar(query_context,":QS:default","","JRN"); PF_insertOIUnderbar(0); }; if (window.addEventListener) { window.addEventListener('load', fnc_onDomLoaded, false); } else if (window.attachEvent) { window.attachEvent('onload', fnc_onDomLoaded); } var gaJsHost = (("https:" == document.location.protocol) ? "https://ssl." : "http://www."); document.write(unescape("%3Cscript src='" + gaJsHost + "google-analytics.com/ga.js' type='text/javascript'%3E%3C/script%3E")); try { var pageTracker = _gat._getTracker("UA-189672-16"); pageTracker._setDomainName(".oxfordjournals.org"); pageTracker._trackPageview(); } catch(err) {}
TI - Incremental Determinization of Expanding Automata
JO - The Computer Journal
DO - 10.1093/comjnl/bxw044
DA - 2016-12-01
UR - https://www.deepdyve.com/lp/oxford-university-press/incremental-determinization-of-expanding-automata-NeLPss1OKw
SP - 1872
VL - 59
IS - 12
DP - DeepDyve
ER -