Search research articles

ABOUT JoVE

Overview Leadership Blog JoVE Help Center

AUTHORS

Publishing Process Editorial Board Scope & Policies Peer Review FAQ Submit

LIBRARIANS

Testimonials Subscriptions Access Resources Library Advisory Board FAQ

RESEARCH

JoVE Journal Methods Collections JoVE Encyclopedia of Experiments Archive

EDUCATION

JoVE Core JoVE Business JoVE Science Education JoVE Lab Manual Faculty Resource Center Faculty Site

Terms & Conditions of Use

Related Concept Videos

Relation between Mathematical Equations and Block Diagrams

Relation between Mathematical Equations and Block Diagrams

In a spring-mass-damper system, the second-order differential equation describes the dynamic behavior of the system. When transformed into the Laplace domain under zero initial conditions, this equation can be effectively analyzed and manipulated. The transformation into the Laplace domain converts differential equations into algebraic equations, simplifying the process of isolating the output.

Block Diagram Reduction

Block Diagram Reduction

The process of deriving the transfer function of a control system often involves reducing its block diagram to a single block. This simplification can be achieved through a series of strategic operations, including relocating branch points and comparators. These operations preserve the overall function of the system while allowing for easier manipulation and combination of blocks.
The first step in this process is the identification and relocation of a branch point. A branch point, where a...

Woodward–Hoffmann Selection Rules and Microscopic Reversibility

Woodward–Hoffmann Selection Rules and Microscopic Reversibility

Electrocyclic reactions, cycloadditions, and sigmatropic rearrangements are concerted pericyclic reactions that proceed via a cyclic transition state. These reactions are stereospecific and regioselective. The stereochemistry of the products depends on the symmetry characteristics of the interacting orbitals and the reaction conditions. Accordingly, pericyclic reactions are classified as either symmetry-allowed or symmetry-forbidden. Woodward and Hoffmann presented the selection criteria for...

Signal Flow Graphs

Signal Flow Graphs

Signal-flow graphs offer a streamlined and intuitive approach to representing control systems, providing an alternative to traditional block diagrams. These graphs use branches to symbolize systems and nodes to represent signals, effectively illustrating the relationships and interactions within the system.
In a signal-flow graph, branches denote the system's transfer functions, while nodes represent the signals. The direction of signal flow is indicated by arrows, with the corresponding...

SFG Algebra

SFG Algebra

In Signal Flow Graph (SFG) algebra, the value a node represents is determined by the sum of all signals entering that node. This summed value is then transmitted through every branch leaving the node, making the SFG a powerful tool for visualizing and analyzing control systems.
Each node in an SFG corresponds to a variable, and the interactions between nodes are represented by branches with associated gains. When multiple branches lead into a node, the value at that node is the sum of the...

Sequence Networks of Rotating Machines

Sequence Networks of Rotating Machines

A Y-connected synchronous generator, grounded through a neutral impedance, is designed to produce balanced internal phase voltages with only positive-sequence components. The generator's sequence networks include a source voltage that is exclusively in the positive-sequence network. The sequence components of line-to-ground voltages at the generator terminals illustrate this configuration.
Zero-sequence current induces a voltage drop across the generator's neutral impedance and other...

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by

Same author

Highly efficient genome editing using CRISPR/Cas9 ribonucleoprotein in the marine oleaginous diatom Fistulifera solaris.

Scientific reports·2026

Same author

Establishment of genome editing techniques in the marine oleaginous diatom Fistulifera solaris for improved oil accumulation.

Journal of bioscience and bioengineering·2025

Same author

Combined use of phosphorus containing calcium silicate and phosphate-solubilizing bacterium as a solid biofertilizer for sustainable soybean cultivation.

Journal of bioscience and bioengineering·2025

Same author

The Japanese Clinical Practice Guidelines for Management of Sepsis and Septic Shock 2024.

Journal of intensive care·2025

Same author

Intra- and Interbead Communications by an Anchored DNA Structure and Cascaded DNA Reactions.

ACS synthetic biology·2025

Same author

The Japanese Clinical Practice Guidelines for Management of Sepsis and Septic Shock 2024.

Acute medicine & surgery·2025

Search research articles

Related Experiment Video

Updated: Jul 12, 2026

One Dimensional Turing-Like Handshake Test for Motor Intelligence

One Dimensional Turing-Like Handshake Test for Motor Intelligence

Published on: December 15, 2010

Self-description for construction and computation on graph-rewriting automata.

Kohji Tomita¹, Satoshi Murata, Haruhisa Kurokawa

¹National Institute of Advanced Industrial Science and Technology (AIST), 1-2-1 Namiki, Tsukuba, Ibaraki 305-8564, Japan. k.tomita@aist.go.jp

Artificial Life

|August 25, 2007

Summary

This study introduces graph-rewriting automata for self-description in construction and computation. These systems enable self-replication and modification, modeling self-maintaining systems.

Related Experiment Videos

Last Updated: Jul 12, 2026

One Dimensional Turing-Like Handshake Test for Motor Intelligence

One Dimensional Turing-Like Handshake Test for Motor Intelligence

Published on: December 15, 2010

Area of Science:

Theoretical Computer Science
Artificial Life
Graph Rewriting Systems

Background:

Traditional cellular automata operate on fixed lattices.
Limited capacity for integrated structural change and computation within a single framework.

Purpose of the Study:

To present a unified framework for self-description in construction and computation.
To introduce graph-rewriting automata as a model for self-maintaining systems.

Main Methods:

Utilizing a variant of graph-rewriting systems termed graph-rewriting automata.
Implementing self-replication via a subgraph acting as a construction arm.
Introducing metanode structures to embed rule sets within the graph for computation.

Main Results:

Demonstrated self-description for construction through self-replication.
Showcased self-description for computation using embedded rule sets.
Established graph-rewriting automata as universal systems capable of self-replication and modification.

Conclusions:

Graph-rewriting automata provide a unified framework for self-description, construction, and computation.
These automata serve as a powerful model for systems capable of self-maintenance, replication, and adaptation.