Approximation of sets of superwords by L-language formulas
From MaRDI portal
Publication:941189
DOI10.1007/S10559-007-0102-2zbMATH Open1156.68450OpenAlexW2015654578MaRDI QIDQ941189FDOQ941189
Authors: O. I. Kurivchak, A. 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
Recommendations
- On automaton determinisation of sets of superwords
- Super-\(d\)-complexity of finite words
- scientific article; zbMATH DE number 1528682
- Characterizations and effective computation of supremal relatively observable sublanguages
- Super-stationary set, subword problem and the complexity
- Complexity of Infimal Observable Superlanguages
- Algorithmic solvability of comparison problems for finitely ambiguous sequence transducers on superwords
- scientific article; zbMATH DE number 4035162
- The structure of degrees of finite-automaton transformations of prefix decidable superwords
- Rough approximations in varieties of regular languages
approximating sequencesuperwordspecification languageminimal form of a specificationproperties of an algorithm
Cites Work
Cited In (5)
- Transformation of a language \(L^\ast\) specification of an FSM into an automata equivalent specification in the language \(L\)
- Solving inequalities over finite state machines in the reactive systems design
- Design of reactive algorithms by solving equations over automata
- Title not available (Why is that?)
- Title not available (Why is that?)
This page was built for publication: Approximation of sets of superwords by \(L\)-language formulas
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q941189)
