scientific article; zbMATH DE number 941396

No author found.

Publication date: 4 November 1996

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

complexity cryptology formal languages computational linguistics mathematical logic linguistics molecular genetics artificial intellignce

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Data encryption (aspects in computer science) (68P25) General reference works (handbooks, dictionaries, bibliographies, etc.) pertaining to computer science (68-00) Computer science (68-XX)

Related Items (only showing first 100 items - show all)

Modelling and verification of weighted spiking neural systems ⋮ On a conjecture about Parikh matrices ⋮ On computational complexity of graph inference from counting ⋮ Asymptotic properties of free monoid morphisms ⋮ Weak bisimulations for fuzzy automata ⋮ Modelling DNA and RNA secondary structures using matrix insertion-deletion systems ⋮ Successful visual human-computer interaction is undecidable ⋮ On syntactic nuclei of rational languages ⋮ On a hierarchy of languages generated by cooperating distributed grammar systems ⋮ Clique polynomials have a unique root of smallest modulus ⋮ An efficient time-free solution to SAT problem by P systems with proteins on membranes ⋮ On the parameterised complexity of string morphism problems ⋮ Infinite games specified by 2-tape automata ⋮ Rational digit systems over finite fields and Christol's theorem ⋮ The state complexity of random DFAs ⋮ Periodicity in rectangular arrays ⋮ Inferring descriptive generalisations of formal languages ⋮ Deletion along trajectories ⋮ On the state complexity of reversals of regular languages ⋮ Branching synchronization grammars with nested tables ⋮ A periodicity result of partial words with one hole ⋮ Bounds for the D0L language equivalence problem ⋮ Real numbers having ultimately periodic representations in abstract numeration systems ⋮ Polynomial versus exponential growth in repetition-free binary words ⋮ On the complexity of deciding avoidability of sets of partial words ⋮ Sparse approaches for the exact distribution of patterns in long state sequences generated by a Markov source ⋮ One-sided random context grammars with a limited number of right random context rules ⋮ Branching-time logics with path relativisation ⋮ On Prouhet's solution to the equal powers problem ⋮ On the power of permitting features in cooperating context-free array grammar systems ⋮ A note on prefix primitive words ⋮ On simplification of schema mappings ⋮ State complexity of star of union and square of union on \textit{k} regular languages ⋮ Universality of sequential spiking neural P systems based on minimum spike number ⋮ Regular and context-free pattern languages over small alphabets ⋮ The Dyck pattern poset ⋮ On generalized communicating P systems with minimal interaction rules ⋮ P systems with minimal insertion and deletion ⋮ On the maximality of languages with combined types of code properties ⋮ Controlled finite automata ⋮ Complexity and palindromic defect of infinite words ⋮ A survey of stochastic \(\omega \)-regular games ⋮ Model-checking hierarchical structures ⋮ Schützenberger and Eilenberg theorems for words on linear orderings ⋮ Block insertion and deletion on trajectories ⋮ State complexity of union and intersection of star on \(k\) regular languages ⋮ Computation as an unbounded process ⋮ State complexity of the concatenation of regular tree languages ⋮ An infinite hierarchy of languages defined by dP systems ⋮ An optimal construction of Hanf sentences ⋮ Bisimulations for fuzzy automata ⋮ Subword occurrences, weighted automata and iterated morphisms, especially the Fibonacci morphism ⋮ Marked D0L systems and the \(2n\)-conjecture ⋮ Model checking probabilistic systems against pushdown specifications ⋮ On multi-head automata with restricted nondeterminism ⋮ State complexity of combined operations with two basic operations ⋮ Weakly unambiguous morphisms ⋮ On external contextual grammars with subregular selection languages ⋮ Reversal of binary regular languages ⋮ Language classes generated by tree controlled grammars with bounded nonterminal complexity ⋮ Number of holes in unavoidable sets of partial words. II. ⋮ Implication of regular expressions ⋮ Probabilistic opacity for Markov decision processes ⋮ Simple linear string constraints ⋮ Exponentially more concise quantum recognition of non-RMM regular languages ⋮ Patterns with bounded treewidth ⋮ Postfix automata ⋮ An algorithmic toolbox for periodic partial words ⋮ Descriptional complexity of unambiguous input-driven pushdown automata ⋮ Computing with membranes and picture arrays ⋮ Deciding determinism of regular languages ⋮ Language-theoretic problems in certain matrix monoids ⋮ Incomplete operational transition complexity of regular languages ⋮ Contextual array grammars and array P systems ⋮ Computational power of tissue P systems for generating control languages ⋮ On languages generated by spiking neural P systems with weights ⋮ Unambiguous conjunctive grammars over a one-symbol alphabet ⋮ On the computational power of networks of polarized evolutionary processors ⋮ Solutions to the multi-dimensional Prouhet-Tarry-Escott problem resulting from composition of balanced morphisms ⋮ Quantum finite automata: advances on Bertoni's ideas ⋮ Computational efficiency and universality of timed P systems with membrane creation ⋮ Rule set design problems for oritatami systems ⋮ Complexity-preserving simulations among three variants of accepting networks of evolutionary processors ⋮ An improved algorithm for determinization of weighted and fuzzy automata ⋮ Restricted ambiguity of erasing morphisms ⋮ Morphic characterizations of languages in Chomsky hierarchy with insertion and locality ⋮ Bounded hairpin completion ⋮ Limitations of lower bound methods for deterministic nested word automata ⋮ Algorithmic applications of XPCR ⋮ (Tissue) P systems working in the \(k\)-restricted minimally or maximally parallel transition mode ⋮ Computational power of insertion-deletion (P) systems with rules of size two ⋮ On the complexity of typechecking top-down XML transformations ⋮ On the complexity of decidable cases of the commutation problem of languages ⋮ Hasse diagrams for classes of deterministic bottom-up tree-to-tree-series transformations ⋮ Generalised fine and Wilf's theorem for arbitrary number of periods ⋮ A proof of the extended Duval's conjecture ⋮ On a conjecture about finite fixed points of morphisms ⋮ Networks of evolutionary processors: computationally complete normal forms ⋮ Computing maximal Kleene closures that are embeddable in a given subword-closed language ⋮ Generating and accepting P systems with minimal left and right insertion and deletion

This page was built for publication: