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-3zbMATH Open1298.68126OpenAlexW2071915699MaRDI QIDQ465906FDOQ465906
Authors: A. N. Chebotarev 
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
Recommendations
- Detecting fictitious states in a \(\Sigma \)-automaton synthesized from its specification in the language LP
- Synthesis of a procedural representation of an automaton specified in the logical language \({\mathfrak L}^*\). II
- Improved method of synthesis of an automaton from its specification in the language \(L\)
- Transformation of a language \(L^\ast\) specification of an FSM into an automata equivalent specification in the language \(L\)
- Synthesis of a procedural representation of an automaton specified in the logical language \({\mathfrak L}^*\). I
quantifier elimination\(\exists\)-formulafictitious stateleft-infinite wordspecification language \(L^*\)synthesis of finite-state machine
Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Logic in computer science (03B70)
Cites Work
- Synthesis of a procedural representation of an automaton specified in the logical language \({\mathfrak L}^*\). I
- Approach to functional specification of automaton systems. I
- Title not available (Why is that?)
- 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
- 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\)
Cited In (4)
- 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
- Generating FSMs from interworkings
- On the class of L\(^*\)-language formulas that specify finite-memory finite-state machines
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\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q465906)
