home bbs files messages ]

Forums before death by AOL, social media and spammers... "We can't have nice things"

   comp.compilers      Compiler construction, theory, etc. (Mod      2,753 messages   

[   << oldest   |   < older   |   list   |   newer >   |   newest >>   ]

   Message 2,273 of 2,753   
   Kaz Kylheku to federation2005@netzero.com   
   Re: NFA with non-deterministic outputs   
   14 Apr 14 04:34:51   
   
   From: kaz@kylheku.com   
      
   On 2014-04-13, federation2005@netzero.com  wrote:   
   > So, no. NFA's are not the appropriate model to use here. Rather, one would   
   use   
   > a non-deterministic FSM (finite state machine).   
      
   "FA" stands for "finite automaton", which is a synonym of FSM, "finite state   
   machine".   
      
   There is no difference between "NFA" and "non-deterministic FSM".   
      
   --- SoupGate-Win32 v1.05   
    * Origin: you cannot sedate... all the things you hate (1:229/2)   

[   << oldest   |   < older   |   list   |   newer >   |   newest >>   ]


(c) 1994,  bbs@darkrealms.ca