Corrigendum to: ``On the computing powers of L-reductions of insertion languages

DOI10.1016/J.TCS.2021.06.028OpenAlexW4280628054MaRDI QIDQ2139059FDOQ2139059

Authors: Fumiya Okubo, Takashi Yokomori 

Publication date: 17 May 2022

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

Full work available at URL: https://doi.org/10.1016/j.tcs.2021.06.028

Recommendations

• On the computing powers of \(\mathcal{L}\)-reductions of insertion languages
• Corrigendum to ``An optimal lower bound for nonregular languages
• Corrigendum to: ``Iterated stack automata and complexity classes
• Erratum to ``The computational power of Benenson automata
• Corrigendum: "On the complexity of the successivity relation in computable linear orderings"
• Corrigendum to ``Semantics of a declarative language
• Correction to: ``Computational limitations of affine automata and generalized affine automata
• Corrigendum: On infinite computations in denotational semantics
• Corrigendum to: On ``On graph rewritings

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Biologically inspired models of computation (DNA computing, membrane computing, etc.) (68Q07)

Cited In (2)

• Corrigendum to: ``Iterated stack automata and complexity classes
• Corrigendum to ``An optimal lower bound for nonregular languages

This page was built for publication: Corrigendum to: ``On the computing powers of \(\mathcal{L}\)-reductions of insertion languages

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