グライバッハ標準形
1. Greibach normal formIn computer science and formal language theory, a context-free grammar is in Greibach normal form if the right-hand sides of all productions start with a terminal symbol, optionally followed by some variables. A non-strict form allows one exception to this format restriction for allowing the empty word (epsilon, ε) to be a member of the described language. The normal form bears the name of Sheila Greibach.
Read “Greibach normal form” on English Wikipedia
Read “グライバッハ標準形” on Japanese Wikipedia
Read “Greibach normal form” on DBpedia
Read “Greibach normal form” on English Wikipedia
Read “グライバッハ標準形” on Japanese Wikipedia
Read “Greibach normal form” on DBpedia
Discussions
Log in to talk about this word.