Grail

swMATH374MaRDI QIDQ13134FDOQ13134

Author name not available (Why is that?)

Described by source

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

Cited In (19)

• Efficient Enumeration of Regular Languages
• Efficient enumeration of words in regular languages
• From Sequential Extended Regular Expressions to NFA with Symbolic Labels
• Direct and dual laws for automata with multiplicities
• A faithful representation of non-associative Lambek grammars in abstract categorial grammars
• 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
• Periodicity, repetitions, and orbits of an automatic sequence
• Robbins and Ardila meet Berstel
• Efficient implementation of regular languages using reversed alternating finite automata
• Title not available (Why is that?)
• Implementation of Code Properties via Transducers
• 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
• Wang tilings and distributed verification on anonymous torus networks

This page was built for software: Grail