Mutation of Directed Graphs -- Corresponding Regular Expressions and Complexity of Their Generation

@inproceedings{Belli2009MutationOD,
  title={Mutation of Directed Graphs -- Corresponding Regular Expressions and Complexity of Their Generation},
  author={Fevzi Belli and Mutlu Beyazit},
  booktitle={DCFS},
  year={2009}
}
  • Fevzi Belli, Mutlu Beyazit
  • Published in DCFS 2009
  • Computer Science, Mathematics
  • Directed graphs (DG), interpreted as state transition diag rams, are traditionally used to represent finite-state automata (FSA). In the context of formal langua ges, both FSA and regular expressions (RE) are equivalent in that they accept and generate, respectively, type-3 (regular) languages. Based on our previous work, this paper analyzes effects of graph manipulations on corresponding RE. In this present, starting stage we assume that the DG under consideration contains no cycles. Graph… CONTINUE READING
    A 3D multiuser virtual learning environment and learning management system
    1
    Model-based mutation testing - Approach and case studies
    28
    Graphic user interface modelling and testing automation
    12
    A Formal Framework for Mutation Testing
    19

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 19 REFERENCES