Insertion and deletion closure of languages

DOI10.1016/S0304-3975(96)00307-6zbMath0901.68097MaRDI QIDQ1391134

Masami Ito, Gabriel Thierrin, Lila Kari

Publication date: 22 July 1998

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

insertion-base of a language

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (9)

Nondeterministic state complexity of site-directed deletion ⋮ The nondeterministic state complexity of the site-directed deletion language operation ⋮ On Basic Properties of Jumping Finite Automata ⋮ Some Properties of Extractable Codes and Insertable Codes ⋮ Parallel contextual array insertion deletion P systems and tabled matrix grammars ⋮ On bonded sequential and parallel insertion systems ⋮ Two Results on Discontinuous Input Processing ⋮ Representing recursively enumerable languages by iterated deletion ⋮ Shuffle and scattered deletion closure of languages

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Monoids with disjunctive identity and their codes
• Semaphore Codes and Ideals
• Hypercodes, Right Convex Languages and their Syntactic Monoids
• On parallel deletions applied to a word
• Insertion and deletion of words: Determinism and reversibility

This page was built for publication: Insertion and deletion closure of languages