Synthesis of a nondeterministic automaton from its logical specification. I

DOI10.1007/BF02366311zbMath0856.68105MaRDI QIDQ1922337

Anatoli N. Chebotarev

Publication date: 28 August 1996

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

zbMATH Keywords

automaton synthesis

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Abstract data types; algebraic specification (68Q65)

Related Items (4)

Transformation of a language \(L^\ast\) specification of an FSM into an automata equivalent specification in the language \(L\) ⋮ Approximation of sets of superwords by \(L\)-language formulas ⋮ Checking the satisfiability of formulas represented in disjunctive normal form in the language \(L\). I ⋮ Synthesis of a nondeterministic automaton from its logical specification. II

Cites Work

• Unnamed Item

This page was built for publication: Synthesis of a nondeterministic automaton from its logical specification. I