Synthesis of \(\Sigma\)-automata specified in the first order logical languages LP and LF

DOI10.1007/S10559-018-0054-8zbMath1400.68122OpenAlexW2884045325MaRDI QIDQ1616245

Anatoli N. Chebotarev

Publication date: 1 November 2018

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

Full work available at URL: https://doi.org/10.1007/s10559-018-0054-8

zbMATH Keywords

normal formorthogonalization\(\Sigma\)-automatonLF formulaLP formulaautomaton semantics

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (4)

Constructing the maximum prefix-closed subset for a set of \(-\omega \)-words defined by a \(-\omega \)-regular expression ⋮ From LP formulas of the form \(F(t)\) to \(-\omega \)-regular expressions ⋮ Detecting fictitious states in a \(\Sigma \)-automaton synthesized from its specification in the language LP ⋮ Intersection of \(-\omega \)-regular expressions

Cites Work

• Unnamed Item
• Unnamed Item
• Problems of synthesis of \(\Sigma\)-automata specified in languages LP and LF of first order logic
• Synthesis of a procedural representation of an automaton specified in the logical language \({\mathfrak L}^*\). I
• Extension of the automaton specification logical language and the synthesis problem
• Some subsets of monadic first-order logic (MFO) used for the specification and synthesis of \(\Sigma\)-automata

This page was built for publication: Synthesis of \(\Sigma\)-automata specified in the first order logical languages LP and LF