A tiny library for parsing state transition tables
-
Updated
May 4, 2023 - Python
#
transition-table
Here are 8 public repositories matching this topic...
Formal Languages and Compiler Design 1. RE to FA 2. NFA to DFA 3. CFG to CNF
grammars regular-expression chomsky transition-table nfa-to-dfa-conversion finite-automaton cfg-to-cnf-conversion
-
Updated
Nov 5, 2021 - TypeScript
A C++ compile-time state machine with a transition table and entry iteration, still in development but promising.
github learning programming cpp engine dev template-metaprogramming quebec software student experimentation statemachine tmp compile-time variant meta-programming transition-table type-traits unrays
-
Updated
Jan 21, 2026 - C++
Table Driven State Machine example
-
Updated
Apr 27, 2015 - C
Console program reads an automaton's transition table and generates the corresponding Deterministic Finite Automaton. It can also indicate whether a given string is accepted or not by the DFA language.
-
Updated
Mar 7, 2021 - Python
Java Program to convert regular expression to transition table
-
Updated
Apr 11, 2018 - Java
Scanner for the C-- language
-
Updated
Jun 11, 2023 - Python
A custom made high-performance Chess Engine created entirely from scratch in modern C++, supporting UCI and terminal plays, O(1) memory hashing, and highly optimized game tree search algorithms along with Tapered evaluation leading to a signifcant rise in performance.
chess-engine algorithms cpp cpp17 game-ai negamax iterative-deepening-search transition-table perft zobrist-hashing piece-square-tables killer-move-heuristic uci-protocol move-ordering-heuristics history-heuristic tapered-evaluation aplha-beta-pruning
-
Updated
Jun 23, 2026 - C++
Improve this page
Add a description, image, and links to the transition-table topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the transition-table topic, visit your repo's landing page and select "manage topics."