I'm looking for a reference rather than an answer. I think I'm just not Googling the right combination of terms. I imagine that there is a class of graphs which is equivalent to some class of languages via some transformation (acceptance?). I'd like to know more about this, but can't seem to find much.
2026-03-29 04:09:55.1774757395
Graph and language/automaton equivalence
128 Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
1
There are 1 best solutions below
Related Questions in GRAPH-THEORY
- characterisation of $2$-connected graphs with no even cycles
- Explanation for the static degree sort algorithm of Deo et al.
- A certain partition of 28
- decomposing a graph in connected components
- Is it true that if a graph is bipartite iff it is class 1 (edge-coloring)?
- Fake induction, can't find flaw, every graph with zero edges is connected
- Triangle-free graph where every pair of nonadjacent vertices has exactly two common neighbors
- Inequality on degrees implies perfect matching
- Proving that no two teams in a tournament win same number of games
- Proving that we can divide a graph to two graphs which induced subgraph is connected on vertices of each one
Related Questions in FORMAL-LANGUAGES
- Simultaneously multiple copies of each of a set of substrings of a string.
- Do these special substring sets form a matroid?
- Exitstance of DPA of L = $\{ww^r\}$
- Automata defined by group presentations.
- Constructing context free grammar with a number constraint to one of the elements in the language
- Converting CFG to a regular expression
- CSG for the language $\{a^{n^2}|n>0\}$
- If true, prove (01+0)*0 = 0(10+0)*, else provide a counter example.
- Proof of "Extension" for Rice's Theorem
- Prove that this sentence is a tautology.
Related Questions in AUTOMATA
- Exitstance of DPA of L = $\{ww^r\}$
- Automata defined by group presentations.
- How to prove convergence of a sequence of binary numbers
- A finite automaton that accepts at least three $a$s and at least two $b$s.
- Is my DFA correct?
- Intersection of two languages (Formal Languages and Automata Theory)
- Is there any universal algorithm converting grammar to Turing Machine?
- Build a Context-Free Grammar for a given language
- Prove that $B = B ^+$ iff $BB \subseteq B$
- Proving a Language is Regular via Automata
Related Questions in REGULAR-LANGUAGE
- Converting CFG to a regular expression
- How to approach regular languages using the pumping lemma?
- How to prove by induction that a string is a member of a recursively defined language?
- Formally expressing regular expression
- Deciding wether a language is regular, in the arithmetic hierarchy
- How to derive the set notation from regular expressions?
- Given language, say if it is regular, context-free and proove it.
- Given L1 is regular language and L1△L2 is regular is L2 regular?
- Proving a Language is Regular via Automata
- How to prove that a transformed language is regular using an NFA
Related Questions in ALGEBRAIC-GRAPH-THEORY
- Normalized Laplacian eigenvalues of a path graph
- Can i consider ($\emptyset, \infty, \emptyset$) to denote a null graph?
- number of edges in infinite graph
- 2-fold covers of graphs, their spectrum and the matching polynomial
- Is the following fact for laplace matrix true? And how to prove it?
- Automorphisms of cospectral k-regular graphs
- Understanding Generalised Quadrangles
- For any sets $X$ & $Y$ can the group of automorphisms for the digraph $G(X,Y)=(X\cup Y,X\times Y)$ be express in terms of symmetric groups?
- Proof that bipartite graph has perfect matching if and only if zero sub-matrix is not included
- Convergence of function with matrix as input
Trending Questions
- Induction on the number of equations
- How to convince a math teacher of this simple and obvious fact?
- Find $E[XY|Y+Z=1 ]$
- Refuting the Anti-Cantor Cranks
- What are imaginary numbers?
- Determine the adjoint of $\tilde Q(x)$ for $\tilde Q(x)u:=(Qu)(x)$ where $Q:U→L^2(Ω,ℝ^d$ is a Hilbert-Schmidt operator and $U$ is a Hilbert space
- Why does this innovative method of subtraction from a third grader always work?
- How do we know that the number $1$ is not equal to the number $-1$?
- What are the Implications of having VΩ as a model for a theory?
- Defining a Galois Field based on primitive element versus polynomial?
- Can't find the relationship between two columns of numbers. Please Help
- Is computer science a branch of mathematics?
- Is there a bijection of $\mathbb{R}^n$ with itself such that the forward map is connected but the inverse is not?
- Identification of a quadrilateral as a trapezoid, rectangle, or square
- Generator of inertia group in function field extension
Popular # Hahtags
second-order-logic
numerical-methods
puzzle
logic
probability
number-theory
winding-number
real-analysis
integration
calculus
complex-analysis
sequences-and-series
proof-writing
set-theory
functions
homotopy-theory
elementary-number-theory
ordinary-differential-equations
circles
derivatives
game-theory
definite-integrals
elementary-set-theory
limits
multivariable-calculus
geometry
algebraic-number-theory
proof-verification
partial-derivative
algebra-precalculus
Popular Questions
- What is the integral of 1/x?
- How many squares actually ARE in this picture? Is this a trick question with no right answer?
- Is a matrix multiplied with its transpose something special?
- What is the difference between independent and mutually exclusive events?
- Visually stunning math concepts which are easy to explain
- taylor series of $\ln(1+x)$?
- How to tell if a set of vectors spans a space?
- Calculus question taking derivative to find horizontal tangent line
- How to determine if a function is one-to-one?
- Determine if vectors are linearly independent
- What does it mean to have a determinant equal to zero?
- Is this Batman equation for real?
- How to find perpendicular vector to another vector?
- How to find mean and median from histogram
- How many sides does a circle have?
I guess you mean regular languages accepted by finite automata. Just Google one of these words: finite automaton, DFA, NFA, regular language or look at this question How to convert finite automata to regular expressions?
Edit. To answer your last remark, you might be interested in this paper, which heavily relies on Stone duality.