Skip to content

Latest commit

 

History

History
74 lines (45 loc) · 3.29 KB

README.md

File metadata and controls

74 lines (45 loc) · 3.29 KB
Raw

C++ A to Z

Hangul Automata

Example code for understanding *automata

*Automata: A field of computer science that academically approaches abstract machines capable of computation and the problems that can be solved using these machines.

This example code demonstrates a simple implementation of a Hangul (Korean characters) Automata. An automaton (plural: automata) in computer science is an abstract machine that can be in one of a finite number of states. The machine can change from one state to another in response to some external inputs. This concept is used in designing software and hardware systems of various complexity levels, such as compilers, digital circuits, and artificial intelligence algorithms.

The Hangul Automata illustrated in this example is designed to recognize patterns within a given set of Korean text inputs. It categorizes characters into consonants (J), vowels (M), and other characters (O) based on their roles in forming Korean syllables. Through this process, the automaton can perform tasks such as parsing input text, identifying syllable boundaries, or even checking for valid Korean words or phrases. This type of automaton can be particularly useful in applications involving natural language processing (NLP), text analysis, and educational tools designed to assist in learning the Korean language.

The key concepts demonstrated in this code include:

  • State Transitions: How the automaton moves from one state to another based on the input character's classification (consonant, vowel, or other).
  • Pattern Recognition: The ability to recognize specific sequences of characters that form valid Korean syllables.
  • Input Processing: Taking a series of characters as input and processing them through the automaton to produce a meaningful output.

This example serves as a basic introduction to the principles of automata theory and its application in computational linguistics and language processing. It showcases how automata can be constructed to process and analyze text in specific languages, providing insights into the fundamental mechanisms behind more complex language processing systems.



C++ STL Programming

Operator Overloading

  • 01_intPlus.cpp
  • 04_PlusOperatorDefine.cpp
  • 06_PlusOperatorFuncion.cpp
  • 08_PlusPlusOperation.cpp
  • 09_'--'OperationOverloading.cpp
  • 10_'=='OperationOverloading.cpp
  • 11_'!='OperationOverloading.cpp
  • 12_MemberFunctionOP'-'Overloading.cpp
  • 13_GlobalFunctionOP'-'Overloading.cpp
  • 14_PrintINT.cpp
  • 15_FuncOverloading.cpp
  • 16_ArrayIndexOperOverloading.cpp
  • 17_INTSavingArray.cpp


C++ Socket Test

This project is dedicated to demonstrating practical applications of C++ socket programming for network communications. It includes examples of setting up a basic client-server architecture, where the server listens for connections on a specified port, and the client connects to the server to exchange messages.

  • Server
  • Client


Beginning C++17 From Novice to Professional

1. Basic Ideas

2. Introducting Functional Type of Data

3. Working with Fundamental Data Types

4. Making Decisions

5. Arrays and Loops

6. Pointers and References

7. Working with Classes

8. Defining Functions