Cited in
(28)- Efficient Enumeration of Regular Languages
- Efficient enumeration of words in regular languages
- A faithful representation of non-associative Lambek grammars in abstract categorial grammars
- Direct and dual laws for automata with multiplicities
- Normal form algorithms for extended context-free grammars
- G-CSF control of neutrophils dynamics in the blood
- Assembling molecules in ATOMIX is hard
- Re-describing an algorithm by Hopcroft
- Implementation of code properties via transducers
- AUTOMATE
- LANGAGE
- OpenFst
- Vaucanson
- FAdo
- GUItar
- Grail
- AMoRE
- Walnut
- Periodicity, repetitions, and orbits of an automatic sequence
- Robbins and Ardila meet Berstel
- Efficient implementation of regular languages using reversed alternating finite automata
- scientific article; zbMATH DE number 1452979 (Why is no real title available?)
- Subset construction complexity for homogeneous automata, position automata and ZPC-structures
- Additive Number Theory via Approximation by Regular Languages
- Enumerating regular expressions and their languages
- Theorem Proving in Higher Order Logics
- From sequential extended regular expressions to NFA with symbolic labels
- Wang tilings and distributed verification on anonymous torus networks
This page was built for software: Grail
