Showing 1 - 20 results of 55 for search '"language"', query time: 0.04s Refine Results
  1. 1
    Languages of watson-crick petri net
    Get full text
    Get full text
    Get full text
    Get full text
  2. 2
    Watson-Crick petri net languages: the effect of labeling strategies
    “…, a new model namely Watson-Crick Petri net has been developed. The language generated by Watson-Crick…”
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
  3. 3
    Language classes generated by tree controlled grammars with bounded nonterminal complexity
    “…′ is a regular grammar. Its language consists of all terminal words with a derivation in G such that all…”
    Get full text
    Get full text
    Get full text
    Get full text
  4. 4
    Watson-Crick Petri net languages with finite sets of final markings
    “…. In this research, we investigate the fundamental properties of Watson-Crick Petri net languages with finite sets…”
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
  5. 5
    On bonded Indian and uniformly parallel insertion systems and their generative power
    “…Insertion is an operation in formal language theory that generalizes the operation of concatenation…”
    Get full text
    Get full text
    Get full text
  6. 6
    Structurally and arithmetically controlled grammars
    “… amount to a thrilling trend within formal language theory. Given the extensive literature on issues…”
    Get full text
    Get full text
    Get full text
  7. 7
    Nonterminal complexity of weakly conditional grammars
    “… if it belongs to the language generated by G′. The nonterminal complexity Var(K) of the grammar K is defined…”
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
  8. 8
    Sticker systems over monoids
    “… of the current sequence according to a complementarity relation. According to this sticker operation, a language…”
    Get full text
    Get full text
    Get full text
  9. 9
    Probabilistic splicing systems
    “… systems, and establish basic properties of language families generated by this type of splicing systems…”
    Get full text
    Get full text
    Get full text
    Get full text
  10. 10
    Weighted splicing systems
    “…, and establish some basic properties of language families generated by this type of splicing systems. We show…”
    Get full text
    Get full text
    Get full text
    Get full text
  11. 11
    Fuzzy splicing systems
    “…, and establish some basic properties of language families generated by this type of splicing systems. We study…”
    Get full text
    Get full text
    Get full text
    Get full text
  12. 12
    An overview of cryptosystems based on finite automata
    “…Finite automata are backbones of the cryptosystems based on language theory. Most…”
    Get full text
    Get full text
    Get full text
  13. 13
    Place-Labeled Petri Net Controlled Grammars
    “… net and a function which maps places of the net to the productions of the grammar. The language…”
    Get full text
    Get full text
  14. 14
    Reverse Watson-Crick Petri nets
    “… where the control unit of the Watson-Crick automaton is replaced by the Petri net. The language…”
    Get full text
    Get full text
    Get full text
  15. 15
    Weighted sticker system
    “… systems, called weighted sticker systems, is introduced. Some basic properties of language families…”
    Get full text
    Get full text
    Get full text
  16. 16
    Parallel firing strategy on petri nets: a review
    “… related topics. Though the theme of regulated grammars is one of the classic topics in formal language…”
    Get full text
    Get full text
    Get full text
    Get full text
  17. 17
    Some properties and variants of weighted sticker systems
    “… systems, called weighted sticker systems, is introduced. Some basic properties of language families…”
    Get full text
    Get full text
    Get full text
  18. 18
    Parsing algorithms for grammars with regulated rewriting
    “… approaching the membership (parsing) problem in formal language theory in the new point of view: instead of a…”
    Get full text
    Get full text
    Get full text
    Get full text
  19. 19
    Automata representation for Abelian groups
    “… the type of language a string belongs to. A string is said to be recognized by a finite automaton…”
    Get full text
    Get full text
    Get full text
  20. 20
    Tree valence controlled grammars
    “… known as tree controlled grammars have achieved plentiful remarkable results within formal language…”
    Get full text
    Get full text
    Get full text
Search Tools: RSS Feed – Email Search