LANGAGE: A Maple package for automaton characterization of regular languages LANGAGE is a set of procedures for deciding whether or not a language given by its minimal automaton is piecewise testable, locally testable, strictly locally testable, or strongly locally testable. New polynomial algorithms are implemented for the two last properties. This package is written using the symbolic computation system Maple. It works with AG, a set of Maple packages for processing automata and finite semigroups.

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

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

1 2 next

  1. Gulan, Stefan: Series parallel digraphs with loops (2013)
  2. Carnino, Vincent; De Felice, Sven: Sampling different kinds of acyclic automata using Markov chains (2012)
  3. Caron, Pascal; Champarnaud, Jean-Marc; Mignot, Ludovic: Multi-tilde-bar expressions and their automata (2012)
  4. Caron, Pascal; Champarnaud, Jean-Marc; Mignot, Ludovic: Acyclic automata and small expressions using multi-tilde-bar operators (2010)
  5. Geffert, Viliam; Mereghetti, Carlo; Palano, Beatrice: More concise representation of regular languages by automata and regular expressions (2010)
  6. Gnanasekaran, S.: Fuzzy local languages (2010)
  7. Han, Yo-Sub; Wood, Derick: Generalizations of 1-deterministic regular languages (2008)
  8. Ouardi, Faissal; Ziadi, Djelloul: Efficient weighted expressions conversion (2008)
  9. Talhi, Chamseddine; Tawbi, Nadia; Debbabi, Mourad: Execution monitoring enforcement under memory-limitation constraints (2008)
  10. Han, Yo-Sub; Wood, Derick: Obtaining shorter regular expressions from finite-state automata (2007)
  11. Lombardy, Sylvain; Sakarovitch, Jacques: Derivatives of rational expressions with multiplicity (2005)
  12. Lombardy, Sylvain; Sakarovitch, Jacques: How expressions can code for automata (2005)
  13. Giammarresi, Dora; Ponty, Jean-Luc; Wood, Derick; Ziadi, Djelloul: A characterization of Thompson digraphs. (2004)
  14. Guingne, Franck; Nicart, Florent; Kempe, André: Acyclic networks maximizing the printing complexity (2004)
  15. Trahtman, A.N.: Reducing the time complexity of testing for local threshold testability (2004)
  16. Yao, Jia-Yan: Some properties of Ising automata (2004)
  17. Trahtman, A. N.: A package TESTAS for checking some kinds of testability (2003)
  18. Trakhtman, Avraam N.: The identities of local threshold testability (2003)
  19. Trahtman, A.N.: An algorithm to verify local threshold testability of deterministic finite automata (2001)
  20. Trahtman, A.N.: Piecewise and local threshold testability of DFA (2001)

1 2 next