Zobrazeno 1 - 10
of 52
pro vyhledávání: '"Automata construction"'
Autor:
Graça Bidarra, Anália Santos, Piedade Vaz-Rebelo, Oliver Thiel, Carlos Barreira, Valentim Alferes, Joana Almeida, Inês Machado, Corinna Bartoletti, Francesca Ferrini, Signe Hanssen, Rolv Lundheim, Jørgen Moe, Joel Josephson, Veneta Velkova, Nelly Kostova
Publikováno v:
Education Sciences, Vol 11, Iss 3, p 137 (2021)
This work analyzes spontaneous cooperation between children who participated in Automata for STEM, European Union funded Erasmus+ project workshops. Taking into account the characteristics of automata, that involve a narrative part and a mechanism, t
Externí odkaz:
https://doaj.org/article/3c18cb4533ea4f3ab165664943cc8a04
Autor:
Piedade Vaz-Rebelo, Anália Santos, Valentim R. Alferes, Nelly Kostova, Oliver Thiel, Carlos Barreira, Graça Bidarra, Veneta Velkova, Joel Josephson, Signe Hanssen, Rolv Lundheim, Jørgen Moe, Inês Machado, Corinna Bartoletti, Francesca Ferrini, J. M. A. Almeida
Publikováno v:
Education Sciences
Education Sciences, Vol 11, Iss 137, p 137 (2021)
Volume 11
Issue 3
Education Sciences, Vol 11, Iss 137, p 137 (2021)
Volume 11
Issue 3
This work analyzes spontaneous cooperation between children who participated in Automata for STEM, European Union funded Erasmus+ project workshops. Taking into account the characteristics of automata, that involve a narrative part and a mechanism, t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f9942e1fc8b369bee2a62e77bd508567
https://hdl.handle.net/11250/2736781
https://hdl.handle.net/11250/2736781
Publikováno v:
ASE
The All-SAT (All-SATisfiable) problem focuses on finding all satisfiable assignments of a given propositional formula, whose applications include model checking, automata construction, and logic minimization. A typical ALL-SAT solver is normally base
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::81293952ec58e8b3cc43940c36df6718
https://doi.org/10.1145/3324884.3416569
https://doi.org/10.1145/3324884.3416569
Publikováno v:
APSEC
In this paper, we consider the automata construction problem for Linear Temporal Logic over finite traces, i.e., $\mathbf{LTL}_{f}$ . We propose a SAT-based approach to translate an $\mathbf{LTL}_{f}$ formula to both of its equivalent Nondeterministi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::17689f31a27c17895f490991b4db9386
https://doi.org/10.1109/apsec51365.2020.00008
https://doi.org/10.1109/apsec51365.2020.00008
Publikováno v:
Journal of Ambient Intelligence and Humanized Computing. 10:2585-2592
In order to reach the community interested in some basic elements of the adaptive automata theory, an interpretable language called DInAton (Didactical and Interactive Adaptive Automata Construction Language) was designed. In the language design, the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::fc81e986de33ad9bc342b09da8403182
https://doi.org/10.1007/s12652-018-0735-1
https://doi.org/10.1007/s12652-018-0735-1
Publikováno v:
Bille, P, Gørtz, I L & Skjoldjensen, F R 2017, ' Subsequence automata with default transitions ', Journal of Discrete Algorithms, vol. 44, pp. 48-55 . https://doi.org/10.1016/j.jda.2017.05.001
Let $S$ be a string of length $n$ with characters from an alphabet of size $\sigma$. The \emph{subsequence automaton} of $S$ (often called the \emph{directed acyclic subsequence graph}) is the minimal deterministic finite automaton accepting all subs
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b20eeea91c2af2b4dd1660e4cbbd5d87
https://doi.org/10.1016/j.jda.2017.05.001
https://doi.org/10.1016/j.jda.2017.05.001
Publikováno v:
ANT/SEIT
In order to reach the community interested in some basic elements of the adaptive automata theory, an interpretable language called DInAton (Didactical and Interactive Adaptive Automata Construction Language) was projected. In the language design, th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::19319bff7de3877aa66d8b378de51116
https://doi.org/10.1016/j.procs.2017.05.393
https://doi.org/10.1016/j.procs.2017.05.393
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Damien Pous, Paul Brunet
Publikováno v:
Journal of Logical and Algebraic Methods in Programming. 85:574-594
The equational theory generated by all algebras of binary relations with operations of union, composition, converse and reflexive transitive closure was studied by Bernatsky, Bloom, Esik and Stefanescu in 1995. In particular, they obtained its decida
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b5cc28969ab293398b5651462291c749
https://doi.org/10.1016/j.jlamp.2015.07.005
https://doi.org/10.1016/j.jlamp.2015.07.005
Publikováno v:
Formal Aspects of Computing. 28:233-263
We present a black-box active learning algorithm for inferring extended finite state machines (EFSM)s by dynamic black-box analysis. EFSMs can be used to model both data flow and control behavior of software and hardware components. Different dialect
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f55d64c050d8637265aa2cba7c66d9bb
https://doi.org/10.1007/s00165-016-0355-5
https://doi.org/10.1007/s00165-016-0355-5