Transformation of a language L^ specification of an FSM into an automata equivalent specification in the language L

DOI10.1007/S10559-010-9234-XMaRDI QIDQ2452755zbMATH OpenOpenAlexFDO

Authors A. N. Chebotarev

Publication date 5 June 2014

Published in Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10559-010-9234-x

zbMATH Keywords

\(\exists\)-formula\(\Sigma\)-automatonautomata equivalence of specificationselimination of quantifiersspecification language \(L^\ast\)two-sided superword

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• On the class of L\(^*\)-language formulas that specify finite-memory finite-state machines
• Fictitiousness analysis of states of a finite-state machine synthesized from its specification transformed from the language L^* to the language L
• 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

Cites work

• Approach to functional specification of automaton systems. I
• Approximation of sets of superwords by L-language formulas
• Extension of the automaton specification logical language and the synthesis problem
• scientific article; zbMATH DE number 3254910 (Why is no real title available?)
• On the class of L\(^*\)-language formulas that specify finite-memory finite-state machines
• Synthesis of a nondeterministic automaton from its logical specification. I
• 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

Cited in

(3)

• On the class of L\(^*\)-language formulas that specify finite-memory finite-state machines
• Harmonization of automata specifications represented in the language L
• Fictitiousness analysis of states of a finite-state machine synthesized from its specification transformed from the language L^* to the language L

This page was built for publication: Transformation of a language \(L^\ast\) specification of an FSM into an automata equivalent specification in the language \(L\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2452755)