A Python toolkit for working with formal language constructs including Deterministic Finite Automata (DFA), Non-deterministic Finite Automata (NFA), and Context-Free Grammars (CFG). The toolkit ...

Weighted automata extend classical finite automata by assigning weights, typically drawn from algebraic structures such as semirings, to transitions. This quantitative enhancement enables the analysis ...

DCFS 2025 features a distinguished group of invited speakers presenting research on topics such as formal languages, reversible computing, and natural computing. Their talks will offer valuable ...

1 Faculty of Computational Mathematics and Cybernetics, Shenzhen MSU-BIT University, Shenzhen, China. 2 Algebra and Discrete Mathematics Department, Southern Federal University, Rostov-on-Don, Russian ...

Two styles of explaining the science of mind and behaviour have been competing for as long as anyone cares to remember: empiricist, centring on habit formation, statistical learning, imitation and ...

In addition to contributed and informal talks, NCMA 2025 will feature two invited speakers, including one joint invitation with DCFS 2025. Learn more about their backgrounds and the topics of their ...