Transformation of a language \(L^\ast\) specification of an FSM into an automata equivalent specification in the language \(L\) (Q2452755): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Extension of the automaton specification logical language and the synthesis problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approach to functional specification of automaton systems. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5541343 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Synthesis of a procedural representation of an automaton specified in the logical language \({\mathfrak L}^*\). I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Synthesis of a procedural representation of an automaton specified in the logical language \({\mathfrak L}^*\). II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Synthesis of a nondeterministic automaton from its logical specification. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the class of L\(^*\)-language formulas that specify finite-memory finite-state machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation of sets of superwords by \(L\)-language formulas / rank
 
Normal rank

Latest revision as of 14:44, 8 July 2024

scientific article
Language Label Description Also known as
English
Transformation of a language \(L^\ast\) specification of an FSM into an automata equivalent specification in the language \(L\)
scientific article

    Statements

    Transformation of a language \(L^\ast\) specification of an FSM into an automata equivalent specification in the language \(L\) (English)
    0 references
    5 June 2014
    0 references
    specification language \(L^\ast\)
    0 references
    \(\exists\)-formula
    0 references
    two-sided superword
    0 references
    \(\Sigma\)-automaton
    0 references
    elimination of quantifiers
    0 references
    automata equivalence of specifications
    0 references

    Identifiers