Zobrazeno 1 - 10
of 10
pro vyhledávání: '"Laurette Marais"'
Autor:
Laurette Marais, Lynette van Zijl
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 252, Iss Proc. AFL 2017, Pp 157-169 (2017)
Previously, self-verifying symmetric difference automata were defined and a tight bound of 2^n-1-1 was shown for state complexity in the unary case. We now consider the non-unary case and show that, for every n at least 2, there is a regular language
Externí odkaz:
https://doaj.org/article/55991720c937435b8f2b700c63330c5f
Publikováno v:
South African Journal of Communication Disorders, Vol 65, Iss 1, Pp e1-e8 (2018)
Background: Children who enter school with limited vocabulary knowledge are at risk for reading failure. This study investigated the efficacy of an interactive e-book, implemented as a mobile application, to facilitate vocabulary learning in Grade 1
Externí odkaz:
https://doaj.org/article/bc3f34a4d7f7491691b028eef3107805
Autor:
Thapelo P. Mofokeng, Makwena J. Moloto, Poslet M. Shumbula, Pardon Nyamukamba, Pierre K. Mubiayi, Samkeliso Takaidza, Laurette Marais
Publikováno v:
Journal of Nanotechnology, Vol 2018 (2018)
The synthesis of polydispersed zinc sulphide and copper sulphide nanocrystals capped with polar L-alanine (Aln) and l-aspartic acid (Asp) molecules is reported. The resulting nanocrystals were characterized by UV-visible spectroscopy (UV-Vis), photol
Externí odkaz:
https://doaj.org/article/2a1e0152c732443b88deb6b724deaf9a
Autor:
Laurette Marais, Nina van Niekerk, Johannes A. Louw, Karen Calteaux, Ilana Wilken, Jaco Badenhorst, Glenn Stein
Publikováno v:
FUSION
The language contexts of multilingual developing countries such as South Africa are often characterised by communication challenges resulting from language differences. AwezaMed is a multilingual, multimodal speech-to-speech translation application f
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f3cdb6c6b9d7028be25f6e6b74c0064b
https://doi.org/10.23919/fusion45008.2020.9190240
https://doi.org/10.23919/fusion45008.2020.9190240
Autor:
Lynette van Zijl, Laurette Marais
Publikováno v:
AFL
Electronic Proceedings in Theoretical Computer Science, Vol 252, Iss Proc. AFL 2017, Pp 157-169 (2017)
Electronic Proceedings in Theoretical Computer Science, Vol 252, Iss Proc. AFL 2017, Pp 157-169 (2017)
Previously, self-verifying symmetric difference automata were defined and a tight bound of 2^n-1-1 was shown for state complexity in the unary case. We now consider the non-unary case and show that, for every n at least 2, there is a regular language
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::898a2852d47ebba670371b136f9b8c13
https://doi.org/10.4204/eptcs.252.16
https://doi.org/10.4204/eptcs.252.16
Publikováno v:
Language Resources and Evaluation. 51:159-189
The Grammatical Framework (GF) not only offers state of the art grammar-based machine translation support between an increasing number of languages through its so-called Resource Grammar Library, but is also fast becoming a de facto framework for dev
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::703dddf8c964416ff35bf7b4f13f7f2a
https://doi.org/10.1007/s10579-016-9341-z
https://doi.org/10.1007/s10579-016-9341-z
Autor:
Laurette Marais, Lynette van Zijl
Publikováno v:
SAICSIT
Given two unary languages accepted by symmetric difference non-deterministic finite automata, we establish bounds on the state complexity of their union, intersection, relative complement and symmetric difference. For languages L1 and L2 accepted by
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c80747f0e7a07f3f51459a3f8f4f3b17
https://doi.org/10.1145/3278681.3278684
https://doi.org/10.1145/3278681.3278684
Publikováno v:
South African Journal of Communication Disorders, Volume: 65, Issue: 1, Pages: 1-8, Published: 2018
South African Journal of Communication Disorders, Vol 65, Iss 1, Pp e1-e8 (2018)
The South African Journal of Communication Disorders
South African Journal of Communication Disorders, Vol 65, Iss 1, Pp e1-e8 (2018)
The South African Journal of Communication Disorders
Background: Children who enter school with limited vocabulary knowledge are at risk for reading failure. This study investigated the efficacy of an interactive e-book, implemented as a mobile application, to facilitate vocabulary learning in Grade 1
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a6d8af8dc2f672a98c37b8e49d278b1f
http://www.scielo.org.za/scielo.php?script=sci_arttext&pid=S2225-47652018000100019&lng=en&tlng=en
http://www.scielo.org.za/scielo.php?script=sci_arttext&pid=S2225-47652018000100019&lng=en&tlng=en
Autor:
Laurette Marais, Lynette van Zijl
Publikováno v:
Lecture Notes in Computer Science
19th International Conference on Descriptional Complexity of Formal Systems (DCFS)
19th International Conference on Descriptional Complexity of Formal Systems (DCFS), Jul 2017, Milano, Italy. pp.250-261, ⟨10.1007/978-3-319-60252-3_20⟩
Descriptional Complexity of Formal Systems ISBN: 9783319602516
DCFS
19th International Conference on Descriptional Complexity of Formal Systems (DCFS)
19th International Conference on Descriptional Complexity of Formal Systems (DCFS), Jul 2017, Milano, Italy. pp.250-261, ⟨10.1007/978-3-319-60252-3_20⟩
Descriptional Complexity of Formal Systems ISBN: 9783319602516
DCFS
Part 2: Contributed Papers; International audience; Unary self-verifying symmetric difference automata were introduced in [1], with an upper bound of $O(2^{n})$ and lower bound of $2^{n-1}-1$ for state complexity. Implicit in the interpretation of se
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::dd6202d5eab1a5ea0d99c0a44473ce80
https://hal.inria.fr/hal-01657002
https://hal.inria.fr/hal-01657002
Autor:
Lynette van Zijl, Laurette Marais
Publikováno v:
Lecture Notes in Computer Science
18th International Workshop on Descriptional Complexity of Formal Systems (DCFS)
18th International Workshop on Descriptional Complexity of Formal Systems (DCFS), Jul 2016, Bucharest, Romania. pp.180-191, ⟨10.1007/978-3-319-41114-9_14⟩
Descriptional Complexity of Formal Systems ISBN: 9783319411132
DCFS
18th International Workshop on Descriptional Complexity of Formal Systems (DCFS)
18th International Workshop on Descriptional Complexity of Formal Systems (DCFS), Jul 2016, Bucharest, Romania. pp.180-191, ⟨10.1007/978-3-319-41114-9_14⟩
Descriptional Complexity of Formal Systems ISBN: 9783319411132
DCFS
International audience; We investigate self-verifying nondeterministic finite automata, in the case of unary symmetric difference nondeterministic finite automata (SV-XNFA). We show that there is a family of languages $$\mathcal {L}_{n\ge 2}$$ which
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1d7bcdb3bb49fd904861df67b4d0129e
https://hal.inria.fr/hal-01633957/file/416473_1_En_14_Chapter.pdf
https://hal.inria.fr/hal-01633957/file/416473_1_En_14_Chapter.pdf