A new algorithm for regularizing one-letter context-free grammars. (Q1426442): Difference between revisions

@@ Property / cites work @@
+Q4714446
@@ Property / cites work: Q4714446 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3292904
@@ Property / cites work: Q3292904 / rank @@
+Normal rank
@@ Property / cites work @@
+Two iteration theorems for some families of languages
+Normal rank
@@ Property / cites work @@
+On certain formal properties of grammars
@@ Property / cites work: On certain formal properties of grammars / rank @@
+Normal rank
@@ Property / cites work @@
+Q5526125
@@ Property / cites work: Q5526125 / rank @@
+Normal rank
@@ Property / cites work @@
+Finite automata and unary languages
@@ Property / cites work: Finite automata and unary languages / rank @@
+Normal rank
@@ Property / cites work @@
+Simulating finite automata with context-free grammars.
+Normal rank
@@ Property / cites work @@
+Two Families of Languages Related to ALGOL
@@ Property / cites work: Two Families of Languages Related to ALGOL / rank @@
+Normal rank
@@ Property / cites work @@
+Infinite linear systems and one counter languages
@@ Property / cites work: Infinite linear systems and one counter languages / rank @@
+Normal rank
@@ Property / cites work @@
+Language equations over a one-letter alphabet with union, concatenation and star: A complete solution
+Normal rank
@@ Property / cites work @@
+On Context-Free Languages
@@ Property / cites work: On Context-Free Languages / rank @@
+Normal rank
@@ Property / cites work @@
+Q5588675
@@ Property / cites work: Q5588675 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2708948
@@ Property / cites work: Q2708948 / rank @@
+Normal rank