Representing recursively enumerable languages by iterated deletion
From MaRDI portal
Publication:1826643
DOI10.1016/J.TCS.2004.01.002zbMATH Open1072.68055OpenAlexW1986652500MaRDI QIDQ1826643FDOQ1826643
Authors: Michael Domaratzki, Alexander Okhotin 
Publication date: 6 August 2004
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2004.01.002
Recommendations
- scientific article; zbMATH DE number 58294
- On characterizations of recursively enumerable languages
- On representing recursively enumerable languages by internal contextual languages
- scientific article; zbMATH DE number 58295
- scientific article; zbMATH DE number 1774219
- A homomorphic characterization of recursively enumerable languages
- scientific article; zbMATH DE number 2182439
- A representation of recursively enumerable languages by two homomorphisms and a quotient
- Characterizations of recursively enumerable languages by means of insertion grammars
- scientific article; zbMATH DE number 17554
Cites Work
- Title not available (Why is that?)
- Reversal-bounded multipushdown machines
- Outfix and infix codes and related classes of languages
- Title not available (Why is that?)
- Shuffle and scattered deletion closure of languages
- Insertion and deletion closure of languages
- Title not available (Why is that?)
- Remarks on deletions, scattered deletions and related operations on languages
Cited In (9)
- On the computing powers of \(\mathcal{L}\)-reductions of insertion languages
- A representation of recursively enumerable languages by two homomorphisms and a quotient
- Insertion-deletion with substitutions. II: About the role of one-sided context
- Title not available (Why is that?)
- Parallel contextual array insertion-deletion P systems and array rewriting P systems with pure 2D context-free rules
- Iterated TGR Languages: Membership Problem and Effective Closure Properties
- Parallel contextual array insertion deletion P systems and tabled matrix grammars
- Title not available (Why is that?)
- Developments in Language Theory
This page was built for publication: Representing recursively enumerable languages by iterated deletion
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1826643)
