Fictitiousness analysis of states of a finite-state machine synthesized from its specification transformed from the language \(L^*\) to the language \(L\)
DOI10.1007/S10559-013-9478-3zbMath1298.68126OpenAlexW2071915699MaRDI QIDQ465906
Publication date: 24 October 2014
Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10559-013-9478-3
quantifier elimination\(\exists\)-formulafictitious stateleft-infinite wordspecification language \(L^*\)synthesis of finite-state machine
Formal languages and automata (68Q45) Logic in computer science (03B70) Specification and verification (program logics, model checking, etc.) (68Q60)
Cites Work
- Synthesis of a procedural representation of an automaton specified in the logical language \({\mathfrak L}^*\). I
- Synthesis of a procedural representation of an automaton specified in the logical language \({\mathfrak L}^*\). II
- Extension of the automaton specification logical language and the synthesis problem
- Approach to functional specification of automaton systems. I
- On the class of L\(^*\)-language formulas that specify finite-memory finite-state machines
- Transformation of a language \(L^\ast\) specification of an FSM into an automata equivalent specification in the language \(L\)
- Unnamed Item
This page was built for publication: Fictitiousness analysis of states of a finite-state machine synthesized from its specification transformed from the language \(L^*\) to the language \(L\)
