FAdo
From MaRDI portal
Software:22296
No author found.
Related Items (17)
ON THE AVERAGE STATE COMPLEXITY OF PARTIAL DERIVATIVE AUTOMATA: AN ANALYTIC COMBINATORICS APPROACH ⋮ Applying Data Refinement for Monadic Programs to Hopcroft’s Algorithm ⋮ Deciding Regular Expressions (In-)Equivalence in Coq ⋮ A Type System for Weighted Automata and Rational Expressions ⋮ Automata for regular expressions with shuffle ⋮ Transducer descriptions of DNA code properties and undecidability of antimorphic problems ⋮ On the average complexity of partial derivative transducers ⋮ On the Average Number of States of Partial Derivative Automata ⋮ On Average Behaviour of Regular Expressions in Strong Star Normal Form ⋮ On the size of partial derivatives and the word membership problem ⋮ Incremental DFA Minimisation ⋮ Unnamed Item ⋮ Randomized generation of error control codes with automata and transducers ⋮ Implementation of Code Properties via Transducers ⋮ Regular Expressions and Transducers Over Alphabet-Invariant and User-Defined Labels ⋮ Theoretical and implementational aspects of the formal language server (LaSer) ⋮ Deciding Kleene algebra terms equivalence in Coq
This page was built for software: FAdo
