scientific article; zbMATH DE number 1101389

MaRDI QIDQ4370835zbMATH OpenFDO

Authors Andrzej Ehrenfeucht, Alexandru Mateescu, Gheorghe Păun, Grzegorz Rozenberg, Arto Salomaa

Publication date 7 January 1998

zbMATH Keywords

contextual grammarsformal languagesrecursively enumerable languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Semantics in the theory of computing (68Q55)

Recommendations

• On representing recursively enumerable languages by internal contextual languages
• Characterizations of re languages starting from internal contextual languages^∗
• One-sided random context grammars with a limited number of right random context rules
• One-sided random context grammars
• scientific article; zbMATH DE number 2182426

Cited in

(5)

• On representing recursively enumerable languages by internal contextual languages
• Characterizations of recursively enumerable languages by means of insertion grammars
• On computational complexity of contextual languages
• Characterizations of re languages starting from internal contextual languages^∗
• From contextual grammars to range concatenation grammars

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4370835)