Characterizations of re languages starting from internal contextual languages∗

DOI10.1080/00207169808804634MaRDI QIDQ4380274zbMATH OpenOpenAlexFDO

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

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)

Recommendations

• scientific article; zbMATH DE number 1101389
• On representing recursively enumerable languages by internal contextual languages
• Chomsky-Schutzenberger type characterizations based on contextual languages
• On Internal Contextual Grammars with Subregular Selection Languages
• Characterizations of recursively enumerable languages by means of insertion grammars
• Characterizing languages by normalization and termination in string rewriting (extended abstract)
• scientific article; zbMATH DE number 2182439
• On fixed and general membership for external and internal contextual languages
• On subregular selection languages in internal contextual grammars

Cites work

• scientific article; zbMATH DE number 1101389 (Why is no real title available?)
• Fixed Point Languages, Equality Languages, and Representation of Recursively Enumerable Languages
• On Computable Numbers, with an Application to the Entscheidungsproblem
• On representing recursively enumerable languages by internal contextual languages
• Reversal-bounded multipushdown machines

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

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