Synthesis of a procedural representation of an automaton specified in the logical language \({\mathfrak L}^*\). II
From MaRDI portal
Publication:1280979
DOI10.1007/BF02733224zbMath0919.68088OpenAlexW3162609728MaRDI QIDQ1280979
Publication date: 31 August 1999
Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02733224
Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)
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\) ⋮ Transformation of a language \(L^\ast\) specification of an FSM into an automata equivalent specification in the language \(L\) ⋮ Detecting fictitious states in a \(\Sigma \)-automaton synthesized from its specification in the language LP
Cites Work
This page was built for publication: Synthesis of a procedural representation of an automaton specified in the logical language \({\mathfrak L}^*\). II
