Schema for parallel insertion and deletion: revisited
From MaRDI portal
Publication:2909102
DOI10.1142/S0129054111008945zbMATH Open1252.68176OpenAlexW1994343490MaRDI QIDQ2909102FDOQ2909102
Authors: Lila Kari, Shinnosuke Seki
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
Recommendations
syntactic congruence\(p\)-schemacontextual parallel deletioncontextual parallel insertionlanguage inequalitiesmultiple-variables language equations
Cites Work
- Title not available (Why is that?)
- Reversal-bounded multipushdown machines
- Reversal-Bounded Multicounter Machines and Their Decision Problems
- Title not available (Why is that?)
- Maximal and minimal solutions to language equations
- On language equations with invertible operations
- Decidability of trajectory-based equations
- Contextual insertions/deletions and computability
- Closure and decidability properties of some language classes with respect to ciliate bio-operations.
- ON LANGUAGES FACTORIZING THE FREE MONOID
Cited In (5)
- Computing maximal Kleene closures that are embeddable in a given subword-closed language
- Deletion operations on deterministic families of automata
- Insertion operations on deterministic reversal-bounded counter machines
- Schema for parallel insertion and deletion
- On bonded sequential and parallel insertion systems
This page was built for publication: Schema for parallel insertion and deletion: revisited
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2909102)