Approach to functional specification of automaton systems. I

DOI10.1007/BF01125538zbMath0939.68709MaRDI QIDQ1895045

Anatoli N. Chebotarev

Publication date: 6 August 1995

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

Mathematics Subject Classification ID

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

Related Items (12)

Verifying specifications in the language L against temporal properties nonexpressible in this language ⋮ Checking the satisfiability of formulas represented in disjunctive normal form in the language \(L\). II ⋮ Consistency test for simple specifications of automaton systems ⋮ Resolution approach to testing compatibility of interacting automata ⋮ 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 ⋮ Improved method of synthesis of an automaton from its specification 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\) ⋮ 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 ⋮ Unnamed Item ⋮ Unnamed Item

Cites Work

• Weak Second‐Order Arithmetic and Finite Automata
• Unnamed Item

This page was built for publication: Approach to functional specification of automaton systems. I