Skip to content

Sections

Maps Timeline Graph Cosmos Life Culture Innovation People Climate Trends Art

© 2026 Vinony · Knowledge from Wikipedia, Wikidata, and 27 public APIs.

recursively enumerable language · Vinony

EntityQ1073063· pop 19· linked from 93 articles

recursively enumerable language

Sign in to save

a formal language that can be output (enumerated) by an algorithm (mathematical logic, computability theory)

Connections

regular language

recursively enumerable set

computer science

International Standard Book Number

formal language

finite-state machine

automata theory

Chomsky hierarchy

Categories

Alan Turing Formal languages Mathematics of computing Theory of computation

Sources

wikipedia.externallinksexternallink

Similar entities

Discovered by embedding cosine similarity (sentence-transformers MiniLM, 384-dim).

Entscheidungsproblem

Entitydist 0.43

well-formed formula

Entitydist 0.46

Entitydist 0.56

Entitydist 0.56

Entitydist 0.57

Markov algorithm

Entitydist 0.57

Entitydist 0.57

Entitydist 0.57

polysynthetic language

Entitydist 0.62

intelligibility

Entitydist 0.63

Alternating finite automaton

Entitydist 0.63

Entitydist 0.64

What links here93 pages

automata theory

string

Entity

theory of computation

deterministic finite automata

nondeterministic finite automaton

pushdown automaton

context-sensitive grammar

Chomsky hierarchy

Büchi automaton

context-sensitive language

generative grammar

regular expression

regular language

deterministic context-free grammar

complexity class

finite-state machine

universal Turing machine

Kuroda normal form

Indexed grammar