Zobrazeno 1 - 10
of 80
pro vyhledávání: '"Lenisa, M"'
Autor:
Juliana L. Paes, Lenisa M. P. Costa, Pedro L. B. G. Fernandes, Beatriz C. Vargas, Daiane Cecchin
Publikováno v:
Engenharia Agrícola, Vol 43, Iss spe (2023)
ABSTRACT The use of agricultural residues in anaerobic digestion (AD) for biogas production promotes environmental and socioeconomic benefits. This study aimed to evaluate the biogas production from dry coffee husks (DCH), wet coffee husks (WCH), and
Externí odkaz:
https://doaj.org/article/78d864503eb24514a0f602e073fe9d7f
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.
We present the web portal Λ-symsym, available at http://158.110.146.197:31780/automata/, for experimenting with game semantics of λ^!-calculus, and its normalizing elementary sub-calculus, the λ^{EAL}-calculus. The λ^!-calculus is a generalizatio
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::477ca9b4003ded9878a01dd9f527899a
Publikováno v:
Algebra and Coalgebra in Computer Science: Third International Conference, CALCO 2009, Udine, Italy, September 7-10, 2009 : proceedings, 81-96
STARTPAGE=81;ENDPAGE=96;TITLE=Algebra and Coalgebra in Computer Science
Algebra and Coalgebra in Computer Science ISBN: 9783642037405
CALCO
STARTPAGE=81;ENDPAGE=96;TITLE=Algebra and Coalgebra in Computer Science
Algebra and Coalgebra in Computer Science ISBN: 9783642037405
CALCO
Coalgebra automata, introduced by the second author, generalize the well-known automata that operate on infinite words/streams, trees, graphs or transition systems. This coalgebraic perspective on automata lays foundation to a universal theory of aut
Publikováno v:
Algebra and Coalgebra in Computer Science ISBN: 9783642037405
CALCO
Lectures Notes in Computer Science ; 5728, 236-250. Berlin : Springer
STARTPAGE=236;ENDPAGE=250;TITLE=Lectures Notes in Computer Science ; 5728
Kurz, A.; Lenisa, M.; Tarlecki, A. (ed.), Algebra and Coalgebra in Computer Science : Third International Conference, CALCO 2009, Udine, Italy, September 7-10, 2009, Proceedings, pp. 236-250
CALCO
Lectures Notes in Computer Science ; 5728, 236-250. Berlin : Springer
STARTPAGE=236;ENDPAGE=250;TITLE=Lectures Notes in Computer Science ; 5728
Kurz, A.; Lenisa, M.; Tarlecki, A. (ed.), Algebra and Coalgebra in Computer Science : Third International Conference, CALCO 2009, Udine, Italy, September 7-10, 2009, Proceedings, pp. 236-250
This is a theoretical paper giving the extended Stone duality perspective on the recently discovered connection between duality theory as studied in non-classical logic and theoretical computer science and the algebraic theory of finite state automat
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::46086eb5a7564a96f9d18aa5a1e8046e
https://doi.org/10.1007/978-3-642-03741-2_17
https://doi.org/10.1007/978-3-642-03741-2_17
Publikováno v:
Kurz, A.; Lenisa, M.; Tarlecki, A. (ed.), Algebra and Coalgebra in Computer Science : Third International Conference, CALCO 2009, Udine, Italy, September 7-10, 2009, Proceedings, pp. 251-266
Kurz, A.; Lenisa, M.; Tarlecki, A. (ed.), Algebra and Coalgebra in Computer Science : Third International Conference, CALCO 2009, Udine, Italy, September 7-10, 2009, Proceedings, 251-266. Berlin : Springer
STARTPAGE=251;ENDPAGE=266;ISSN=0302-9743;TITLE=Kurz, A.; Lenisa, M.; Tarlecki, A. (ed.), Algebra and Coalgebra in Computer Science : Third International Conference, CALCO 2009, Udine, Italy, September 7-10, 2009, Proceedings
Kurz, A.; Lenisa, M.; Tarlecki, A. (ed.), Algebra and Coalgebra in Computer Science : Third International Conference, CALCO 2009, Udine, Italy, September 7-10, 2009, Proceedings, 251-266. Berlin : Springer
STARTPAGE=251;ENDPAGE=266;ISSN=0302-9743;TITLE=Kurz, A.; Lenisa, M.; Tarlecki, A. (ed.), Algebra and Coalgebra in Computer Science : Third International Conference, CALCO 2009, Udine, Italy, September 7-10, 2009, Proceedings
Contains fulltext : 75416.pdf (Publisher’s version ) (Closed access) Third International Conference, CALCO 2009, Udine, Italy, September 7-10, 2009, Proceedings, 07 september 2009 457 p.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::64bbbf95cdc367f3fe8ee0a074f95515
https://hdl.handle.net/2066/75416
https://hdl.handle.net/2066/75416
Publikováno v:
Lecture Notes in Computer Science ; 5728, 267-283. Berlin : Springer
STARTPAGE=267;ENDPAGE=283;TITLE=Lecture Notes in Computer Science ; 5728
Kurz, A.; Lenisa, M.; Tarlecki, A. (ed.), Algebra and Coalgebra in Computer Science : Third International Conference, CALCO 2009, Udine, Italy, September 7-10, 2009, Proceedings, pp. 267-283
STARTPAGE=267;ENDPAGE=283;TITLE=Lecture Notes in Computer Science ; 5728
Kurz, A.; Lenisa, M.; Tarlecki, A. (ed.), Algebra and Coalgebra in Computer Science : Third International Conference, CALCO 2009, Udine, Italy, September 7-10, 2009, Proceedings, pp. 267-283
Contains fulltext : 75516.pdf (Publisher’s version ) (Closed access) Third International Conference, CALCO 2009, Udine, Italy, September 7-10, 2009, Proceedings
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::f78b88834061a74c62cff6bd24e69b51
https://hdl.handle.net/2066/75516
https://hdl.handle.net/2066/75516
Publikováno v:
Algebra and Coalgebra in Computer Science ISBN: 9783642037405
CALCO
Proceedings of the 3rd International Conference on Algebra and Coalgebra in Computer Science (CALCO 2009), 7-10 September 2009, Udine, Italy, 206-220
STARTPAGE=206;ENDPAGE=220;TITLE=Proceedings of the 3rd International Conference on Algebra and Coalgebra in Computer Science (CALCO 2009), 7-10 September 2009, Udine, Italy
CALCO
Proceedings of the 3rd International Conference on Algebra and Coalgebra in Computer Science (CALCO 2009), 7-10 September 2009, Udine, Italy, 206-220
STARTPAGE=206;ENDPAGE=220;TITLE=Proceedings of the 3rd International Conference on Algebra and Coalgebra in Computer Science (CALCO 2009), 7-10 September 2009, Udine, Italy
A theory of traces of computations has emerged within the field of coalgebra, via finality in Kleisli categories. In concurrency theory, traces are traditionally obtained from executions, by projecting away states. These traces and executions are seq
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::35a004fc1ba3870b611f60d02e4825cd
https://doi.org/10.1007/978-3-642-03741-2_15
https://doi.org/10.1007/978-3-642-03741-2_15
Publikováno v:
Algebra and Coalgebra in Computer Science (Third International Conference, CALCO 2009, Udine, Italy, September 7-10, 2009. Proceedings), 449-456
STARTPAGE=449;ENDPAGE=456;TITLE=Algebra and Coalgebra in Computer Science (Third International Conference, CALCO 2009, Udine, Italy, September 7-10, 2009. Proceedings)
Algebra and Coalgebra in Computer Science ISBN: 9783642037405
CALCO
STARTPAGE=449;ENDPAGE=456;TITLE=Algebra and Coalgebra in Computer Science (Third International Conference, CALCO 2009, Udine, Italy, September 7-10, 2009. Proceedings)
Algebra and Coalgebra in Computer Science ISBN: 9783642037405
CALCO
A stream specification is a set of equations intended to define a stream, that is, an infinite sequence over a given data type. In [5] a transformation from such a stream specification to a TRS is defined in such a way that termination of the resulti
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9529b129f7c02f24d5d200f697dd7458
https://research.tue.nl/nl/publications/2f70fdf2-b5f8-4a6e-8388-310e8c4cde13
https://research.tue.nl/nl/publications/2f70fdf2-b5f8-4a6e-8388-310e8c4cde13