The following pages link to (Q4692772):
Displaying 18 items.
- Deleting string rewriting systems preserve regularity (Q703575) (← links)
- The origins of combinatorics on words (Q872058) (← links)
- General varieties of tree languages (Q1275067) (← links)
- Monadic logic programs and functional complexity (Q1392280) (← links)
- The presence of lattice theory in discrete problems of mathematical social sciences. Why. (Q1414820) (← links)
- Series-parallel languages and the bounded-width property (Q1566734) (← links)
- Re-describing an algorithm by Hopcroft (Q1589443) (← links)
- The modernity of Dedekind's anticipations contained in \textit{What are numbers and what are they good for?} (Q1637277) (← links)
- Uniform and nonuniform recognizability. (Q1853746) (← links)
- Rationality in algebras with a series operation (Q1854484) (← links)
- On algebraic and logical specifications of classes of regular languages. (Q1874275) (← links)
- The lattices of closure systems, closure operators, and implicational systems on a finite set: A survey (Q1874537) (← links)
- Complexity results for prefix grammars (Q3025324) (← links)
- Weighted Tree Automata over Valuation Monoids and Their Characterization by Weighted Logics (Q3098032) (← links)
- The Reachability Problem over Infinite Graphs (Q3392937) (← links)
- (Q4866989) (← links)
- A congruence-based perspective on automata minimization algorithms (Q5092441) (← links)
- First-order logic on finite trees (Q5096727) (← links)
