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

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

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

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

I'm looking for reviewers for two packages at the moment:

Automata (@pyOpenSci )
Review: https://github.com/pyOpenSci/software-submission/issues/152
Repo: https://github.com/caleb531/automata
A #Python library for simulating finite #automata, pushdown automata, and Turing machines.

Kirstine.jl
( @joss )
Review: https://github.com/openjournals/joss-reviews/issues/6193
Repo: https://sr.ht/~lsandig/Kirstine.jl
A #Julia package for Bayesian optimal experimental design with nonlinear regression models.

You'll be working with another reviewer to read and run the code, make sure it fills a basic checklist which usually only takes a few hours, and beyond that whatever youd like to focus on. Both of these are collaborative review processes where the goal is to help these packages be usable, well documented, and maintainable for the overall health of free scientific software.

Its fun, I promise! Happy to answer questions and boosts welcome.

Edit: feel free to volunteer as a reply here, DM me, or commenting on those issues! Anyone is welcome! Some experience with the language required, but other than that I can coach you through the rest.

#PeerReview #OpenReview #CodeReview #FiniteAutomata #TuringMachines #Bayesian #Regression #Statistics

“Golang Diaries: Generics”, Tim Bray (https://www.tbray.org/ongoing/When/202x/2022/05/14/Golang-Generics).

On HN: https://news.ycombinator.com/item?id=31387312

On Lobsters: https://lobste.rs/s/z7xxmm/golang_diaries_generics

#Go #GoLang #Programming #Generics #Types #Quamina #FiniteAutomata #DFA #NFA