AndreMacielSousa/mini-proj1 AndreMacielSousa/mini-proj1

  • Stars
    star
    1
  • Language Vue
  • Created over 3 years ago
  • Updated over 3 years ago
Twitter logo Share LinkedIn logo Share Facebook logo Share
AndreMacielSousa/mini-proj1
github

AndreMacielSousa

Reviews

There are no reviews yet. Be the first to send feedback to the community and the maintainers!

Repository Details

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).

More Repositories

1

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.
JavaScript
4
star
2

animalec

Animalec - Desenvovimento Avançado para a WEB
JavaScript
2
star
3

Python-1st-steps

Phyton 1s stesps
Python
1
star
4

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
CSS
1
star
5

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.
HTML
1
star