On representing recursively enumerable languages by internal contextual languages

DOI10.1016/S0304-3975(97)00035-2zbMath0913.68117OpenAlexW2089548442MaRDI QIDQ1275069

Andrzej Ehrenfeucht, Grzegorz Rozenberg, Gheorghe Păun

Publication date: 12 January 1999

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(97)00035-2

zbMATH Keywords

internal contextual languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items

Characterizations of re languages starting from internal contextual languages^∗ ⋮ Characterizations of recursively enumerable languages by means of insertion grammars ⋮ ON THE LEFTMOST DERVIATION IN MATRIX GRAMMARS

Cites Work

• The family of one-counter languages is closed under quotient
• Scattered versus context-sensitive rewriting
• Reversal-bounded multipushdown machines
• On characterizations of recursively enumerable languages
• The linear landscape of external contextual languages
• Algebraic linguistics; analytical models
• Programmed Grammars and Classes of Formal Languages
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item