SCHEMA FOR PARALLEL INSERTION AND DELETION: REVISITED
From MaRDI portal
Publication:2909102
DOI10.1142/S0129054111008945zbMath1252.68176OpenAlexW1994343490MaRDI QIDQ2909102
Publication date: 29 August 2012
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0129054111008945
syntactic congruence\(p\)-schemacontextual parallel deletioncontextual parallel insertionlanguage inequalitiesmultiple-variables language equations
Related Items (4)
Deletion operations on deterministic families of automata ⋮ Insertion operations on deterministic reversal-bounded counter machines ⋮ On bonded sequential and parallel insertion systems ⋮ Computing maximal Kleene closures that are embeddable in a given subword-closed language
Cites Work
- Unnamed Item
- Unnamed Item
- Contextual insertions/deletions and computability
- Maximal and minimal solutions to language equations
- Reversal-bounded multipushdown machines
- On language equations with invertible operations
- Closure and decidability properties of some language classes with respect to ciliate bio-operations.
- Decidability of trajectory-based equations
- ON LANGUAGES FACTORIZING THE FREE MONOID
- Reversal-Bounded Multicounter Machines and Their Decision Problems
This page was built for publication: SCHEMA FOR PARALLEL INSERTION AND DELETION: REVISITED