The following pages link to (Q3644388):
Displayed 50 items.
- Computing maximal Kleene closures that are embeddable in a given subword-closed language (Q256709) (← links)
- Algorithmic aspects of decomposition and equivalence of finite-valued transducers (Q259883) (← links)
- Using finite transducers for describing and synthesising structural time-series constraints (Q265697) (← links)
- Two function algebras defining functions in \(\mathsf{NC}^k\) Boolean circuits (Q276257) (← links)
- Topological abstraction of higher-dimensional automata (Q278749) (← links)
- The universal fuzzy automaton (Q279373) (← links)
- Brzozowski type determinization for fuzzy automata (Q279377) (← links)
- Automata, reduced words and Garside shadows in Coxeter groups. (Q279744) (← links)
- On the star-height of subword counting languages and their relationship to Rees zero-matrix semigroups (Q329726) (← links)
- Rational digit systems over finite fields and Christol's theorem (Q331134) (← links)
- Free inductive \(K\)-semialgebras (Q383784) (← links)
- Sofic tree-shifts (Q385506) (← links)
- Expressiveness and static analysis of extended conjunctive regular path queries (Q389234) (← links)
- Asymptotic expansions for linear homogeneous divide-and-conquer recurrences: algebraic and analytic approaches collated (Q401474) (← links)
- Free iterative and iteration \(K\)-semialgebras (Q412016) (← links)
- Primitive matrices over polynomial semirings (Q417493) (← links)
- Translating regular expression matching into transducers (Q420836) (← links)
- Bisimulations for fuzzy automata (Q423147) (← links)
- Finiteness results for subgroups of finite extensions. (Q479771) (← links)
- Normality and automata (Q494059) (← links)
- Language-theoretic problems in certain matrix monoids (Q496056) (← links)
- The dual equivalence of equations and coequations for automata (Q498397) (← links)
- Ordering sequences by permutation transducers (Q505039) (← links)
- Deciding game invariance (Q515578) (← links)
- An Hadamard operation on rational relations (Q517036) (← links)
- Set systems: order types, continuous nondeterministic deformations, and quasi-orders (Q653312) (← links)
- Redundancy of minimal weight expansions in Pisot bases (Q653321) (← links)
- Rational relations having a rational trace on each finite intersection of rational relations (Q714813) (← links)
- Diameter and stationary distribution of random \(r\)-out digraphs (Q785578) (← links)
- Nondeterministic automata: equivalence, bisimulations, and uniform relations (Q903611) (← links)
- Synchronizing relations on words (Q905682) (← links)
- Crystal monoids \& crystal bases: rewriting systems and biautomatic structures for plactic monoids of types \(A_{n}\), \(B_{n}\), \(C_{n}\), \(D_{n}\), and \(G_{2}\) (Q1633382) (← links)
- On fixed points of rational transductions (Q1637233) (← links)
- The \(\kappa\)-word problem over \(\mathsf{DRH}\) (Q1676315) (← links)
- Transducer descriptions of DNA code properties and undecidability of antimorphic problems (Q1706156) (← links)
- Efficient algorithms for computing the inner edit distance of a regular language via transducers (Q1712004) (← links)
- Algebraic state space approach to model and control combined automata (Q1712571) (← links)
- Copyless cost-register automata: structure, expressiveness, and closure properties (Q1740663) (← links)
- Coalgebraic minimization of automata by initiality and finality (Q1744392) (← links)
- Tree-shifts of finite type (Q1758160) (← links)
- Finite-state independence (Q1787949) (← links)
- On deterministic weighted automata (Q1799611) (← links)
- Joint spectral radius, dilation equations, and asymptotic behavior of radix-rational sequences (Q1938671) (← links)
- On the supports of recognizable series over a field and a single letter alphabet (Q1944212) (← links)
- Relationships between bounded languages, counter machines, finite-index grammars, ambiguity, and commutative regularity (Q1998865) (← links)
- Colored operads, series on colored operads, and combinatorial generating systems (Q1999730) (← links)
- A unifying approach to algebraic systems over semirings (Q2000006) (← links)
- Formalizing a fragment of combinatorics on words (Q2011632) (← links)
- Robustness of Pisot-regular sequences (Q2020014) (← links)
- A geometric and combinatorial exploration of Hochschild lattices (Q2034061) (← links)