The following pages link to Michael Domaratzki (Q596096):
Displayed 46 items.
- Deletion along trajectories (Q596097) (← links)
- Codes defined by multiple sets of trajectories (Q860886) (← links)
- Algebraic properties of substitution on trajectories (Q861260) (← links)
- On codes defined by bio-operations (Q884441) (← links)
- Equivalence in template-guided recombination (Q941686) (← links)
- Lower bounds for the transition complexity of NFAs (Q955341) (← links)
- State complexity of power (Q1019718) (← links)
- Minimality in template-guided recombination (Q1041038) (← links)
- Representing recursively enumerable languages by iterated deletion (Q1826643) (← links)
- Simulating finite automata with context-free grammars. (Q1853167) (← links)
- Trajectory-based codes (Q1889859) (← links)
- Hairpin structures defined by DNA trajectories (Q2272214) (← links)
- Bond-free DNA language classes (Q2461298) (← links)
- Transition complexity of language operations (Q2465047) (← links)
- Decidability of trajectory-based equations (Q2575751) (← links)
- On Language Decompositions and Primality (Q3003471) (← links)
- (Q3024007) (← links)
- Pairwise Rational Kernels Obtained by Automaton Operations (Q3192278) (← links)
- (Q3395971) (← links)
- (Q3396560) (← links)
- (Q3396587) (← links)
- INTRA-MOLECULAR TEMPLATE-GUIDED RECOMBINATION (Q3401464) (← links)
- (Q3409979) (← links)
- (Q3517096) (← links)
- (Q3601868) (← links)
- Characterizing DNA Bond Shapes Using Trajectories (Q3617056) (← links)
- (Q4452067) (← links)
- (Q4453466) (← links)
- (Q4465331) (← links)
- (Q4465333) (← links)
- (Q4737919) (← links)
- (Q4799361) (← links)
- (Q4825704) (← links)
- ABELIAN PRIMITIVE WORDS (Q4902891) (← links)
- (Q4929403) (← links)
- Abelian Primitive Words (Q5199965) (← links)
- Mathematical Foundations of Computer Science 2004 (Q5311144) (← links)
- (Q5313787) (← links)
- Hairpin Structures Defined by DNA Trajectories (Q5452573) (← links)
- Equivalence in Template-Guided Recombination (Q5452700) (← links)
- IMPROVED BOUNDS ON THE NUMBER OF AUTOMATA ACCEPTING FINITE LANGUAGES (Q5696970) (← links)
- NON-UNIQUENESS AND RADIUS OF CYCLIC UNARY NFAs (Q5704371) (← links)
- RESTRICTED SETS OF TRAJECTORIES AND DECIDABILITY OF SHUFFLE DECOMPOSITIONS (Q5704372) (← links)
- Developments in Language Theory (Q5711948) (← links)
- Developments in Language Theory (Q5711951) (← links)
- Lower Bounds for the Transition Complexity of NFAs (Q5756712) (← links)