The following pages link to (Q4140407):
Displaying 50 items.
- Towards bridging two cell-inspired models: P systems and R systems (Q418800) (← links)
- Marked D0L systems and the \(2n\)-conjecture (Q428859) (← links)
- Bispecial factors in circular non-pushy D0L languages (Q442285) (← links)
- An algorithm for enumerating all infinite repetitions in a D0L-system (Q491624) (← links)
- Decidability of operation problems for T0L languages and subclasses (Q553300) (← links)
- Descriptional and computational complexity of finite automata -- a survey (Q553312) (← links)
- The generative capacity of block-synchronized context-free grammars (Q557813) (← links)
- The bounded degree problem for NLC grammars is decidable (Q579950) (← links)
- Basic tree transducers (Q579951) (← links)
- Regularity of sets of initial strings of periodic D0L-systems (Q580989) (← links)
- The goodness of \(\{S,a\}\)-EOL forms is decidable (Q584929) (← links)
- On the subword complexity of m-free DOL languages (Q594602) (← links)
- Bounds for the D0L language equivalence problem (Q598185) (← links)
- On some decidability problems for HDOL systems with nonsingular Parikh matrices (Q599513) (← links)
- On commutative DTOL systems (Q599514) (← links)
- A \(P\) system model with pure context-free rules for picture array generation (Q630739) (← links)
- On almost cylindrical languages and the decidability of the D0L and PWD0L primitivity problems (Q671421) (← links)
- Structural equivalence and ET0L grammars (Q671426) (← links)
- Quasi-deterministic 0L systems and their representation (Q672456) (← links)
- Pattern systems (Q672745) (← links)
- Multi-pattern languages (Q673787) (← links)
- Completeness results concerning systolic tree automata and E0L languages (Q674289) (← links)
- A decision method for Parikh slenderness of context-free languages (Q674912) (← links)
- On equality between fuzzy context-free and fuzzy adult 0L languages (Q679812) (← links)
- Equations over finite sets of words and equivalence problems in automata theory (Q685449) (← links)
- On the union of 0L languages (Q685483) (← links)
- A new pumping lemma for indexed languages, with an application to infinite words (Q729820) (← links)
- The effective entropies of some extensions of context-free languages (Q751289) (← links)
- Systems of equations over a free monoid and Ehrenfeucht's conjecture (Q786545) (← links)
- L codes and number systems (Q788495) (← links)
- On simulation and propagating EOL forms (Q793513) (← links)
- Stability of desynchronized 0L-systems (Q794173) (← links)
- Homomorphic images of sentential form languages defined by semi-Thue systems (Q795513) (← links)
- On inherently ambiguous E0L languages (Q796996) (← links)
- The Ehrenfeucht conjecture: A compactness claim for finitely generated free monoids (Q798007) (← links)
- On the subword complexity of DOL languages with a constant distribution (Q798008) (← links)
- On k-repetition freeness of length uniform morphisms over a binary alphabet (Q799123) (← links)
- On a family of L languages resulting from systolic tree automata (Q800102) (← links)
- Periodicity and ultimate periodicity of D0L systems (Q807022) (← links)
- Decidability of structural equivalence of E0L grammars (Q807023) (← links)
- On standard locally catenative L schemes (Q807025) (← links)
- On the power of synchronization in parallel computations (Q811118) (← links)
- A powerful abelian square-free substitution over 4 letters (Q837181) (← links)
- Remarks on arbitrary multiple pattern interpretations (Q845932) (← links)
- The finiteness of synchronous, tabled picture languages is decidable (Q860893) (← links)
- Periodic string division generated by deterministic L systems (Q911317) (← links)
- New techniques for proving the decidability of equivalence problem (Q913523) (← links)
- A model for developmental systems. I: Generating word without any operating system (Q913692) (← links)
- Comparison of some descriptional complexities of 0L systems obtained by a unifying approach (Q948077) (← links)
- The minimum substring cover problem (Q958306) (← links)
