On Parikh slender context-free languages (Q5941095): Difference between revisions

In a recent paper we defined and studied Parikh slender languages and showed that they can be used in simplifying ambiguity proofs of context-free languages. In this paper Parikh slender context-free languages are characterized. The characterization has diverse applications.

0 references

Mathematics Subject Classification ID

68Q45

0 references

zbMATH DE Number

1635260

0 references

zbMATH Keywords

context-free languages

0 references

Parikh slender languages

0 references

bounded languages

0 references

describes a project that uses

ALGOL 60

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

Language-theoretic problems arising from Richelieu cryptosystems

0 references

Prefixes of infinite words and ambiguous context-free languages

0 references

Q4431364

0 references

Q4079524

0 references

Analytic models and ambiguity of context-free languages

0 references

Q5576254

0 references

Bounded Algol-Like Languages

0 references

On Parikh slender languages and power series

0 references

A decision method for Parikh slenderness of context-free languages

0 references

Q4520516

0 references

On a conjecture about slender context-free languages

0 references

Q3704880

0 references

Slender 0L languages

0 references

Q4005193

0 references

Closure properties of slender languages

0 references

Thin and slender languages

0 references

Length considerations in context-free languages

0 references

Q4140407

0 references

Q5678435

0 references

Numeration systems, linear recurrences, and regular sets

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5941095

@@ Property / cites work @@
+Language-theoretic problems arising from Richelieu cryptosystems
+Normal rank
@@ Property / cites work @@
+Prefixes of infinite words and ambiguous context-free languages
+Normal rank
@@ Property / cites work @@
+Q4431364
@@ Property / cites work: Q4431364 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4079524
@@ Property / cites work: Q4079524 / rank @@
+Normal rank
@@ Property / cites work @@
+Analytic models and ambiguity of context-free languages
+Normal rank
@@ Property / cites work @@
+Q5576254
@@ Property / cites work: Q5576254 / rank @@
+Normal rank
@@ Property / cites work @@
+Bounded Algol-Like Languages
@@ Property / cites work: Bounded Algol-Like Languages / rank @@
+Normal rank
@@ Property / cites work @@
+On Parikh slender languages and power series
@@ Property / cites work: On Parikh slender languages and power series / rank @@
+Normal rank
@@ Property / cites work @@
+A decision method for Parikh slenderness of context-free languages
+Normal rank
@@ Property / cites work @@
+Q4520516
@@ Property / cites work: Q4520516 / rank @@
+Normal rank
@@ Property / cites work @@
+On a conjecture about slender context-free languages
+Normal rank
@@ Property / cites work @@
+Q3704880
@@ Property / cites work: Q3704880 / rank @@
+Normal rank
@@ Property / cites work @@
+Slender 0L languages
@@ Property / cites work: Slender 0L languages / rank @@
+Normal rank
@@ Property / cites work @@
+Q4005193
@@ Property / cites work: Q4005193 / rank @@
+Normal rank
@@ Property / cites work @@
+Closure properties of slender languages
@@ Property / cites work: Closure properties of slender languages / rank @@
+Normal rank
@@ Property / cites work @@
+Thin and slender languages
@@ Property / cites work: Thin and slender languages / rank @@
+Normal rank
@@ Property / cites work @@
+Length considerations in context-free languages
@@ Property / cites work: Length considerations in context-free languages / rank @@
+Normal rank
@@ Property / cites work @@
+Q4140407
@@ Property / cites work: Q4140407 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5678435
@@ Property / cites work: Q5678435 / rank @@
+Normal rank
@@ Property / cites work @@
+Numeration systems, linear recurrences, and regular sets
+Normal rank