1-normal DRA for insertion languages

DOI10.1007/978-3-319-64419-6_2MaRDI QIDQ1683524zbMATH OpenOpenAlexFDO

Authors Abhisek Midya, Lakshmanan Kuppusamy, V. S. Sumitha, Alok Kumar Pani

Publication date 1 December 2017

Full work available at URL https://doi.org/10.1007/978-3-319-64419-6_2

zbMATH Keywords

membership problemrestarting automatoninsertion grammars

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42)

Recommendations

• Insertion languages
• Aspects of Molecular Computing
• Insertion and deletion closure of languages
• Languages Modulo Normalization
• Insertion programming
• scientific article; zbMATH DE number 79067
• scientific article; zbMATH DE number 1836431
• scientific article; zbMATH DE number 7324347
• One-dimensional array grammars and P systems with array insertion and deletion rules
• Characterizing languages by normalization and termination in string rewriting (extended abstract)

Cited in

(2)

• On the Gap-Complexity of Simple RL-Automata
• Correctness Preservation and Complexity of Simple RL-Automata

This page was built for publication: 1-normal DRA for insertion languages

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1683524)