• DocumentCode
    1931950
  • Title

    A Cognitive Approach for Optimal Minimization of State Transitions in Nondeterministic Finite Automata

  • Author

    Aravind, Sudip ; Mathews, Rony

  • fYear
    2012
  • fDate
    25-27 Sept. 2012
  • Firstpage
    363
  • Lastpage
    368
  • Abstract
    Power set construction and its variants to eliminate "dead", "unreachable" states have been the prevalent methods of minimization from Non-Deterministic Finite Automata to Deterministic Finite Automata. The drawbacks for these were the lack of adaptive improvements into the minimization process. The adaptation by means of cognitive models - perception, reasoning and decision-making - is being proposed as a better solution while handling real life problems involving decision making on transitions of states. The non-determinism added by the ambiguity in parallel transition options are resolved by applying cognitive processes. The ACT-R architecture is found to be convenient for modeling systems whose functionality can be deconstructed into a set of states, with the transition functions being modeled as production rules. The resultant model reduces the number of states from 2k to manageable values.
  • Keywords
    deterministic automata; finite automata; minimisation; ACT-R architecture; cognitive approach; deterministic finite automata; minimization process; nondeterministic finite automata; optimal minimiation; parallel transition options; power set construction; state transitions; Adaptation models; Automata; Computational modeling; Computer architecture; Doped fiber amplifiers; Minimization; Production; ACT-R; Cognitive model; DFA; NFA; State Transitions;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Computational Intelligence, Modelling and Simulation (CIMSiM), 2012 Fourth International Conference on
  • Conference_Location
    Kuantan
  • ISSN
    2166-8531
  • Print_ISBN
    978-1-4673-3113-5
  • Type

    conf

  • DOI
    10.1109/CIMSim.2012.35
  • Filename
    6338105