Tags
- 3D printing
- A
- Abstract machine
- An
- Applicative
- Automata theory
- Backus–Naur form
- Bound and unbound morphemes
- Carnegie Mellon University
- Chicago Transit Authority
- Chomsky hierarchy
- Closure
- Complement
- Computational Linguistics
- Concatenation
- Context free
- Context-free grammar
- Context-free language
- Context-sensitive language
- D
- Decider
- Decision problem
- Definite clause grammar
- Deterministic context-free grammar
- Deterministic pushdown automaton
- DOI
- Effect
- Embedded pushdown automaton
- Empty string
- Finite-state machine
- Flip-flop
- Flip-flops
- Flop
- Flops
- Formal grammar
- Formal language
- Freeform
- Free jazz
- Free verse
- Functor
- Grammar
- Graph rewriting
- Haskell
- Information and Computation
- International Standard Book Number
- Intersection
- Jeffrey Ullman
- John Hopcroft
- Kleene star
- Linear bounded automaton
- M
- Martin Davis
- Mathematical proof
- Monoid
- Musical form
- Natural language
- Need
- No
- Noam Chomsky
- Open problem
- Presentation
- Production
- Pushdown automaton
- P versus NP problem
- Recursive grammar
- Recursive language
- Recursively enumerable language
- Recursively enumerable set
- Reducer
- Regular grammar
- Regular language
- Restaurants and bars
- Result
- Scrambling
- Semantics
- Something
- String operations
- Subset
- Terminal and nonterminal symbols
- Test case
- The Computer Journal
- This week
- Tree-adjoining grammar
- True quantified Boolean formula
- Turing machine
- Undecidable problem
- Union
- V
- Visual programming language
- Weak equivalence