Discover @AndreMacielSousa Open Source projects

André Maciel Sousa (@AndreMacielSousa)

AndreMacielSousa

Stars
11
Global Rank 920,445 (Top 32 %)
Followers 8
Following 29
Registered over 6 years ago
Most used languages

JavaScript
33.3 %

CSS
16.7 %

Python
16.7 %

Vue 16.7 %

HTML
16.7 %
Location 🇵🇹 Portugal
Country Total Rank 3,163
Country Ranking

Vue 217

CSS
567

HTML
845

JavaScript
1,068

Python
1,949

UAbALL

The "Automata Learning Lab da Universidade Aberta (UAbALL)" strives to be an integrated laboratory for simulation of Automata. A first phase focused on building the base and introducing the Simulation of Deterministic Finite Automata (DFA). This Laboratory intends to enjoy the capacity of extensibility and adaptability, being this document a technical and scientific basis for the future production of the remaining components, as well as adapted to new technological realities and distribution platforms.

animalec

Animalec - Desenvovimento Avançado para a WEB

mini-proj1

A tarefa 2.2 corresponde ao primeiro desenvolvimento web da unidade curricular. Esta programação pretende verificar os conhecimentos anteriores relativos à construção de uma página HTML básica, com o acrescido do conceitos de Single Page Application (SPA).

Python-1st-steps

Phyton 1s stesps

tarefa_3.1

Programação Web Avançada | Tarefa 3.1 inclusão das duas novas entidades sponsors e experts na plataforma através da realização dos conceitos de prototipagem: wireframes, mockups e protótipos

Regex-UAbALL

Regular languages constitute the class of languages with less power of representation, and it is possible to develop recognition algorithms, with several applications, such as lexical analysis, animation systems, hypertexts, and hypermedia (Menezes, 2000). Regular languages can be presented by a finite automaton and a Regular Expression (REGEX). REGEX - Regular Expressions - a sequential way to specify a regular language, through a pattern of Strings that explains the same that can be described by a finite automaton. An example, in UNIX notation of a REGEX “[A-Z] [a-z] * [] [A-Z] [A-Z]” represents a word beginning with a capital letter, followed by a space and two capital letters, in which the sequence “Porto PT” would be accepted.