Synthesis of a nondeterministic automaton from its logical specification. II
type: Item
instance of: scholarly article
title: Synthesis of a nondeterministic automaton from its logical specification. II
zbMATH Open document ID: 0868.68079
DOI: 10.1007/BF02366616
published in: Cybernetics and Systems Analysis
publication date: 1996-11-21T00:00:00Z
Mathematics Subject Classification ID: 68Q60
zbMATH DE Number: 948634
zbMATH Keywords: synthesis algorithm
zbMATH Keywords: \(k\)-transition domain
author: A. N. Chebotarev
MaRDI profile type: Publication
cites work: Synthesis of a nondeterministic automaton from its logical specification. I
cites work: Consistency test for simple specifications of automaton systems
full work available at URL: https://doi.org/10.1007/bf02366616
OpenAlex ID: W4241120145
Recommended article: Synthesis of a nondeterministic automaton from its logical specification. I
Recommended article: Automaton synthesis from a nonformal specification
Recommended article: Synthesis of a procedural representation of an automaton specified in the logical language \({\mathfrak L}^*\). II
Recommended article: Q5536642
Recommended article: Inductive synthesis of an automaton from its specification in the logical language \({\mathfrak L}\)
Recommended article: Determinization of logical specifications of automata
Recommended article: Q4288286
Recommended article: Extension of the automaton specification logical language and the synthesis problem
Recommended article: Synthesis of a procedural representation of an automaton specified in the logical language \({\mathfrak L}^*\). I
Recommended article: Q3283892
description: scientific article; zbMATH DE number 948634