Decidability questions for insertion systems and related models
From MaRDI portal
Publication:5164868
DOI10.3233/FI-2021-2034OpenAlexW3162757880MaRDI QIDQ5164868FDOQ5164868
Authors: Andreas Malcher 
Publication date: 15 November 2021
Published in: Fundamenta Informaticae (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3233/fi-2021-2034
Recommendations
restarting automatadecidability questionspure grammarsinsertion systemsforgetting automataclearing restarting automata
Cites Work
- Regulated RNA rewriting: Modelling RNA editing with guided insertion
- Random context and semi-conditional insertion-deletion systems
- Title not available (Why is that?)
- Graph-controlled insertion-deletion systems
- Recursive unsolvability of Post's problem of Tag und other topics in theory of Turing machines
- Membership for growing context-sensitive grammars is polynomial
- Marcus contextual grammars
- Pure grammars
- Title not available (Why is that?)
- Universality and computational completeness of controlled leftist insertion-deletion systems
- Small size insertion and deletion systems
- Some decidability problems of sentential formst †
- On the computational completeness of graph-controlled insertion-deletion systems with binary sizes
- Universal matrix insertion grammars with small size
- On the Generative Power of Graph-Controlled Insertion-Deletion Systems with Small Sizes
- On the descriptional complexity of the window size for deleting restarting automata
- Post correspondence problem for short words
- Fundamentals of computation theory. 10th international conference, FCT'95, Dresden, Germany, August 22--25, 1995. Proceedings
- Clearing restarting automata
- \(\Delta \)-clearing restarting automata and CFL
Cited In (2)
This page was built for publication: Decidability questions for insertion systems and related models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5164868)
