EntityQ837528· pop 26· linked from 280 articlesdeterministic finite automataSign in to savefinite-state machine that accepts and rejects strings of symbols and only produces a unique computation (or run) of the automaton for each input stringConnections𝑛-tupleEntityKleene starEntitynondeterministic finite automatonEntityregular languageEntitystate transition systemEntityInternational Standard Book NumberEntityfunctionEntitysetEntitydigital object identifierEntitysequenceEntityTuring machineEntityQ180686EntitysubsetEntityregular expressionEntityJSTOROrganizationQ118398Entityformal languageEntityCambridge University PressEntityfunction compositionEntitymonoidEntityCategoriesFinite-state machines