Imagen de Portada

Anti-Context-Free languages

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autor principal:	Cardó, Carles
Formato:	Preprint
Publicado:	2024
Materias:	Formal Languages and Automata Theory 68Q42, 68Q43 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

Around Context-Free Grammars -- a Normal Form, a Representation Theorem, and a Regular Approximation
por: Cojocaru, Liliana
Publicado: (2015)

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

The Generation-Recognition Asymmetry: Six Dimensions of a Fundamental Divide in Formal Language Theory
por: Peyrichou, Romain
Publicado: (2026)

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

An algebraic characterisation of Eve-positional languages
por: Colcombet, Thomas, et al.
Publicado: (2026)

Eve-positional languages: putting order into Büchi automata
por: Idir, Olivier
Publicado: (2026)

On Graph Grammars and Games
por: Vijayakumar, Jayakrishna, et al.
Publicado: (2024)

Using games and universal trees to characterise the nondeterministic index of tree languages
por: Idir, Olivier, et al.
Publicado: (2025)

From higher-order rewriting systems to higher-order categorial algebras and higher-order Curry-Howard isomorphisms
por: Vidal, Juan Climent, et al.
Publicado: (2024)

Languages of Words of Low Automatic Complexity Are Hard to Compute
por: Chen, Joey, et al.
Publicado: (2025)

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

Alternating Nominal Automata with Name Allocation
por: Frank, Florian, et al.
Publicado: (2024)

Nominal Tree Automata With Name Allocation
por: Prucker, Simon, et al.
Publicado: (2024)

Generalized Parikh Matrices For Tracking Subsequence Occurrences
por: Fazekas, Szilárd Zsolt, et al.
Publicado: (2024)

Decomposition of Automata recognizing Ideals
por: Berry, Mathias, et al.
Publicado: (2026)

On universality of regular realizability problems
por: Rubtsov, Alexander, et al.
Publicado: (2023)

Learning Automata with Name Allocation
por: Frank, Florian, et al.
Publicado: (2025)

Deciding Sparseness of Regular Languages of Finite Trees and Infinite Words
por: Eickmeyer, Kord, et al.
Publicado: (2025)

Disproving Termination of Non-Erasing Sole Combinatory Calculus with Tree Automata (Full Version)
por: Nakano, Keisuke, et al.
Publicado: (2024)

Jump Complexity of Deterministic Finite Automata with Translucent Letters
por: Fazekas, Szilárd Zsolt, et al.
Publicado: (2025)

A Formalization of Co-Transcriptional Splicing as an Operation on Formal Languages
por: Cho, Da-Jung, et al.
Publicado: (2025)

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

Hamming distance between finite transducers
por: Dartois, Luc, et al.
Publicado: (2026)

On the Equivalence Checking Problem for Deterministic Top-Down Tree Automata
por: Deng, Zhibo, et al.
Publicado: (2025)

On Transition Constructions for Automata -- A Categorical Perspective
por: Cruchten, Mike
Publicado: (2024)

Kleene Theorems for Lasso Languages and $ω$-Languages
por: Cruchten, Mike
Publicado: (2024)

Polynomial Complementation of Nondeterministic 2-Way Finite Automata by 1-Limited Automata
por: Guillon, Bruno, et al.
Publicado: (2025)

Input-Erasing Two-Way Finite Automata
por: Meduna, Alexander, et al.
Publicado: (2025)

Free inverse monoids are co-context-free
por: Brough, Tara Macalister, et al.
Publicado: (2025)

Evaluating Massively Parallel Algorithms for DFA Minimisation, Equivalence Checking and Inclusion Checking
por: Heemstra, Jan, et al.
Publicado: (2025)

Active Learning of Mealy Machines with Timers
por: Bruyère, Véronique, et al.
Publicado: (2024)

Propositional dynamic logic and asynchronous cascade decompositions for regular trace languages
por: Adsul, Bharat, et al.
Publicado: (2024)

Subshifts defined by nondeterministic and alternating plane-walking automata
por: de Menibus, Benjamin Hellouin, et al.
Publicado: (2024)

Computing the Bandwidth of Meager Timed Automata
por: Asarin, Eugene, et al.
Publicado: (2024)

Weighing Obese Timed Languages
por: Asarin, Eugene, et al.
Publicado: (2025)

The Complexity of Simplifying $ω$-Automata through the Alternating Cycle Decomposition
por: Casares, Antonio, et al.
Publicado: (2024)

The memory of $ω$-regular and BC($Σ_2^0$) objectives
por: Casares, Antonio, et al.
Publicado: (2025)

Layered automata: A canonical model for automata over infinite words
por: Casares, Antonio, et al.
Publicado: (2026)

Transition-based vs stated-based acceptance for automata over infinite words
por: Casares, Antonio
Publicado: (2025)

From Muller to Parity and Rabin Automata: Optimal Transformations Preserving (History) Determinism
por: Casares, Antonio, et al.
Publicado: (2023)