Autómata Finito Determinista

dc.creatorDíaz Iruegas, Crsitian Arturo
dc.date.accessioned2013-11-19T18:31:10Z
dc.date.accessioned2023-07-19T14:06:59Z
dc.date.available2013-11-19T18:31:10Z
dc.date.available2023-07-19T14:06:59Z
dc.date.created2013-11-19T18:31:10Z
dc.date.issued2011-07
dc.identifierhttp://repository.uaeh.edu.mx/bitstream/handle/123456789/14471
dc.identifier.urihttps://repositorioslatinoamericanos.uchile.cl/handle/2250/7705671
dc.description.abstractThe following document talks about the use of deterministic finite automaton (which are part of regular languages) which are abstractions of machines, without taking into account either the shape of machinery, not its size but also focuses on understanding how work, capturing only the aspects related to the sequence of events that occur.
dc.languagees
dc.subjectResearch Subject Categories::SOCIAL SCIENCES::Statistics, computer and systems science::Informatics, computer and systems science::Information and language technology
dc.titleAutómata Finito Determinista
dc.typePresentation


Este ítem pertenece a la siguiente institución