The following pages link to (Q4714446):
Displayed 50 items.
- Networks of evolutionary processors: computationally complete normal forms (Q256426) (← links)
- Computing maximal Kleene closures that are embeddable in a given subword-closed language (Q256709) (← links)
- Generating and accepting P systems with minimal left and right insertion and deletion (Q256963) (← links)
- Modelling and verification of weighted spiking neural systems (Q264538) (← links)
- On a conjecture about Parikh matrices (Q266265) (← links)
- On computational complexity of graph inference from counting (Q269786) (← links)
- Asymptotic properties of free monoid morphisms (Q272351) (← links)
- Weak bisimulations for fuzzy automata (Q279375) (← links)
- Modelling DNA and RNA secondary structures using matrix insertion-deletion systems (Q285429) (← links)
- Successful visual human-computer interaction is undecidable (Q293299) (← links)
- On syntactic nuclei of rational languages (Q293361) (← links)
- On a hierarchy of languages generated by cooperating distributed grammar systems (Q294612) (← links)
- Clique polynomials have a unique root of smallest modulus (Q294815) (← links)
- An efficient time-free solution to SAT problem by P systems with proteins on membranes (Q295645) (← links)
- On the parameterised complexity of string morphism problems (Q315525) (← links)
- Infinite games specified by 2-tape automata (Q324245) (← links)
- Rational digit systems over finite fields and Christol's theorem (Q331134) (← links)
- The state complexity of random DFAs (Q338393) (← links)
- Periodicity in rectangular arrays (Q344541) (← links)
- Inferring descriptive generalisations of formal languages (Q355503) (← links)
- Sparse approaches for the exact distribution of patterns in long state sequences generated by a Markov source (Q384993) (← links)
- One-sided random context grammars with a limited number of right random context rules (Q385971) (← links)
- Branching-time logics with path relativisation (Q386037) (← links)
- On Prouhet's solution to the equal powers problem (Q387801) (← links)
- On the power of permitting features in cooperating context-free array grammar systems (Q387871) (← links)
- On simplification of schema mappings (Q389226) (← links)
- State complexity of star of union and square of union on \textit{k} regular languages (Q391180) (← links)
- Universality of sequential spiking neural P systems based on minimum spike number (Q391185) (← links)
- Regular and context-free pattern languages over small alphabets (Q391783) (← links)
- The Dyck pattern poset (Q394536) (← links)
- On the maximality of languages with combined types of code properties (Q401313) (← links)
- Controlled finite automata (Q404012) (← links)
- A survey of stochastic \(\omega \)-regular games (Q414898) (← links)
- Model-checking hierarchical structures (Q414908) (← links)
- Schützenberger and Eilenberg theorems for words on linear orderings (Q414913) (← links)
- State complexity of union and intersection of star on \(k\) regular languages (Q418766) (← links)
- Computation as an unbounded process (Q418791) (← links)
- State complexity of the concatenation of regular tree languages (Q418803) (← links)
- An infinite hierarchy of languages defined by dP systems (Q418824) (← links)
- An optimal construction of Hanf sentences (Q420856) (← links)
- Bisimulations for fuzzy automata (Q423147) (← links)
- Subword occurrences, weighted automata and iterated morphisms, especially the Fibonacci morphism (Q428858) (← links)
- Marked D0L systems and the \(2n\)-conjecture (Q428859) (← links)
- Model checking probabilistic systems against pushdown specifications (Q436316) (← links)
- On multi-head automata with restricted nondeterminism (Q436607) (← links)
- State complexity of combined operations with two basic operations (Q441851) (← links)
- Weakly unambiguous morphisms (Q442106) (← links)
- On external contextual grammars with subregular selection languages (Q443738) (← links)
- Reversal of binary regular languages (Q443743) (← links)
- Language classes generated by tree controlled grammars with bounded nonterminal complexity (Q443749) (← links)