BLOG 1 | Introduction

Introduction 

Hello!!!!☺️ 

This is me!!

My name is Yoma!  I am super excited to start this blogging journey with you all!!😄

 

Here's a little self introduction!!!🤭

My favourite drinks are Matcha and Boba Tea 🧋

and I like eating Bubble Waffles!!😋

OSAKA, JAPAN

I'm in love with Japanese culture 🏯 and I am currently studying the language! とてもエキサイティングです! (～￣▽￣)～  (It's very exciting)

I've also always wanted to ride a Vespa across Italy🛵, it's been a dream of mine!!

The Previous Blog I Liked

Regarding the blogs of all the previous year, they were all AMAZING!! but the one that caught my eye in particular was the AirFishBowl, because it seemed so cool to see a fish float and move around in the air. It looked like an aquarium but with fish in the air instead.😄

More about that blog can be seen throught this link: AirFishBowl

BINBOT Project 

For our current project the BINBOT!! here are a few ideas that stood out to me as I was serfing through the internet. I found a really cool idea from the video and I think it could be a cool addition to the project! 😄
The bin could automaticlly catch the rubbish no matter the distance. If the rubbish is thrown, the bin should be able to catch it, or if it was dropped the binbot would reach the rubbish before it get dropped. A link to my inspo is down below!!

Trash catching bin

Cute desk bin saying "Thank you ^_^ "

I also believe we could have an automatic lid that detect's rubbish and open's up when the rubbish is near. That would be so cool!! 

History of State Machines 

A finite-state machine (FSM), also known as a finite automaton, is an abstract computational model consisting of a finite set of states, an input alphabet, a transition function that maps states and inputs to next states, a start state, and a set of accepting states. 

It processes input strings sequentially, changing states based on each symbol, and accepts the string if it ends in an accepting state, thereby recognizing languages in the Chomsky hierarchy's regular class    

The origins of finite-state machines trace back to early 20th-century efforts in modeling neural activity and logical computation. In 1943, Warren McCulloch and Walter Pitts proposed finite automata as a simplified model of neural networks in their paper "A Logical Calculus of the Ideas Immanent in Nervous Activity," laying foundational work for cybernetics and automata theory. 

The concept was formalized in computer science during the 1950s, with George H. Mealy and Edward F. Moore independently developing output-producing variants in 1955–1956, known as Mealy and Moore machines, which extend basic FSMs to produce outputs alongside state transitions. Michael O. Rabin and Dana Scott provided a rigorous mathematical framework in 1959, proving the equivalence between deterministic finite automata and nondeterministic ones, earning them the 1976 Turing Award for contributions to automata theory. 

History of state Machine

First Ever State Machine!!

Last week I created my first ever state machine, it was so fun! The state machine is based on a DRS which they use often in Formula One (F1) races. 

State 1

At the begining of the stste machine the DRS is INACTIVE, and then the idea was that if the car is less than 50m than the other car the DRS LED signal would go blue and a beep would signal the driver inthier headset that the DRS was ready for use (READY). 

State 2

If the DSR is not used and the car is more than 50m away from the car in front, there would be a WARNING period of 5 second to alert the driver and the LED would go red, if the 5 second wait is up, it would go straight to PAUSE and back to INACTIVE after 5 second of pause or if the driver presses the button before the timout is over, the LED would go green and then  after the DRS is over it goes to PAUSE after a 5 second timer, the LED turns orange . 

State 3

If the driver picked up speed again and is less than 50m the LED would go blue once again in it's ready position. Once the button is pressed the DRS is used. 

DRS State Machine

That's the end of my first blog.

Talk to you next time!!