On the class of L\(^*\)-language formulas that specify finite-memory finite-state machines
type: Item
instance of: scholarly article
title: On the class of L\(^*\)-language formulas that specify finite-memory finite-state machines
zbMATH Open document ID: 1204.68119
published in: Cybernetics and Systems Analysis
publication date: 2010-09-24T00:00:00Z
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 5790945
zbMATH Keywords: specification language L\(^*\)
zbMATH Keywords: \(\exists \)-formula
zbMATH Keywords: bi-infinite \(\omega \)-word
zbMATH Keywords: \(\Sigma \)-automaton
zbMATH Keywords: finite-memory finite-state machine
zbMATH Keywords: k-separability
author: A. N. Chebotarev
MaRDI profile type: Publication
full work available at URL: s10559-010-9177-2
OpenAlex ID: W2036225144
cites work: Q5541343
cites work: Approach to functional specification of automaton systems. I
cites work: Extension of the automaton specification logical language and the synthesis problem
cites work: Synthesis of a procedural representation of an automaton specified in the logical language \({\mathfrak L}^*\). I
cites work: On an approach to functional specification of automata systems. III
DOI: 10.1007/S10559-010-9177-2
description: scientific article; zbMATH DE number 5790945