Imagen de Portada

Free inverse monoids are co-context-free

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Brough, Tara Macalister, Johnson, Marianne, Kambites, Mark, Nyberg-Brodda, Carl-Fredrik
Formato:	Preprint
Publicado:	2025
Materias:	Group Theory Formal Languages and Automata Theory 20F10, 20M18, 68Q45, 03D40 F.4.2; F.4.3
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Parsing Hypergraphs using Context-Free Positional Grammars
por: Costagliola, Gennaro, et al.
Publicado: (2026)

Various Types of Comet Languages and their Application in External Contextual Grammars
por: Ködding, Marvin, et al.
Publicado: (2024)

Solutions of Word Equations over Partially Commutative Structures
por: Diekert, Volker, et al.
Publicado: (2016)

Identity Testing for Stochastic Languages
por: Agarwal, Smayan, et al.
Publicado: (2025)

Stratifiable formulae are not context-free
por: Ryan-Smith, Calliope
Publicado: (2023)

Turn Complexity of Context-free Languages, Pushdown Automata and One-Counter Automata
por: Pighizzini, Giovanni
Publicado: (2026)

Anti-Context-Free languages
por: Cardó, Carles
Publicado: (2024)

Subsets of groups with context-free preimages
por: Levine, Alex
Publicado: (2023)

Well-Quasi-Orderings on Word Languages
por: Lhote, Nathan, et al.
Publicado: (2025)

On some Classes of Reversible 2-head Automata
por: Nagy, Benedek, et al.
Publicado: (2025)

On groups with EDT0L word problem
por: Bishop, Alex, et al.
Publicado: (2025)

A New Graph Grammar Formalism for Robust Syntactic Pattern Recognition
por: Fletcher, Peter
Publicado: (2025)

Introducing Divergence for Infinite Probabilistic Models
por: Finkel, Alain, et al.
Publicado: (2023)

The Word Problem for $(ω- 1)$-Terms over $\mathrm{DAb}$
por: Almeida, Jorge, et al.
Publicado: (2024)

Decision Problems on Copying and Shuffling
por: Halava, Vesa, et al.
Publicado: (2023)

Algebraic Language Theory with Effects
por: Lenke, Fabian, et al.
Publicado: (2024)

Commuting upper triangular binary morphisms
por: Honkala, Juha
Publicado: (2023)

Active Learning Techniques for Pomset Recognizers
por: Pommellet, Adrien, et al.
Publicado: (2025)

Minimal History-Deterministic Co-Buchi Automata: Congruences and Passive Learning
por: Löding, Christof, et al.
Publicado: (2025)

A Robust Measure on FDFAs Following Duo-Normalized Acceptance
por: Fisman, Dana, et al.
Publicado: (2023)

Store Languages of Turing Machines and Counter Machines
por: Friesen, Noah, et al.
Publicado: (2025)

Active Learning of Upward-Closed Sets of Words
por: Aristote, Quentin
Publicado: (2025)

Deciding DFA-Primality is NP-Hard
por: Spenner, Daniel Alexander
Publicado: (2026)

Planning with Probabilistic Opacity and Transparency: A Computational Model of Opaque/Transparent Observations
por: Udupa, Sumukha, et al.
Publicado: (2024)

Verifying Unboundedness via Amalgamation
por: Anand, Ashwani, et al.
Publicado: (2024)

Omega-Regular Robustness
por: Fisman, Dana, et al.
Publicado: (2025)

Runtime Consultants
por: Fisman, Dana, et al.
Publicado: (2025)

Learning Realtime One-Counter Automata
por: Bruyère, Véronique, et al.
Publicado: (2021)

On History-Deterministic One-Counter Nets
por: Prakash, Keya, et al.
Publicado: (2022)

Monads, Comonads, and Transducers
por: Stefański, Rafał
Publicado: (2024)

Automata with Timers
por: Bruyère, Véronique, et al.
Publicado: (2023)

How to Demonstrate Metalinearness and Regularity by Tree-Restricted General Grammars
por: Havel, Martin, et al.
Publicado: (2024)

A Myhill-Nerode style Characterization for Timed Automata With Integer Resets
por: Doveri, Kyveli, et al.
Publicado: (2024)

Normal Forms for Elements of ${}^*$-Continuous Kleene Algebras Representing the Context-Free Languages
por: Hopkins, Mark, et al.
Publicado: (2023)

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

Preprint: Exploring Inevitable Waypoints for Unsolvability Explanation in Hybrid Planning Problems
por: Sarwar, Mir Md Sajid, et al.
Publicado: (2025)

Techniques for Showing the Decidability of the Boundedness Problem of Language Acceptors
por: Ibarra, Oscar H., et al.
Publicado: (2024)

Non-reducible Modal Transition Systems
por: Basile, Davide
Publicado: (2023)

On Repetitive Finite Automata with Translucent Words
por: Mráz, František, et al.
Publicado: (2025)

On the Boolean Closure of Deterministic Top-Down Tree Automata
por: Löding, Christof, et al.
Publicado: (2024)