Skip to main content

Home/ linguistics/ Group items tagged language

Rss Feed Group items tagged

Filter: All | Bookmarks | Topics Simple Middle
anonymous

Regular Expression Matching Can Be Simple And Fast (with NFAs) - 1 views

swtch.com/...regexp1.html

computational expression fsa linguistics match regexp regular regular expressions speed

shared by anonymous on 24 Aug 07 - Cached
  • anonymous on 19 May 08
     
    Thompson NFA (Nonfinite State Automata) perform way faster with longer regular expressions than those algorithms used in scripting languages
anonymous

STAX, The Finite State Machine Compiler & Simulator - 0 views

www.cs.virginia.edu/...stax-web

computational computing download fsa fsm linguistics of pda simulation software theory turing

shared by anonymous on 24 Aug 07 - Cached
  • anonymous on 24 Aug 07
     
    states that a PDA with two or more stacks has the same computational power as a turing machine (i.e. it is able to parse all decidable languages).
1 - 8 of 8
Showing 20▼ items per page