Automaton synthesis from a nonformal specification

DOI10.1007/BF02366559MaRDI QIDQ1905170zbMATH OpenOpenAlexFDO

Authors V. A. Raikhlin

Publication date 22 April 1996

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

Full work available at URL https://doi.org/10.1007/bf02366559

zbMATH Keywords

Huffman method

Mathematics Subject Classification ID

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

Recommendations

• Synthesis of a nondeterministic automaton from its logical specification. I
• scientific article; zbMATH DE number 14487
• Inductive synthesis of an automaton from its specification in the logical language \({\mathfrak L}\)
• Improved method of synthesis of an automaton from its specification in the language L
• scientific article; zbMATH DE number 4078822

Cites work

• THE ABSTRACT THEORY OF AUTOMATA

Cited in

(10)

• Synthesis of a procedural representation of an automaton specified in the logical language \({\mathfrak L}^*\). I
• Synthesis of a nondeterministic automaton from its logical specification. II
• scientific article; zbMATH DE number 2185688 (Why is no real title available?)
• scientific article; zbMATH DE number 4166870 (Why is no real title available?)
• scientific article; zbMATH DE number 3900681 (Why is no real title available?)
• scientific article; zbMATH DE number 3924147 (Why is no real title available?)
• scientific article; zbMATH DE number 4078822 (Why is no real title available?)
• Automated Generation of BSP Automata
• Improved method of synthesis of an automaton from its specification in the language L
• Inductive synthesis of an automaton from its specification in the logical language \({\mathfrak L}\)

This page was built for publication: Automaton synthesis from a nonformal specification

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