Zobrazeno 1 - 10
of 29
pro vyhledávání: '"Lynette van Zijl"'
Publikováno v:
Journal of Universal Computer Science, Vol 29, Iss 2, Pp 100-117 (2023)
A bordered box repetition-free word is a finite word w where any given factor of the form asa, with a ∈ Σ and s ∈ Σ∗, occurs at most once. Four existing search algorithms are adapted to search for long bordered box repetition-free words over
Externí odkaz:
https://doaj.org/article/c8ab3f0e2aad45a4b20951da5e126a91
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
Autor:
Caleb Zeeman, Lynette van Zijl
Publikováno v:
Advances in Intelligent Systems and Computing ISBN: 9789811905414
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::70bac0b1741f612cfcf11149f88e34ca
https://doi.org/10.1007/978-981-19-0542-1_5
https://doi.org/10.1007/978-981-19-0542-1_5
Publikováno v:
African Journal of Wildlife Research. 50
Two improvements on the automated image recognition of individual leopards (Panthera pardus) are presented. Firstly, a new method of automated segmentation on images, with a guaranteed side view of the animal, allows for a region of interest to be ca
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
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
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
Autor:
Lynette van Zijl
Publikováno v:
ACM SIGACCESS Accessibility and Computing. :43-46
First world support systems are not always available to, or affordble for, South Africans with assistive requirements. Our group focuses on persons with communication needs, such as persons with sight, hearing or autism barriers.
Publikováno v:
2015 Pattern Recognition Association of South Africa and Robotics and Mechatronics International Conference (PRASA-RobMech).
Graphical models provide a flexible framework for capturing probabilistic relationships between large numbers of variables. Because of this flexibility, researchers usually compare a number of possible model topologies and parameter settings for thei