Automata with Counters that Recognize Word Problems of Free Products (Q5250278): Difference between revisions

@@ Property / cites work @@
+EXTENDED FINITE AUTOMATA AND WORD PROBLEMS
@@ Property / cites work: EXTENDED FINITE AUTOMATA AND WORD PROBLEMS / rank @@
+Normal rank
@@ Property / cites work @@
+Free products with amalgamation of monoids
@@ Property / cites work: Free products with amalgamation of monoids / rank @@
+Normal rank
@@ Property / cites work @@
+ON GROUPS AND COUNTER AUTOMATA
@@ Property / cites work: ON GROUPS AND COUNTER AUTOMATA / rank @@
+Normal rank
@@ Property / cites work @@
+On groups whose word problem is solved by a counter automaton.
+Normal rank
@@ Property / cites work @@
+Word problems recognisable by deterministic blind monoid automata
+Normal rank
@@ Property / cites work @@
+Formal Languages and Groups as Memory
@@ Property / cites work: Formal Languages and Groups as Memory / rank @@
+Normal rank
@@ Property / cites work @@
+Extended finite automata over groups
@@ Property / cites work: Extended finite automata over groups / rank @@
+Normal rank
@@ Property / cites work @@
+Semigroup automata with rational initial and terminal sets
+Normal rank
@@ Property / cites work @@
+A representation theorem for algebraic and context-free power series in noncommuting variables
+Normal rank
@@ Property / cites work @@
+Topology of finite graphs
@@ Property / cites work: Topology of finite graphs / rank @@
+Normal rank