与男友交往不能说的秘密 这些秘密最好隐藏起来
Showing 50 items.
- Chomsky hierarchy (links | edit)
- Context-sensitive (links | edit)
- Context-sensitive grammar (links | edit)
- Context-free grammar (links | edit)
- Context-free language (links | edit)
- Finite-state machine (links | edit)
- Formal language (links | edit)
- Pushdown automaton (links | edit)
- Regular expression (links | edit)
- Regular language (links | edit)
- Regular grammar (links | edit)
- String (computer science) (links | edit)
- Turing machine (links | edit)
- Recursively enumerable language (links | edit)
- Tree automaton (links | edit)
- Index of computing articles (links | edit)
- Automata theory (links | edit)
- Collaborative writing (links | edit)
- Semantic analysis (compilers) (links | edit)
- Büchi automaton (links | edit)
- List of computability and complexity topics (links | edit)
- David Lewis (philosopher) (links | edit)
- Generative grammar (links | edit)
- Tree-adjoining grammar (links | edit)
- Deterministic finite automaton (links | edit)
- Nondeterministic finite automaton (links | edit)
- NSPACE (links | edit)
- List of formal language and literal string topics (links | edit)
- Contextualism (links | edit)
- Finite-state transducer (links | edit)
- Kuroda normal form (links | edit)
- Raku (programming language) (links | edit)
- Context sensitive language (redirect page) (links | edit)
- Language identification in the limit (links | edit)
- Decider (Turing machine) (links | edit)
- CSL (links | edit)
- Linear grammar (links | edit)
- Linear bounded automaton (links | edit)
- Berkeley Yacc (links | edit)
- Pumping lemma for regular languages (links | edit)
- Context-sensitive languages (redirect page) (links | edit)
- Semi-Thue system (links | edit)
- Bach language (redirect to section "Examples") (links | edit)
- Talk:Bach language (links | edit)
- User:Salix alba/maths/orphaned maths articles (links | edit)
- User:Wavelength/Sandbox 4/List of orphaned articles with character string "language" in title (links | edit)
- User:Gregbard/old watchlist (links | edit)
- User:Tule-hog/All Computing articles (links | edit)
- Wikipedia:Redirects for discussion/Log/2013 October 24 (links | edit)
- Pumping lemma for context-free languages (links | edit)
- Deterministic automaton (links | edit)
- Deterministic pushdown automaton (links | edit)
- Unrestricted grammar (links | edit)
- Star-free language (links | edit)
- Type 1 (links | edit)
- Recursive grammar (links | edit)