A C++ library for simulating automata and Turing machines
-
Updated
Jun 14, 2023 - C++
A C++ library for simulating automata and Turing machines
[“形式语言与自动机”实验:给定任意上下文无关文法,将其转换为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.]
Add a description, image, and links to the automata-learning topic page so that developers can more easily learn about it.
To associate your repository with the automata-learning topic, visit your repo's landing page and select "manage topics."