Grail is a symbolic computation environment for finite-state machines, regular expressions, and other formal language theory objects. Using Grail, one can input machines or expressions, convert them from one form to the other, minimize, make deterministic, complement, and perform many other operations. Grail is intended for use in teaching, for research into the properties of machines, and for efficient computation with machines. Grail is written in C++. It can be accessed either through a process library or through a C++ class library. Version 2.4 of Grail enables you to manipulate parameterizable finite-state machines and regular expressions. By `parameterizable’, we mean that the alphabet is not restricted to the usual twenty-six letters and ten digits. Instead, all algorithms are written in a type-independent manner, so that any valid C++ base type and any user-defined type or class can define the alphabet of a finite-state machine or regular expression. Version 2.4 of Grail supports Mealy machines.

References in zbMATH (referenced in 22 articles , 1 standard article )

Showing results 1 to 20 of 22.
Sorted by year (citations)

1 2 next

  1. Gruber, Hermann; Lee, Jonathan; Shallit, Jeffrey: Enumerating regular expressions and their languages (2021)
  2. Shallit, Jeffrey: Robbins and Ardila meet Berstel (2021)
  3. Bell, Jason; Lidbetter, Thomas F.; Shallit, Jeffrey: Additive number theory via approximation by regular languages (2020)
  4. Konstantinidis, Stavros; Meijer, Casey; Moreira, Nelma; Reis, Rogério: Implementation of code properties via transducers (2016)
  5. Câmpeanu, Cezar: Cover languages and implementations (2013) ioport
  6. Cimatti, Alessandro; Mover, Sergio; Roveri, Marco; Tonetta, Stefano: From sequential extended regular expressions to NFA with symbolic labels (2011)
  7. Retoré, Christian; Salvati, Sylvain: A faithful representation of non-associative Lambek grammars in abstract categorial grammars (2010)
  8. Ackerman, Margareta; Shallit, Jeffrey: Efficient enumeration of words in regular languages (2009)
  9. Allouche, Jean-Paul; Rampersad, Narad; Shallit, Jeffrey: Periodicity, repetitions, and orbits of an automatic sequence (2009)
  10. Ackerman, Margareta; Shallit, Jeffrey: Efficient enumeration of regular languages (2007)
  11. Shochat, E.; Rom-Kedar, V.; Segel, L. A.: G-CSF control of neutrophils dynamics in the blood (2007)
  12. Aspinall, David; Beringer, Lennart; Hofmann, Martin; Loidl, Hans-Wolfgang; Momigliano, Alberto: A program logic for resource verification (2004)
  13. Holzer, Markus; Schwoon, Stefan: Assembling molecules in ATOMIX is hard (2004)
  14. Albert, J.; Giammarresi, D.; Wood, D.: Normal form algorithms for extended context-free grammars (2001)
  15. Champarnaud, J.-M.: Subset construction complexity for homogeneous automata, position automata and ZPC-structures (2001)
  16. Duchamp, G.; Flouret, M.; Laugerotte, E.; Luque, J.-G.: Direct and dual laws for automata with multiplicities (2001)
  17. Knuutila, T.: Re-describing an algorithm by Hopcroft (2001)
  18. Salomaa, K.; Wu, X.; Yu, S.: Efficient implementation of regular languages using reversed alternating finite automata (2000)
  19. Albert, Jürgen; Giammarresi, Dora; Wood, Derick: Extended context-free grammars and normal form algorithms (1999)
  20. Syrotiuk, V. R.; Colbourn, C. J.; Pachl, J.: Wang tilings and distributed verification on anonymous torus networks (1997)

1 2 next