Lowest Common Ancestor LCA in Finite State Machines

What is Lowest Common Ancestor (LCA)? The Lowest Common Ancestor (LCA) of two nodes in a tree is the deepest (i.e., lowest) node that is an ancestor of both nodes. In other words, it is the shared ancestor of the two nodes that is located farthest from the root. The concept is fundamental in computer science, especially in the context of tree data structures, such as binary trees, general trees, and state machines. ...

January 31, 2026 · 3 min · 553 words · Niraj Kashyap

Why Finite State Machines Are Everywhere: From Software to Human Life

Why Finite State Machines Are Everywhere: From Software to Human Life Finite State Machines (FSMs) are everywhere — whether you are writing software, designing systems, or simply living your daily life. From a login screen that moves from “logged out” to “logged in”, to a human being transitioning from “sleeping” to “working”, the same pattern exists. In this article, we’ll explore what a Finite State Machine is, how it works in software, and why human behavior itself can be understood as a series of states and transitions. ...

January 13, 2026 · 3 min · 602 words · Niraj Kashyap