All Stories

  1. An overview of the consensus problem in the control of multi-agent systems
  2. Nonlinear Convergence Algorithm: Structural Properties with Doubly Stochastic Quadratic Operators for Multi-Agent Systems
  3. Reach a nonlinear consensus for MAS via doubly stochastic quadratic operators
  4. Context-Free Petri Net Controlled Grammars under Parallel Firing Strategy
  5. Dynamics of doubly stochastic quadratic operators on a finite-dimensional simplex
  6. The generative capacity of weighted simple and semi-simple splicing systems
  7. Generative Power and Closure Properties of Watson-Crick Grammars
  8. A Novel Stream Cipher Based on Nondeterministic Finite Automata
  9. Dynamics Classifications of Extreme Doubly Stochastic Quadratic Operators on 2D Simplex
  10. The Extreme Doubly Stochastic Quadratic Operators on Two Dimensional Simplex
  11. Computational Properties of Watson-Crick Context-Free Grammars
  12. The convergence consensus of multi-agent systems controlled via doubly stochastic quadratic operators
  13. Parallel firing strategy on Petri nets: A review
  14. A new variant of Petri net controlled grammars
  15. The properties of probabilistic simple regular sticker system
  16. Closure properties of Watson-Crick grammars
  17. Some characteristics on the generative power of weighted one-sided splicing systems
  18. Languages of Watson-Crick Petri Net
  19. Weighted Watson-Crick automata
  20. Probabilistic simple splicing systems
  21. Automata for subgroups
  22. Watson-Crick Petri net languages: The effect of labeling strategies
  23. The generative power of weighted one-sided and regular sticker systems
  24. Watson-Crick Petri net languages with finite sets of final markings
  25. Some Properties of the Concurrent Grammars
  26. Fuzzy Splicing Systems
  27. Nonterminal Complexity of Weakly Conditional Grammars
  28. Concurrent Context-Free Grammars
  29. Probabilistic Semi–Simple Splicing System and Its Characteristics
  30. Automata representation for Abelian groups
  31. Some characteristics of probabilistic one-sided splicing systems
  32. Probabilistic Splicing Systems
  33. Language classes generated by tree controlled grammars with bounded nonterminal complexity
  34. Language Classes Generated by Tree Controlled Grammars with Bounded Nonterminal Complexity
  35. Software Quality Models: A Comparative Study
  36. An Evaluation Model for Software Reuse Processes
  37. Grammars Controlled by Special Petri Nets
  38. k-Petri Net Controlled Grammars