Insertion languages
From MaRDI portal
Publication:796994
Recommendations
Cites work
- scientific article; zbMATH DE number 3664335 (Why is no real title available?)
- scientific article; zbMATH DE number 3550181 (Why is no real title available?)
- scientific article; zbMATH DE number 3634526 (Why is no real title available?)
- scientific article; zbMATH DE number 3238653 (Why is no real title available?)
- A characterization of context-free languages
- A modification of a substitution theorem and some necessary and sufficient conditions for sets to be context-free
- A note on undecidable properties of formal languages
- A variant of a recursively unsolvable problem
- Confluent and Other Types of Thue Systems
- Full AFLs and nested iterated substitution
- Infinite regular Thue systems
- On regularity of context-free languages
- On the enlargement of the class of regular languages by the shuffle closure
- On theories with a combinatorial definition of 'equivalence'
- Software Descriptions with Flow Expressions
- Some definitional suggestions for automata theory
- The power of synchronizing operations on strings
- Une généralisation des ensembles de Dyck
Cited in
(33)- On regularity of context-free languages
- Outfix-guided insertion (extended abstract)
- On the computational completeness of graph-controlled insertion-deletion systems with binary sizes
- Insertion-deletion with substitutions. II: About the role of one-sided context
- On succinct description of certain context-free languages by ins-del and matrix ins-del systems
- On decision problems concerning contextual insertions and deletions
- Site-directed insertion: decision problems, maximality and minimality
- Single semi-contextual insertion-deletion systems
- Modelling DNA and RNA secondary structures using matrix insertion-deletion systems
- On the ambiguity of insertion systems
- Word-paired insertions of languages
- scientific article; zbMATH DE number 446842 (Why is no real title available?)
- Site-directed insertion: language equations and decision problems
- On the generative capacity of matrix insertion-deletion systems of small sum-norm
- Two results on discontinuous input processing
- Outfix-guided insertion
- 1-normal DRA for insertion languages
- Generating and accepting P systems with minimal left and right insertion and deletion
- Aspects of Molecular Computing
- On bonded sequential and parallel insertion systems
- Context insertions
- A characterization of (regular) circular languages generated by monotone complete splicing systems
- On path-controlled insertion-deletion systems
- scientific article; zbMATH DE number 1836431 (Why is no real title available?)
- On basic properties of jumping finite automata
- Insertion-deletion systems with substitutions. I
- Descriptional complexity of graph-controlled insertion-deletion systems
- Decidability questions for insertion systems and related models
- Matrix insertion-deletion systems
- Universal insertion grammars of size two
- Unavoidable sets and circular splicing languages
- scientific article; zbMATH DE number 7584595 (Why is no real title available?)
- On the computing powers of \(\mathcal{L}\)-reductions of insertion languages
This page was built for publication: Insertion languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q796994)
