Subregularly controlled insertion systems
From MaRDI portal
Cites work
- A survey on operational state complexity
- Conditional grammars with commutative, circular and locally testable conditions
- Conditional Lindenmayer systems with subregular conditions: the extended case
- Conditional Lindenmayer systems with subregular conditions: the non-extended case
- Context-free insertion-deletion systems
- Determination of finite automata accepting subregular languages
- scientific article; zbMATH DE number 3684913 (Why is no real title available?)
- scientific article; zbMATH DE number 50943 (Why is no real title available?)
- scientific article; zbMATH DE number 3492162 (Why is no real title available?)
- scientific article; zbMATH DE number 941396 (Why is no real title available?)
- scientific article; zbMATH DE number 3293675 (Why is no real title available?)
- scientific article; zbMATH DE number 3368555 (Why is no real title available?)
- Insertion languages
- Investigations on the power of matrix insertion-deletion systems with small sizes
- Multiple-entry finite automata
- Networks of evolutionary processors: the power of subregular filters
- On external contextual grammars with subregular selection languages
- On prefixal one-rule string rewrite systems
- On rationally controlled one-rule insertion systems
- On the Generative Power of Graph-Controlled Insertion-Deletion Systems with Small Sizes
- Regulated insertion-deletion systems
- Regulated RNA rewriting: Modelling RNA editing with guided insertion
- Some decision problems about controlled rewriting systems
- The Theory of Definite Automata
- Universal insertion grammars of size two
This page was built for publication: Subregularly controlled insertion systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6907610)
