A Polynomial Algorithm for Deciding Complete Reachability and Determining Quadratic Reaching Thresholds
A polynomial-time algorithm is developed to decide whether a given deterministic finite automaton is completely reachable, solving an open problem. Additionally, a quadratic upper bound is proven on the length of the shortest words reaching any non-empty subset of states in a completely reachable automaton.
Mata: A Fast and Efficient Finite Automata Library for String Constraint Solving and Regular Expression Processing
Mata is a well-engineered, fast, and simple finite automata library designed for applications such as string constraint solving, regular expression processing, and regular model checking.
Kleene Theorems for Lasso Languages and $ω$-Languages
Lasso languages can be rational, leading to a Kleene theorem for ω-languages.
Analyzing Don's Conjecture for Completely Reachable Automata
The author explores the validity of Don's conjecture for completely reachable automata, presenting results for both binary and standardized DFAs. The main thesis is to investigate the reachability of subsets in completely reachable automata and analyze the implications of violating Don's conjecture.
© 2024 by Linnk AI