Pages that link to "Item:Q2508978"
From MaRDI portal
The following pages link to Word problems recognisable by deterministic blind monoid automata (Q2508978):
Displaying 12 items.
- \(\mathcal C\)-graph automatic groups. (Q403809) (← links)
- Type-II conjecture is true for finite \(\mathcal J\)-trivial monoids (Q1204565) (← links)
- On the group memory complexity of extended finite automata over groups (Q2210871) (← links)
- Semigroup automata with rational initial and terminal sets (Q2268859) (← links)
- The loop problem for Rees matrix semigroups. (Q2481325) (← links)
- ON GROUPS AND COUNTER AUTOMATA (Q3601328) (← links)
- Formal Languages and Groups as Memory (Q3618533) (← links)
- (Q5016373) (← links)
- Anisimov's Theorem for inverse semigroups (Q5246502) (← links)
- Automata with Counters that Recognize Word Problems of Free Products (Q5250278) (← links)
- On the Degree of Extension of Some Models Defining Non-Regular Languages (Q6204122) (← links)
- Free products of semigroups and monoids with a deterministic context-free word problem (Q6663534) (← links)
