Non-erasing Variants of the Chomsky–Schützenberger Theorem
From MaRDI portal
(Redirected from Publication:3167489)
Recommendations
- Non-erasing Chomsky-Schützenberger theorem with grammar-independent alphabet
- The missing case in Chomsky-Schützenberger theorem
- A positive extension of Eilenberg's variety theorem for non-regular languages
- A reformulation of Chichilnisky's impossibility theorem
- The Chomsky-Schützenberger theorem for quantitative context-free languages
- The Chomsky-Schützenberger Theorem for Quantitative Context-Free Languages
- Generalizations of Chung-Feller Theorem
- A generalization of Chaplygin's reducibility theorem
- Extensions and consequences of Chvátal-Erdös' theorem
- Revisiting Chaitin's incompleteness theorem
Cited in
(14)- On the Chomsky and Stanley's homomorphic characterization of context-free languages
- On purely morphic characterizations of context-free languages
- Une note sur le théorème de caractérisation des générateurs algébriques. (A note on the characterization theorem for context-free generators)
- Hardest languages for conjunctive and Boolean grammars
- Non-erasing Chomsky-Schützenberger theorem with grammar-independent alphabet
- Epsilon-reducible context-free languages and characterizations of indexed languages
- The missing case in Chomsky-Schützenberger theorem
- Multidimensional trees and a Chomsky-Schützenberger-Weir representation theorem for simple context-free tree grammars
- Consensus game acceptors
- Chomsky-Schützenberger-type characterization of multiple context-free languages
- Consensus game acceptors and iterated transductions
- Limited automata and regular languages
- Limited automata and unary languages
- From words to pictures: row-column combinations and Chomsky-Schützenberger theorem
This page was built for publication: Non-erasing Variants of the Chomsky–Schützenberger Theorem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3167489)
