On decision problems concerning contextual insertions and deletions

DOI10.1016/j.tcs.2024.114905MaRDI QIDQ6652448

Ian McQuillan, Oscar H. Ibarra

Publication date: 12 December 2024

Published in: (Search for Journal in Brave)

zbMATH Keywords

Could not fetch data.

Mathematics Subject Classification ID

Could not fetch data.

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• On the containment and equivalence problems for two-way transducers
• Contextual insertions/deletions and computability
• Recursive unsolvability of Post's problem of Tag und other topics in theory of Turing machines
• The complexity of decision problems for finite-turn multicounter machines
• Reversal-bounded multipushdown machines
• Remarks on blind and partially blind one-way multicounter machines
• \(L(A)=L(B)\)? decidability results from complete formal systems
• Semilinearity and Context-Freeness of Languages Accepted by Valence Automata
• Context Insertions
• An Algorithm for the General Petri Net Reachability Problem
• Reversal-Bounded Multicounter Machines and Their Decision Problems
• New Decidability Results Concerning Two-Way Counter Machines
• Abstract families of deterministic languages
• On the complexity of decision problems for some classes of machines and applications

This page was built for publication: On decision problems concerning contextual insertions and deletions

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