FAdo
From MaRDI portal
Software:22296
swMATH10335MaRDI QIDQ22296FDOQ22296
Author name not available (Why is that?)
Cited In (17)
- Deciding Regular Expressions (In-)Equivalence in Coq
- Theoretical and implementational aspects of the formal language server (LaSer)
- On the average state complexity of partial derivative automata: an analytic combinatorics approach
- Applying Data Refinement for Monadic Programs to Hopcroft’s Algorithm
- Regular Expressions and Transducers Over Alphabet-Invariant and User-Defined Labels
- On the Average Number of States of Partial Derivative Automata
- On the size of partial derivatives and the word membership problem
- On Average Behaviour of Regular Expressions in Strong Star Normal Form
- Title not available (Why is that?)
- Implementation of Code Properties via Transducers
- Deciding Kleene algebra terms equivalence in Coq
- Randomized generation of error control codes with automata and transducers
- A Type System for Weighted Automata and Rational Expressions
- Incremental DFA Minimisation
- 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
This page was built for software: FAdo
