On decision problems concerning contextual insertions and deletions
From MaRDI portal
Recommendations
Cites work
- \(L(A)=L(B)\)? decidability results from complete formal systems
- Abstract families of deterministic languages
- An Algorithm for the General Petri Net Reachability Problem
- Context insertions
- Contextual insertions/deletions and computability
- scientific article; zbMATH DE number 3664335 (Why is no real title available?)
- scientific article; zbMATH DE number 3509706 (Why is no real title available?)
- New Decidability Results Concerning Two-Way Counter Machines
- On the complexity of decision problems for some classes of machines and applications
- On the containment and equivalence problems for two-way transducers
- Recursive unsolvability of Post's problem of Tag und other topics in theory of Turing machines
- Remarks on blind and partially blind one-way multicounter machines
- Reversal-Bounded Multicounter Machines and Their Decision Problems
- Reversal-bounded multipushdown machines
- Semilinearity and Context-Freeness of Languages Accepted by Valence Automata
- The complexity of decision problems for finite-turn multicounter machines
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)
