Closure properties and complexity of rational sets of regular languages
type: Item
instance of: scholarly article
title: Closure properties and complexity of rational sets of regular languages
zbMATH Open document ID: 1330.68160
author: Andreas Holzer
author: Christian Schallhart
author: Michael Tautschnig
author: Helmut Veith
published in: Theoretical Computer Science
publication date: 2015-10-30T00:00:00Z
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 68N30
zbMATH DE Number: 6502579
zbMATH Keywords: rational sets
zbMATH Keywords: regular languages
zbMATH Keywords: test specification in FQL
zbMATH Keywords: closure properties
zbMATH Keywords: decision problems
describes a project that uses: FShell
MaRDI profile type: Publication
full work available at URL: j.tcs.2015.08.035
OpenAlex ID: W1788765909
cites work: An Introduction to Test Specification in FQL
cites work: Query-Driven Program Testing
cites work: Information Reuse for Multi-goal Reachability Analyses
cites work: Developments in Language Theory
cites work: On the Structure and Complexity of Rational Sets of Regular Languages
cites work: Rational sets in commutative monoids
cites work: Lazy abstraction
cites work: Rewriting of regular expressions and regular path queries
cites work: Representation theorems on regular languages
cites work: Limitedness theorem on finite automata with distance functions
cites work: THE EQUALITY PROBLEM FOR RATIONAL SERIES WITH MULTIPLICITIES IN THE TROPICAL SEMIRING IS UNDECIDABLE
cites work: Q2957917
cites work: Foundations of Software Science and Computation Structures
cites work: Distance desert automata and the star height problem
cites work: Q3859267
cites work: Graph Logics with Rational Relations and the Generalized Intersection Problem
cites work: Parameterized regular expressions and their languages
cites work: Q5549817
cites work: On finite automata with a time-variant structure
cites work: Lattice Automata
cites work: Q3862379
cites work: The limitedness problem on distance automata: Hashiguchi's method revisited
cites work: Minimal Union-Free Decompositions of Regular Languages
DOI: 10.1016/J.TCS.2015.08.035
Recommended article: On the Structure and Complexity of Rational Sets of Regular Languages
Recommended article: MEMBERSHIP AND FINITENESS PROBLEMS FOR RATIONAL SETS OF REGULAR LANGUAGES
Recommended article: Developments in Language Theory
Recommended article: On the complexity of computing the profinite closure of a rational language
Recommended article: Decision Problems and Applications of Rational Sets of Regular Languages
Recommended article: The full quotient and its closure property for regular languages
Recommended article: Closure properties and descriptional complexity of deterministic regular expressions
Recommended article: Recognizing pro-\(\mathrm{R}\) closures of regular languages
Recommended article: A closure property of regular languages
Recommended article: Regular Closure of Deterministic Languages
description: scientific article; zbMATH DE number 6502579