Characterizations of re languages starting from internal contextual languages∗
From MaRDI portal
Publication:4380274
DOI10.1080/00207169808804634zbMATH Open0892.68054OpenAlexW1987286364MaRDI QIDQ4380274FDOQ4380274
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
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
- Title not available (Why is that?)
- 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)
