The following pages link to Emanuele Rodaro (Q305763):
Displayed 50 items.
- Undecidability of the word problem for Yamamura's HNN-extension under nice conditions. (Q305764) (← links)
- Ideal regular languages and strongly connected synchronizing automata (Q329728) (← links)
- Fixed points of endomorphisms of trace monoids. (Q467531) (← links)
- \(E\omega\)-Clifford congruences and \(E\omega\)-\(E\)-reflexive congruences on an inverse semigroup. (Q535236) (← links)
- Synchronizing automata with finitely many minimal synchronizing words (Q553327) (← links)
- On the structure theory of partial automaton semigroups (Q786010) (← links)
- Decidability of the word problem in Yamamura's HNN extensions of finite inverse semigroups. (Q958188) (← links)
- Strongly connected synchronizing automata and the language of minimal reset words (Q1637601) (← links)
- Equalizers and kernels in categories of monoids (Q1702518) (← links)
- (Q1758226) (redirect page) (← links)
- Amalgams of finite inverse semigroups and deterministic context-free languages. (Q1758227) (← links)
- A bound for the length of the shortest reset words for semisimple synchronizing automata via the packing number (Q2011387) (← links)
- Corrigendum to: ``Automaton semigroups and groups: on the undecidability of problems related to freeness and finiteness'' (Q2130510) (← links)
- Automaton semigroups and groups: on the undecidability of problems related to freeness and finiteness (Q2190041) (← links)
- Circular automata synchronize with high probability (Q2221830) (← links)
- A geometric approach to (semi)-groups defined by automata via dual transducers. (Q2256271) (← links)
- Orbit expandability of automaton semigroups and groups (Q2290646) (← links)
- Infinite automaton semigroups and groups have infinite orbits (Q2306651) (← links)
- Maximal subgroups of amalgams of finite inverse semigroups. (Q2350945) (← links)
- On the complexity of the word problem for automaton semigroups and automaton groups (Q2363312) (← links)
- Amalgams of inverse semigroups and reversible two-counter machines. (Q2376520) (← links)
- Freeness of automaton groups vs boundary dynamics (Q2629888) (← links)
- On a class of poly-context-free groups generated by automata (Q2700958) (← links)
- The Lamplighter Group ℤ<sub>3</sub>≀ℤ Generated by a Bireversible Automaton (Q2827247) (← links)
- Regular Ideal Languages and Synchronizing Automata (Q2849990) (← links)
- Fixed points of endomorphisms of graph groups (Q2869865) (← links)
- STATE COMPLEXITY OF CODE OPERATORS (Q2909103) (← links)
- Groups and semigroups defined by colorings of synchronizing automata (Q2934265) (← links)
- MULTILINEAR EQUATIONS IN AMALGAMS OF FINITE INVERSE SEMIGROUPS (Q2996838) (← links)
- Recognizing Synchronizing Automata with Finitely Many Minimal Synchronizing Words is PSPACE-Complete (Q3091460) (← links)
- Amalgams vs Yamamura's HNN-Extensions of Inverse Semigroups (Q3094735) (← links)
- Representation of (Left) Ideal Regular Languages by Synchronizing Automata (Q3194726) (← links)
- Decidability Versus Undecidability of the Word Problem in Amalgams of Inverse Semigroups (Q3449708) (← links)
- BICYCLIC SUBSEMIGROUPS IN AMALGAMS OF FINITE INVERSE SEMIGROUPS (Q3552317) (← links)
- State Complexity of Prefix, Suffix, Bifix and Infix Operators on Regular Languages (Q3584908) (← links)
- Finitely Generated Synchronizing Automata (Q3618621) (← links)
- Trim Strongly Connected Synchronizing Automata and Ideal Languages (Q4686535) (← links)
- (Q5091811) (← links)
- Fragile words and Cayley type transducers (Q5124053) (← links)
- Catalan fragile words (Q5124346) (← links)
- Graph automaton groups (Q5154177) (← links)
- Never Minimal Automata and the Rainbow Bipartite Subgraph Problem (Q5199981) (← links)
- Missing factors of ideals and synchronizing automata (Q5208374) (← links)
- Boundary dynamics for bireversible and for contracting automaton groups (Q5221286) (← links)
- Context-freeness of the languages of Schützenberger automata of HNN-extensions of finite inverse semigroups (Q5279227) (← links)
- (Q5306172) (← links)
- ON PERIODIC POINTS OF FREE INVERSE MONOID HOMOMORPHISMS (Q5411785) (← links)
- Mortality Problem for 2×2 Integer Matrices (Q5448666) (← links)
- (Q5475631) (← links)
- Semisimple Synchronizing Automata and the Wedderburn-Artin Theory (Q5890812) (← links)