Detecting fictitious states in a \(\Sigma \)-automaton synthesized from its specification in the language LP

DOI10.1007/s10559-019-00184-xzbMath1448.68261OpenAlexW2980590076MaRDI QIDQ2287411

Anatoli N. Chebotarev

Publication date: 20 January 2020

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

Full work available at URL: https://doi.org/10.1007/s10559-019-00184-x

zbMATH Keywords

normal formfictitious state\( \Sigma \)-automaton\(-\omega \)-regular setbasic cycleinitial strongly connected subautomaton

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (2)

From LP formulas of the form \(F(t)\) to \(-\omega \)-regular expressions ⋮ Intersection of \(-\omega \)-regular expressions

Cites Work

• Unnamed Item
• Problems of synthesis of \(\Sigma\)-automata specified in languages LP and LF of first order logic
• A theory of ultimately periodic languages and automata with an application to time granularity
• Synthesis of a procedural representation of an automaton specified in the logical language \({\mathfrak L}^*\). II
• Synthesis of \(\Sigma\)-automata specified in the first order logical languages LP and LF
• Some subsets of monadic first-order logic (MFO) used for the specification and synthesis of \(\Sigma\)-automata
• Ultimately periodic words of rational ω-languages

This page was built for publication: Detecting fictitious states in a \(\Sigma \)-automaton synthesized from its specification in the language LP