The following pages link to Nataša Jonoska (Q332435):
Displaying 50 items.
- (Q235211) (redirect page) (← links)
- Dynamic simulation of 1D cellular automata in the Active aTAM (Q264986) (← links)
- Recurring patterns among scrambled genes in the encrypted genome of the ciliate \textit{Oxytricha trifallax} (Q332436) (← links)
- Forbidding and enforcing on graphs (Q418768) (← links)
- Rewriting rule chains modeling DNA rearrangement pathways (Q714800) (← links)
- DNA splicing: Computing by observing (Q835999) (← links)
- Finite state automata representing two-dimensional subshifts (Q840771) (← links)
- Genus ranges of 4-regular rigid vertex graphs (Q888603) (← links)
- DNA recombination through assembly graphs (Q967356) (← links)
- Complexity classes for self-assembling flexible tiles (Q1004079) (← links)
- On existence of reporter strands in DNA-based graph structures (Q1008723) (← links)
- A conjugacy invariant for reducible sofic shifts and its semigroup characterizations (Q1269771) (← links)
- Sofic shifts with synchronizing presentations (Q1351451) (← links)
- Forbidding and enforcing in membrane computing (Q1410758) (← links)
- Self-assembling DNA graphs (Q1426845) (← links)
- A graph isomorphism condition and equivalence of reaction systems (Q1682860) (← links)
- On stoichiometry for the assembly of flexible tile DNA complexes (Q1761688) (← links)
- Counter machines and crystallographic structures (Q2003451) (← links)
- Algebraic systems motivated by DNA origami (Q2175419) (← links)
- Graph based analysis for gene segment organization in a scrambled genome (Q2180788) (← links)
- RNA-guided DNA assembly (Q2211655) (← links)
- DNA origami words and rewriting systems (Q2326806) (← links)
- Existence of constants in regular splicing languages (Q2346417) (← links)
- Platform color designs for interactive molecular arrangements (Q2400950) (← links)
- Four-regular graphs with rigid vertices associated to DNA recombination (Q2446317) (← links)
- Modeling RNA:DNA hybrids with formal grammars (Q2658311) (← links)
- Traversal Languages Capturing Isomorphism Classes of Sierpiński Gaskets (Q2819156) (← links)
- TWO-DIMENSIONAL LANGUAGES AND CELLULAR AUTOMATA (Q2909191) (← links)
- A Stronger Square Conjecture on Binary Words (Q2938111) (← links)
- Languages Associated with Crystallographic Symmetry (Q2945540) (← links)
- Using Automata to Describe Self-Assembled Nanostructures (Q3073614) (← links)
- (Q3378346) (← links)
- (Q3396579) (← links)
- Finite State Automata Representing Two-Dimensional Subshifts (Q3503913) (← links)
- (Q3515200) (← links)
- Blueprints for dodecahedral DNA cages (Q3518656) (← links)
- DNA Rearrangements through Spatial Graphs (Q3576208) (← links)
- Framed Versus Unframed Two-Dimensional Languages (Q3599066) (← links)
- On Complexity of Two Dimensional Languages Generated by Transducers (Q3602813) (← links)
- Involution Solid and Join Codes (Q3617057) (← links)
- Recognizing DNA Splicing (Q3618677) (← links)
- Expectation and Variance of Self-assembled Graph Structures (Q3618685) (← links)
- (Q3838420) (← links)
- (Q4224886) (← links)
- On a class ofNth order digital filters operating outside the region of stability (Q4226464) (← links)
- (Q4231569) (← links)
- (Q4263675) (← links)
- (Q4405763) (← links)
- (Q4414648) (← links)
- The symbolic dynamics of multidimensional tiling systems (Q4438708) (← links)
