Notes in Chapter 1 Regular Languages

To Subscribe, use this Key

Status	Last Update	Fields
Published	03/16/2025	computational model
Published	03/16/2025	Finite state machine or finite automaton
Published	03/16/2025	Create a state diagram for an automatic door controller
Published	03/16/2025	Create a transition table for an automatic door controller.
Published	03/16/2025	Give an example of a state diagram.
Published	03/16/2025	The circles in the state diagram are...
Published	03/16/2025	The double circle is...
Published	03/16/2025	The arrow point from nowhere represents the...
Published	03/16/2025	The arrows from one state to another represent...
Published	03/16/2025	The output for a state diagram is...
Published	03/16/2025	__ defines the rules for moving from one state to the next.
Published	03/16/2025	Give the formal defintions of finite automaton.
Published	03/16/2025	Use the formal definition of finite automaton to describe this
Published	03/16/2025	If A is the set of all strings that machine M accepts, we say that...
Published	03/16/2025	Give the diagram of the finite automaton and its state diagram.L(M2)={w\| w ends in a 1}
Published	03/16/2025	Give the formal definition of a regular language.
Published	03/16/2025	Create a finite automaton that accepts a string with an odd numer of 1s
Published	03/16/2025	Create a finite automaton that accepts all strings containing 001
Published	03/16/2025	Give the formal definitions for the regular operations union, concatenation, and star.
Published	03/16/2025	Give the union, concatenation, and star for the following example
Published	03/16/2025	The star operation is a...
Published	03/16/2025	Theorem 1.25 in finite automata
Published	03/16/2025	Theorem 1.26 finite automatat
Status	Last Update	Fields