A web application built with Next.js for converting truth tables into boolean equations. It uses Karnaugh Map to generate the equation.
Click here to visit the deployed application
Here's a quick demonstration of how Boolean Simplify works:
- Convert truth tables to boolean equations using Karnaugh Map method
- Support for multiple input and output variables
- Real-time equation generation
- Dark and light mode themes
- User-friendly interface
- Responsive design for all devices
- Node.js (version 18 or newer)
- Yarn
- TypeScript
- Input your truth table:
- For a 2-input, 1-output system:
A B | Y 0 0 | 1 0 1 | 0 1 0 | 1 1 1 | 1
- Click "Generate" to get the simplified boolean equation
- The result will be:
Y = A + B'
- Clone the repository:
git clone https://github.com/yourusername/boolean-simplify.git
cd boolean-simplify
- Install dependencies:
yarn install
- Start the development server:
yarn dev
- Access the application at http://localhost:3000
- Specify the number of inputs and outputs
- Fill in the truth table values
- Click generate to compute the boolean equation
- Copy the generated equation as needed
We welcome contributions to improve this project. Please follow these steps:
- Fork the repository
- Create a feature branch (
git checkout -b feature/YourFeature
) - Commit your changes (
git commit -m 'Add YourFeature'
) - Push to the branch (
git push origin feature/YourFeature
) - Open a Pull Request
This project is licensed under the Apache License 2.0 - which means you can use, modify, and distribute it, but you need to include the original copyright notice and state significant changes. Check out the LICENSE file for all the legal details.