On the class of L\(^*\)-language formulas that specify finite-memory finite-state machines
From MaRDI portal
Publication:1956960
DOI10.1007/s10559-010-9177-2zbMath1204.68119OpenAlexW2036225144MaRDI QIDQ1956960
Publication date: 24 September 2010
Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10559-010-9177-2
\(\exists \)-formula\(\Sigma \)-automatonbi-infinite \(\omega \)-wordfinite-memory finite-state machinek-separabilityspecification language L\(^*\)
Related Items (3)
Fictitiousness analysis of states of a finite-state machine synthesized from its specification transformed from the language \(L^*\) to the language \(L\) ⋮ Compositional approach to the development of reactive algorithms ⋮ Transformation of a language \(L^\ast\) specification of an FSM into an automata equivalent specification in the language \(L\)
Cites Work
- Unnamed Item
- Synthesis of a procedural representation of an automaton specified in the logical language \({\mathfrak L}^*\). I
- Extension of the automaton specification logical language and the synthesis problem
- On an approach to functional specification of automata systems. III
- Approach to functional specification of automaton systems. I
This page was built for publication: On the class of L\(^*\)-language formulas that specify finite-memory finite-state machines
