Synthesis of a procedural representation of an automaton specified in the logical language L^*. II

DOI10.1007/BF02733224zbMATH Open0919.68088OpenAlexW3162609728MaRDI QIDQ1280979FDOQ1280979

Authors: A. N. Chebotarev 

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

Recommendations

• Synthesis of a nondeterministic automaton from its logical specification. II
• Synthesis of a procedural representation of an automaton specified in the logical language \({\mathfrak L}^*\). I
• Fictitiousness analysis of states of a finite-state machine synthesized from its specification transformed from the language \(L^*\) to the language \(L\)

zbMATH Keywords

\(n\)-state automaton

Mathematics Subject Classification ID

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

Cites Work

• THE ABSTRACT THEORY OF AUTOMATA
• Synthesis of a procedural representation of an automaton specified in the logical language \({\mathfrak L}^*\). I

Cited In (9)

• Inductive synthesis of an automaton from its specification in the logical language \({\mathfrak L}\)
• Transformation of a language \(L^\ast\) specification of an FSM into an automata equivalent specification in the language \(L\)
• Synthesis of a nondeterministic automaton from its logical specification. I
• Title not available (Why is that?)
• Synthesis of a nondeterministic automaton from its logical specification. II
• 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
• Detecting fictitious states in a \(\Sigma \)-automaton synthesized from its specification in the language LP
• Problems of synthesis of \(\Sigma\)-automata specified in languages LP and LF of first order logic

This page was built for publication: Synthesis of a procedural representation of an automaton specified in the logical language \({\mathfrak L}^*\). II

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