The following pages link to Lila Kari (Q243810):
Displaying 50 items.
- Deciding whether a regular language is generated by a splicing system (Q340586) (← links)
- State complexity of star of union and square of union on \textit{k} regular languages (Q391180) (← links)
- On the maximality of languages with combined types of code properties (Q401313) (← links)
- Relativized codes (Q418759) (← links)
- State complexity of union and intersection of star on \(k\) regular languages (Q418766) (← links)
- State complexity of combined operations with two basic operations (Q441851) (← links)
- Further remarks on DNA overlap assembly (Q515580) (← links)
- Binary pattern tile set synthesis is NP-hard (Q527409) (← links)
- Disjunctivity and other properties of sets of pseudo-bordered words (Q530214) (← links)
- Towards a neighborhood simplification of tile systems: from Moore to quasi-linear dependencies (Q537828) (← links)
- Families of languages defined by ciliate bio-operations (Q596126) (← links)
- Block insertion and deletion on trajectories (Q627169) (← links)
- Polyominoes simulating arbitrary-neighborhood zippers and tilings (Q652151) (← links)
- Multi-pattern languages (Q673787) (← links)
- Contextual insertions/deletions and computability (Q675056) (← links)
- Maximal and minimal solutions to language equations (Q676452) (← links)
- One-reversal counter machines and multihead automata: revisited (Q714812) (← links)
- State complexity of union and intersection of square and reversal on \(k\) regular languages (Q714820) (← links)
- An extension of the Lyndon-Schützenberger result to pseudoperiodic words (Q716329) (← links)
- On a special class of primitive words (Q844893) (← links)
- On the weight of universal insertion grammars (Q924156) (← links)
- On pseudoknot-bordered words and their properties (Q1004600) (← links)
- Twin-roots of words and their properties (Q1019719) (← links)
- DNA computing, sticker systems, and universality (Q1130166) (← links)
- (Q1277367) (redirect page) (← links)
- DNA computing based on splicing: The existence of universal computers (Q1277368) (← links)
- Some hierarchies for the communication complexity measures of cooperating grammar systems (Q1325838) (← links)
- On language equations with invertible operations (Q1334659) (← links)
- DNA computing: Arrival of biological mathematics (Q1361168) (← links)
- Insertion and deletion closure of languages (Q1391134) (← links)
- Coding properties of DNA languages. (Q1401178) (← links)
- Closure and decidability properties of some language classes with respect to ciliate bio-operations. (Q1426436) (← links)
- Shuffle and scattered deletion closure of languages (Q1575737) (← links)
- Using DNA to solve the bounded Post correspondence problem (Q1575917) (← links)
- A computer scientist's guide to molecular biology (Q1606798) (← links)
- State complexity of overlap assembly (Q1616964) (← links)
- Transducer descriptions of DNA code properties and undecidability of antimorphic problems (Q1706156) (← links)
- Efficient algorithms for computing the inner edit distance of a regular language via transducers (Q1712004) (← links)
- Computationally universal P systems without priorities: Two catalysts are sufficient (Q1763714) (← links)
- Language equations, maximality and error-detection (Q1765227) (← links)
- Aspects of shuffle and deletion on trajectories (Q1770379) (← links)
- On properties of bond-free DNA languages (Q1779300) (← links)
- Word blending in formal languages: the Brangelina effect (Q1799362) (← links)
- Sticky-free and overhang-free DNA languages (Q1889765) (← links)
- Languages and monoids with disjunctive identity (Q1911748) (← links)
- Negative interactions in irreversible self-assembly (Q1949756) (← links)
- 3-color bounded patterned self-assembly (Q2003474) (← links)
- State complexity of simple splicing (Q2179338) (← links)
- On the descriptional complexity of Watson-Crick automata (Q2271460) (← links)
- State complexity of pseudocatenation (Q2278276) (← links)
