• Cellular Automata: Algorithms and Applications 

      Clarridge, Adam (2009-03-23)
      Cellular automata (CA) are an interesting computation medium to study because of their simplicity and inherently parallel operation. These characteristics make them a useful and efficient computation tool for applications ...
    • Cellular Automaton Based Algorithms for Wireless Sensor Networks 

      Choudhury, Salimur (2012-11-26)
      Wireless sensor networks have been used in different applications due to the advancement of sensor technology. These uses also have raised different optimization issues. Most of the algorithms proposed as solutions to the ...
    • The Computational Power of Extended Watson-Crick L Systems 

      Sears, David (2010-12-07)
      Lindenmayer (L) systems form a class of interesting computational formalisms due to their parallel nature, the various circumstances under which they operate, the restrictions imposed on language acceptance, and other ...
    • New metrics for finite automaton complexity and subregular language hierarchies 

      Keeler, Chris
      The degree of ambiguity of nondeterministic finite automata (NFA) has been studied significantly since at least the 1980s. Roughly speaking, the degree of ambiguity counts the number of accepting computations of an ...
    • State Complexity of Nondeterministic Finite Automata with Limited Nondeterminism 

      Palioudakis, Alexandros (2014-09-15)
      Various approaches of quantifying nondeterminism in nondeterministic finite automata (NFA) are considered. We consider nondeterministic finite automata having finite tree width (ftw-NFA) where the computation on any input ...
    • State Complexity of Tree Automata 

      Piao, Xiaoxue (2012-01-04)
      Modern applications of XML use automata operating on unranked trees. A common definition of tree automata operating on unranked trees uses a set of vertical states that define the bottom-up computation, and the transitions ...