The following pages link to (Q4079524):
Displaying 50 items.
- Automatic congruences for diagonals of rational functions (Q259509) (← links)
- Varieties and covarieties of languages (extended abstract) (Q265785) (← links)
- Automata-theoretic semantics of idealized Algol with passive expressions (Q265826) (← links)
- Smooth finitely computable functions are affine, or why quantum systems cause waves (Q265933) (← links)
- Identifying all preorders on the subdistribution monad (Q283773) (← links)
- Hyperquadratic continued fractions and automatic sequences (Q285457) (← links)
- Noncommutative minimization algorithms (Q287255) (← links)
- On syntactic nuclei of rational languages (Q293361) (← links)
- On the star-height of subword counting languages and their relationship to Rees zero-matrix semigroups (Q329726) (← links)
- Finding all solutions of equations in free groups and monoids with involution (Q342722) (← links)
- Determinization of ordinal automata (Q383176) (← links)
- Free inductive \(K\)-semialgebras (Q383784) (← links)
- The tensor product of function semimodules. (Q387619) (← links)
- Weighted finite automata over hemirings (Q388788) (← links)
- Path sets in one-sided symbolic dynamics (Q402586) (← links)
- On factors of synchronized sequences (Q410714) (← links)
- Free iterative and iteration \(K\)-semialgebras (Q412016) (← links)
- An inner product space on irreducible and synchronizable probabilistic finite state automata (Q415553) (← links)
- Coping with selfish on-going behaviors (Q418112) (← links)
- On algebra of languages representable by vertex-labeled graphs (Q418730) (← links)
- Automata theory based on lattice-ordered semirings (Q422445) (← links)
- Another approach to the equivalence of measure-many one-way quantum finite automata and its application (Q439940) (← links)
- Extremal minimality conditions on automata (Q441884) (← links)
- Geometrically minimal realizations of Boolean controlled systems (Q463351) (← links)
- Which security policies are enforceable by runtime monitors? A survey (Q465692) (← links)
- Comments on the height reducing property. II (Q475564) (← links)
- On the Fibonacci-Mandelbrot set (Q475585) (← links)
- Stochastic adding machine and 2-dimensional Julia sets (Q476612) (← links)
- On the commutative equivalence of semi-linear sets of \(\mathbb{N}^k\) (Q476895) (← links)
- A characterization of \(p\)-automatic sequences as columns of linear cellular automata (Q477771) (← links)
- Budget-bounded model-checking pushdown systems (Q479843) (← links)
- On the digits of shifted primes (Q481389) (← links)
- The dual equivalence of equations and coequations for automata (Q498397) (← links)
- A canonical automaton for one-rule length-preserving string rewrite systems (Q498407) (← links)
- On the 2-abelian complexity of the Thue-Morse word (Q501000) (← links)
- Multi-weighted automata and MSO logic (Q504993) (← links)
- Counting the number of non-zero coefficients in rows of generalized Pascal triangles (Q512556) (← links)
- On certain recurrent and automatic sequences in finite fields (Q515591) (← links)
- Weighted automata and logics for infinite nested words (Q515684) (← links)
- On the decomposition of prefix codes (Q517038) (← links)
- The pro-nilpotent group topology on a free group (Q524486) (← links)
- Deciding word neighborhood with universal neighborhood automata (Q533878) (← links)
- The dual geometry of Boolean semirings (Q535089) (← links)
- La reconnaissance des facteurs d'un mot dans un texte (Q580994) (← links)
- Presentations of inverse monoids (Q582399) (← links)
- Automata on infinite objects and their applications to logic and programming (Q582913) (← links)
- A remark on the representation of trace monoids (Q584429) (← links)
- On groups whose word problem is solved by a counter automaton. (Q596085) (← links)
- Real numbers having ultimately periodic representations in abstract numeration systems (Q598243) (← links)
- Families of recognizable sets corresponding to certain varieties of finite monoids (Q599182) (← links)
