• skip to content

Datacadamia - Data and Co

User Tools

  • Log In

Site Tools

  • Media Manager
  • Recent Pages Visited
  • Sitemap
You are here: Datacadamia - data all the way » What is an Automaton? State Machine » Automata - Finite Automata
Trace:

automata:finite

This is a list of pages that seem to link back to the current page.

  • What is an Automaton? State Machine
  • Automata - Deterministic finite-state automata (DFA)
  • Automata - Nondeterministic automata (NFA)
  • (Business) Process (BP) - Procedure
  • Algorithm
  • Grammar - Hierarchy of grammar (Chomsky)
  • What is a Lexer ? known also as Tokenizer or Scanner - Lexical Analysis
  • token
  • regular
  • Data Processing - (Pipeline | Compose | Chain)
  • (Network|Graph) - Finite
  • structure
  • regexp
  • Natural Language - Crawler
  • lifecycle
  • What is a protocol?
  • toggle
automata/finite.txt · Last modified: 2024/08/30 10:08 by 127.0.0.1

Page Tools

  • Show page
  • Old revisions
  • Backlinks
  • Back to top
Except where otherwise noted, content on this wiki is licensed under the following license: CC Attribution-Noncommercial-Share Alike 4.0 International
CC Attribution-Noncommercial-Share Alike 4.0 International Donate Powered by PHP Valid HTML5 Valid CSS Driven by DokuWiki