Imagen de Portada

Membership and Conjugacy in Inverse Semigroups

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Fleischer, Lukas, Stober, Florian, Thumm, Alexander, Weiß, Armin
Formato:	Preprint
Publicado:	2025
Materias:	Computational Complexity Formal Languages and Automata Theory Group Theory
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Word problems and embedding-obstructions in cellular automata groups on groups
por: Salo, Ville
Publicado: (2025)

Is decidability of the Submonoid Membership Problem closed under finite extensions?
por: Shafrir, Doron
Publicado: (2024)

Regular Grammars as Effective Representations of Recognizable Sets of Series-Parallel Graphs
por: Bozga, Marius, et al.
Publicado: (2026)

Submonoid Membership in n-dimensional lamplighter groups and S-unit equations
por: Dong, Ruiwen
Publicado: (2024)

Membership problems in nilpotent groups
por: Bodart, Corentin
Publicado: (2024)

Proceedings of the 15th International Workshop on Non-Classical Models of Automata and Applications
por: Moreira, Nelma, et al.
Publicado: (2025)

On the complexity of computing Strahler numbers
por: Ganardi, Moses, et al.
Publicado: (2025)

Studying homing and synchronizing sequences for Timed Finite State Machines with output delays
por: Vinarskii, Evgenii, et al.
Publicado: (2025)

Rational-Valued Affine Verifiers in Arthur--Merlin Proof Systems
por: Chen, Zeyu, et al.
Publicado: (2025)

Unambiguous and Co-Nondeterministic Computations of Finite Automata and Pushdown Automata Families and the Effects of Multiple Counters
por: Yamakami, Tomoyuki
Publicado: (2024)

Complexity Aspects of the Extension of Wagner's Hierarchy to $k$-Partitions
por: Podolskii, Vladimir, et al.
Publicado: (2024)

Regular Expressions with Backreferences and Lookaheads Capture NLOG
por: Uezato, Yuya
Publicado: (2024)

Maximal Length Cellular Automata : A Survey
por: Adak, Sumit, et al.
Publicado: (2024)

Trading Determinism for Noncommutativity in Edmonds' Problem
por: Arvind, V., et al.
Publicado: (2024)

Constant-Space, Constant-Randomness Verifiers with Arbitrarily Small Error
por: Gezer, M. Utkan, et al.
Publicado: (2020)

Visibly Recursive Automata
por: Dubrulle, Kévin, et al.
Publicado: (2026)

Between SC and LOGDCFL: Families of Languages Accepted by Logarithmic-Space Deterministic Auxiliary Depth-k Storage Automata
por: Yamakami, Tomoyuki
Publicado: (2022)

Review of Automaton Learning Algorithms with Polynomial Complexity -- Completely Solved Examples
por: Haneef, Farah
Publicado: (2024)

Entropy of pebble automata and space complexity
por: Montoya, J. Andres
Publicado: (2026)

Complexity of Unary Exclusive Nondeterministic Finite Automata
por: Kutrib, Martin, et al.
Publicado: (2024)

Power of Counting by Nonuniform Families of Polynomial-Size Finite Automata
por: Yamakami, Tomoyuki
Publicado: (2023)

Intersection and Union Hierarchies of Deterministic Context-Free Languages and Pumping Lemmas
por: Yamakami, Tomoyuki
Publicado: (2021)

Proceedings 14th International Workshop on Non-Classical Models of Automata and Applications (NCMA 2024)
por: Manea, Florin, et al.
Publicado: (2024)

The No Endmarker Theorem for One-Way Probabilistic Pushdown Automata
por: Yamakami, Tomoyuki
Publicado: (2021)

Complexity of Fungal Automaton Prediction
por: Formenti, Enrico, et al.
Publicado: (2026)

Nondeterministic Auxiliary Depth-Bounded Storage Automata and Semi-Unbounded Fan-in Cascading Circuits
por: Yamakami, Tomoyuki
Publicado: (2024)

Synthesis of Timeline-Based Planning Strategies Avoiding Determinization
por: Acampora, Renato, et al.
Publicado: (2024)

Embedding arbitrary Boolean circuits into fungal automata with arbitrary update sequences
por: Goles, Eric, et al.
Publicado: (2026)

The rotating normal form of braids is regular
por: Fromentin, Jean
Publicado: (2016)

On linguistic subsets of groups and monoids
por: Carvalho, André, et al.
Publicado: (2025)

Equality of cycle lengths in one- and two-dimensional $σ$ automata
por: Vadali, Avi, et al.
Publicado: (2025)

Geodesic languages for rational subsets and conjugates in virtually free groups
por: Carvalho, André, et al.
Publicado: (2024)

Cayley Automatic Groups and Numerical Characteristics of Turing Transducers
por: Berdinsky, Dmitry
Publicado: (2016)

Sections of Submonoids of Nilpotent Groups
por: Shafrir, Doron
Publicado: (2024)

Visibly Pushdown Languages in Groups
por: Ciobanu, Laura, et al.
Publicado: (2026)

Presentation of monoids generated by a projection and an involution
por: Caron, Pascal, et al.
Publicado: (2024)

Time complexity for deterministic string machines
por: Cataltepe, Ali, et al.
Publicado: (2024)

Matching walks that are minimal with respect to edge inclusion
por: Marsault, Victor
Publicado: (2024)

Efficient Compression in Semigroups
por: Thumm, Alexander, et al.
Publicado: (2026)

A language-theoretic approach to study the density of subsets in free groups
por: Carvalho, André
Publicado: (2026)