Characterizations of re languages starting from internal contextual languages∗

DOI10.1080/00207169808804634zbMath0892.68054OpenAlexW1987286364MaRDI QIDQ4380274

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

Publication date: 27 April 1998

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207169808804634

zbMATH Keywords

internal contextual language

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Unnamed Item
• Reversal-bounded multipushdown machines
• On representing recursively enumerable languages by internal contextual languages
• Fixed Point Languages, Equality Languages, and Representation of Recursively Enumerable Languages
• On Computable Numbers, with an Application to the Entscheidungsproblem

This page was built for publication: Characterizations of re languages starting from internal contextual languages^∗