A new algorithm for regularizing one-letter context-free grammars. (Q1426442)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A new algorithm for regularizing one-letter context-free grammars. |
scientific article; zbMATH DE number 2056792
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A new algorithm for regularizing one-letter context-free grammars. |
scientific article; zbMATH DE number 2056792 |
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
0 references
0.8578364
0 references
0.85501754
0 references
0.85267496
0 references
0.8489191
0 references
0.8469558
0 references
0.8431953
0 references
0.84310615
0 references
