scientific article; zbMATH DE number 1101389

zbMath0880.68073MaRDI QIDQ4370835

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

Publication date: 7 January 1998

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

formal languagesrecursively enumerable languagescontextual grammars

Mathematics Subject Classification ID

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

Related Items (4)

On computational complexity of contextual languages ⋮ Characterizations of re languages starting from internal contextual languages^∗ ⋮ From Contextual Grammars to Range Concatenation Grammars ⋮ Characterizations of recursively enumerable languages by means of insertion grammars

This page was built for publication: