You sure have wondered what practical use the intersection of two regular languages has.😀 It is not live changing, but hey, at least interesting.😎 (To a certain tribe.)

Here it is: https://miamao.de/blog/2024-08/18.A_Practical_Use_for_Regular_Language_Intersection.html
#cs #computerscience #informatik #endlicheautomaten #finiteautomata #nfa #dfa #monqjfa

Haralds Blog — A Practical Use for Regular Language Intersection

My #Java package #monqjfa for (non)deterministic finite automata (#nfa, #dfa) got an update: Following the advice "eat your own dogfood", I wrote a small application somewhat resembling grep or sed, more to show how the library could be used than pretending to be better than sed/grep/awk. Though it has some coolness in the defaults used 😀 .

https://codeberg.org/harald/monqjfa#example-application

#informatikEdu
#informatik
#endlicheautomaten
#finiteautomata

monqjfa

monqjfa

Codeberg.org

My #Java package for (non)deterministic finite automata (#nfa, #dfa) updated.

This refactoring/rewrite provides a cleaner API to creating an NFA and compiling a DFA from it.

https://harald.codeberg.page/monqjfa/javadoc/monq/jfa/NfaBuilder.html

Computer science courses may visualize NFA and DFA via the included FaToDot. I think Thompson's Construction in the code is quite readable.

https://codeberg.org/harald/monqjfa

#informatikEdu
#informatik
#endlicheautomaten
#finiteautomata

NfaBuilder (monq 3.1.1)

declaration: package: monq.jfa, class: NfaBuilder

My #Java package for (non)deterministic finite automata (#nfa, #dfa) updated.

You can create massive regular expressions with tons of stop states. Each stop state has a value, so a match is effectively a lookup. Like a hash table where the keys are regular expressions.

Computer science courses may visualize NFA and DFA via the included FaToDot. I think Thompson's Construction in the code is quite readable.

https://codeberg.org/harald/monqjfa

#informatikEdu #informatik #endlicheautomaten #finiteautomata

monqjfa

monqjfa

Codeberg.org

Happily released my crash course about #FiniteStateMachines / #EndlicheAutomaten in 58 minutes spread over 11 videos.

It addresses #Acceptors, #MealyMachines and #MooreMachines by example with a little theory.

https://www.youtube.com/watch?v=JbsMWgg_a08&list=PLWKw-eM1_aNczvh4iNX_paVF_qOnvJX4k

Presentations (ppsx) and some preliminary code (C# and Java) are freely available at https://github.com/slogslog/Coding-Kurzgeschichten/tree/master/Crashkurs%20Automaten

Videos and materials are in German only, sorry.

#informatikEdu #informatik #htldonaustadt #htldonaustadtinformatik

Finite State Machines [1/11] German - Einführung und ein Getränkeflaschenautomat

YouTube