On the Structure and Complexity of Rational Sets of Regular Languages

Holzer, Andreas; Schallhart, Christian; Tautschnig, Michael; Veith, Helmut

doi:10.4230/LIPIcs.FSTTCS.2013.377

Document

On the Structure and Complexity of Rational Sets of Regular Languages

Authors Andreas Holzer, Christian Schallhart, Michael Tautschnig, Helmut Veith

Part of: Volume: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2013)
Part of: Series: Leibniz International Proceedings in Informatics (LIPIcs)
Part of: Conference: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS)
License: Creative Commons Attribution 3.0 Unported license
Publication Date: 2013-12-10

PDF

File

PDF

LIPIcs.FSTTCS.2013.377.pdf

Filesize: 0.56 MB
12 pages

Document Identifiers

DOI: 10.4230/LIPIcs.FSTTCS.2013.377
URN: urn:nbn:de:0030-drops-43871

Subject Classification

Keywords

Rational Sets
Regular Languages
Test Specification in FQL
Closure Properties
Decision Problems

Metrics

Access Statistics
Total Accesses (updated on a weekly basis)

0

PDF Downloads

0

Metadata Views

Abstract

In the recently designed and implemented test specification language FQL, relevant test goals are specified as regular expressions over program locations. To transition from single test goals to test suites, FQL describes suites as regular expressions over finite alphabets where each symbol corresponds to a regular expression over program locations. Hence, each word in a test suite expression yields a test goal specification. Such test suite specifications are in fact rational sets of regular languages (RSRLs). We show closure properties of general and finite RSRLs under common set theoretic operations. We also prove complexity results for checking equivalence and inclusion of star-free RSRLs and for checking whether a regular language is a member of a general or star-free RSRL. As the star-free (and thus finite) case underlies FQL specifications, the closure and complexity results provide a systematic foundation for FQL test specifications.

Cite As Get BibTex

Andreas Holzer, Christian Schallhart, Michael Tautschnig, and Helmut Veith. On the Structure and Complexity of Rational Sets of Regular Languages. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2013). Leibniz International Proceedings in Informatics (LIPIcs), Volume 24, pp. 377-388, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2013) https://doi.org/10.4230/LIPIcs.FSTTCS.2013.377

Author Details

Andreas Holzer

Christian Schallhart

Michael Tautschnig

Helmut Veith

Questions / Remarks / Feedback

Feedback for Dagstuhl Publishing

Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail