\textit{Grail}: A C++ library for automata and expressions
From MaRDI portal
Publication:1332332
DOI10.1006/jsco.1994.1023zbMath0942.68803OpenAlexW2048476153MaRDI QIDQ1332332
Publication date: 27 June 2000
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jsco.1994.1023
Related Items (14)
Robbins and Ardila meet Berstel ⋮ Smaller representation of compiled regular expressions ⋮ STATE COMPLEXITY OF UNION AND INTERSECTION OF FINITE LANGUAGES ⋮ Unnamed Item ⋮ Periodicity, repetitions, and orbits of an automatic sequence ⋮ Subset construction complexity for homogeneous automata, position automata and ZPC-structures ⋮ Normal form algorithms for extended context-free grammars ⋮ Direct and dual laws for automata with multiplicities ⋮ From Sequential Extended Regular Expressions to NFA with Symbolic Labels ⋮ Grail ⋮ Implementation of Code Properties via Transducers ⋮ Enumerating regular expressions and their languages ⋮ Re-describing an algorithm by Hopcroft ⋮ Additive Number Theory via Approximation by Regular Languages
This page was built for publication: \textit{Grail}: A C++ library for automata and expressions
