Find centralized, trusted content and collaborate around the technologies you use most.
Teams
Q&A for work
Connect and share knowledge within a single location that is structured and easy to search.
在人类语言中：由 'c's 分隔的单词列表（由 'a's 和 'b's 构成）并且在某个索引 i 中至少存在一个单词，其中包含更多字母 'a' 然后索引 i+2 中的单词
A sample NPDA:
Push all a's of some w(i) into the stack, throw away(skip) w(i+1)'s letters, match w(i+2) a's with what is in the stack. If some a's remained in the stack, go to the final state.
