Two-letter group codes that preserve aperiodicity of inverse finite automata.

DOI10.1007/s00233-007-9024-6zbMath1149.20051arXivmath/0701264OpenAlexW2032480779MaRDI QIDQ2480773

Jean-Camille Birget, Stuart W. Margolis

Publication date: 3 April 2008

Published in: Semigroup Forum (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0701264

zbMATH Keywords

inverse semigroupsfree groupsinverse automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Generators, relations, and presentations of groups (20F05) Free semigroups, generators and relations, word problems (20M05) Semigroups in automata theory, linguistics, etc. (20M35) Free nonabelian groups (20E05)

Related Items

Weighted Automata on Infinite Words in the Context of Attacker-Defender Games, Relative order and spectrum in free and related groups, Vector Ambiguity and Freeness Problems in SL $$(2,\mathbb {Z})$$, On the Identity Problem for the Special Linear Group and the Heisenberg Group., Weighted automata on infinite words in the context of attacker-defender games

Cites Work

• Finite-automaton aperiodicity is PSPACE-complete
• Topology of finite graphs
• \texttt{PSPACE}-complete problems for subgroups of free groups and inverse finite automata
• FREE INVERSE MONOIDS AND GRAPH IMMERSIONS
• The membership problem in aperiodic transformation monoids
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item