\textit{Grail}: A C++ library for automata and expressions

DOI10.1006/JSCO.1994.1023MaRDI QIDQ1332332zbMATH OpenOpenAlexFDO

Authors Darrell Raymond, D. Wood

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

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Symbolic computation and algebraic computation (68W30)

Cited in

(14)

• Grail
• Re-describing an algorithm by Hopcroft
• Enumerating regular expressions and their languages
• Periodicity, repetitions, and orbits of an automatic sequence
• Robbins and Ardila meet Berstel
• Implementation of code properties via transducers
• From sequential extended regular expressions to NFA with symbolic labels
• STATE COMPLEXITY OF UNION AND INTERSECTION OF FINITE LANGUAGES
• Automata, palindromes, and reversed subwords
• Additive Number Theory via Approximation by Regular Languages
• 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
• Smaller representation of compiled regular expressions

This page was built for publication: \textit{Grail}: A C++ library for automata and expressions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1332332)