Skip to content
#

automata-learning

Here are 28 public repositories matching this topic...

[“形式语言与自动机”实验:给定任意上下文无关文法,将其转换为Greibach范式,再转换为NPDA,并能验证给定句子是否属于该文法。][Given an context-free grammar, convert it to Greibach paradigm, then to NPDA(i.e. Non-deterministic PushDown Automaton), and verify whether any sentence belongs to the grammar.]

  • Updated May 1, 2022
  • C++

Improve this page

Add a description, image, and links to the automata-learning topic page so that developers can more easily learn about it.

Curate this topic

Add this topic to your repo

To associate your repository with the automata-learning topic, visit your repo's landing page and select "manage topics."

Learn more

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy