Approximation of sets of superwords by \(L\)-language formulas
type: Item
instance of: scholarly article
title: Approximation of sets of superwords by \(L\)-language formulas
zbMATH Open document ID: 1156.68450
author: O. I. Kurivchak
author: A. N. Chebotarev
published in: Cybernetics and Systems Analysis
publication date: 2008-09-04T00:00:00Z
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 5320951
zbMATH Keywords: properties of an algorithm
zbMATH Keywords: specification language
zbMATH Keywords: superword
zbMATH Keywords: minimal form of a specification
zbMATH Keywords: approximating sequence
MaRDI profile type: Publication
full work available at URL: s10559-007-0102-2
OpenAlex ID: W2015654578
cites work: Defining liveness
cites work: Progressive Solutions to a Parallel Automata Equation
cites work: Extension of the automaton specification logical language and the synthesis problem
cites work: Synthesis of a nondeterministic automaton from its logical specification. I
DOI: 10.1007/S10559-007-0102-2
Recommended article: On automaton determinisation of sets of superwords
Recommended article: Q3105104
Recommended article: Q4515265
Recommended article: Characterizations and effective computation of supremal relatively observable sublanguages
Recommended article: Super-stationary set, subword problem and the complexity
Recommended article: Complexity of Infimal Observable Superlanguages
Recommended article: Algorithmic solvability of comparison problems for finitely ambiguous sequence transducers on superwords
Recommended article: Q3774961
Recommended article: The structure of degrees of finite-automaton transformations of prefix decidable superwords
Recommended article: Rough approximations in varieties of regular languages
description: scientific article; zbMATH DE number 5320951