Iterating Transducers in the Large

This publication has 15 references indexed in Scilit:

• Regular Model Checking Made Simple and Effcient*
  2002
• Representing Arithmetic Constraints with Finite Automata: An Overview
  2002
• Iterating Transducers
  Lecture Notes in Computer Science, 2001
• Regular Model Checking
  2000
• On-the-fly analysis of systems with unbounded, lossy FIFO channels
  Lecture Notes in Computer Science, 1998
• Symbolic reachability analysis of FIFO-channel systems with nonregular sets of configurations
  Lecture Notes in Computer Science, 1997
• Reachability analysis of pushdown automata: Application to model-checking
  1997
• Verifying Programs with Unreliable Channels
  Information and Computation, 1996
• Logic and {$p$}-recognizable sets of integers
  Bulletin of the Belgian Mathematical Society - Simon Stevin, 1994
• AN n log n ALGORITHM FOR MINIMIZING STATES IN A FINITE AUTOMATON
  1971