wiki_research

personal research wiki
git clone https://a3nm.net/git/wiki_research/
Log | Files | Refs

context_free_language_reachability (374B)

      1 # Context free language reachability
      2 
      3 Given a [directed_graph] G with [edges] labeled with [letters] from an [alphabet], a [source] s and [sink] t, and a [CFG] Gamma, define if there is a [walk] from s to t spelling a word of Gamma.
      4 
      5 Can be solved in [cubic] time [bringmann2024nfa]
      6 
      7 [Subcubic_equivalent] to [2NPDA_acceptance]
      8 
      9 Up: [computational_problem], [graph], [CFGs]