A new algorithm for regularizing one-letter context-free grammars. (Q1426442): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 17:36, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A new algorithm for regularizing one-letter context-free grammars. |
scientific article |
Statements
A new algorithm for regularizing one-letter context-free grammars. (English)
0 references
14 March 2004
0 references
Reduction of a context-free grammar
0 references
One-letter context-free language
0 references
Regular expression
0 references
