Approximation of sets of superwords by \(L\)-language formulas

DOI10.1007/S10559-007-0102-2zbMath1156.68450OpenAlexW2015654578MaRDI QIDQ941189

O. I. Kurivchak, Anatoli N. Chebotarev

Publication date: 4 September 2008

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

Full work available at URL: https://doi.org/10.1007/s10559-007-0102-2

zbMATH Keywords

specification languageapproximating sequencesuperwordminimal form of a specificationproperties of an algorithm

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (4)

Transformation of a language \(L^\ast\) specification of an FSM into an automata equivalent specification in the language \(L\) ⋮ Design of reactive algorithms by solving equations over automata ⋮ Unnamed Item ⋮ Unnamed Item

Cites Work

• Defining liveness
• Extension of the automaton specification logical language and the synthesis problem
• Synthesis of a nondeterministic automaton from its logical specification. I
• Progressive Solutions to a Parallel Automata Equation

This page was built for publication: Approximation of sets of superwords by \(L\)-language formulas