The following pages link to Juergen Dassow (Q1164434):
Displaying 50 items.
- (Q235700) (redirect page) (← links)
- Networks of evolutionary processors: computationally complete normal forms (Q256426) (← links)
- On restricted context-free grammars (Q414885) (← links)
- On external contextual grammars with subregular selection languages (Q443738) (← links)
- Language classes generated by tree controlled grammars with bounded nonterminal complexity (Q443749) (← links)
- The role of evolutionary operations in accepting hybrid networks of evolutionary processors (Q553303) (← links)
- Graph grammars with string-regulated rewriting (Q652154) (← links)
- Language-theoretic problems arising from Richelieu cryptosystems (Q685369) (← links)
- On the union of 0L languages (Q685483) (← links)
- Decision problems and regular chain code picture languages (Q686522) (← links)
- Nonterminal complexity of tree controlled grammars (Q719323) (← links)
- Regular languages of partial words (Q726150) (← links)
- On the connectedness of pictures in chain code picture languages (Q808270) (← links)
- On bounded interpretations of grammar forms (Q808719) (← links)
- Deterministic soliton automata with a single exterior node (Q811132) (← links)
- The power of programmed grammars with graphs from various classes (Q854407) (← links)
- Soliton automata (Q909470) (← links)
- Comparison of some descriptional complexities of 0L systems obtained by a unifying approach (Q948077) (← links)
- A note on programmed 0L systems (Q1080664) (← links)
- Grammars with valuations - a discrete model for self-organization of biopolymers (Q1164435) (← links)
- Über das Verhalten der Betti-Reihe eines lokalen Ringes bei monoidalen Transformationen (Q1223452) (← links)
- Spezielle Gleichungen in freien Halbgruppen und eine Anwendung auf Normalformen regulärer Ereignisse (Q1237176) (← links)
- On the regularity of languages generated by context-free evolutionary grammars (Q1304479) (← links)
- Stack cooperation in multistack pushdown automata (Q1307700) (← links)
- Iterative reading of numbers and ``black-holes'' (Q1321645) (← links)
- On the subword density of languages (Q1345731) (← links)
- Cooperation in context-free grammars (Q1390878) (← links)
- Min of Mat is not necessarily Mat (Q1606988) (← links)
- Tree-systems of morphisms (Q1608934) (← links)
- A remark on evolutionary systems (Q1765382) (← links)
- Dynamically controlled cooperating/distributed grammar systems (Q1803860) (← links)
- Parallel communicating grammar systems as language analyzers (Q1841061) (← links)
- Remarks on external contextual grammars with selection (Q1998866) (← links)
- Operational complexity and right linear grammars (Q2041682) (← links)
- Some remarks on the orbit of closure-involution operations on languages (Q2051839) (← links)
- The orbit of closure-involution operations: the case of Boolean functions (Q2143383) (← links)
- Operational complexity and pumping lemmas (Q2170280) (← links)
- Some operations preserving primitivity of words (Q2271430) (← links)
- Two collapsing hierarchies of subregularly tree controlled languages (Q2271461) (← links)
- Deterministic soliton automata with at most one cycle (Q2366276) (← links)
- Networks of evolutionary processors: the power of subregular filters (Q2376983) (← links)
- Accepting splicing systems with permitting and forbidding words (Q2376984) (← links)
- Descriptional complexity and operations -- two non-classical cases (Q2400987) (← links)
- On the orbit of closure-involution operations -- the case of formal languages (Q2422027) (← links)
- On the number of components for some parallel communicating grammar systems (Q2465046) (← links)
- (Q2708313) (← links)
- FINITE AUTOMATA OVER FREE GROUPS (Q2709977) (← links)
- (Q2770580) (← links)
- (Q2770670) (← links)
- Conditional Lindenmayer Systems with Subregular Conditions: The Extended Case (Q2803049) (← links)
