Image de couverture de livre

On Graph Grammars and Games

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Vijayakumar, Jayakrishna, Mathew, Lisa
Format:	Preprint
Publié:	2024
Sujets:	Formal Languages and Automata Theory Discrete Mathematics Combinatorics 68Q42, 68Q45, 68R10 F.4.2; G.2.2; F.4.3; F.1.1
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

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

Anti-Context-Free languages
par: Cardó, Carles
Publié: (2024)

Walking on Words
par: Pratt-Hartmann, Ian
Publié: (2022)

Well-Quasi-Orderings on Word Languages
par: Lhote, Nathan, et autres
Publié: (2025)

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

Decision Problems on Copying and Shuffling
par: Halava, Vesa, et autres
Publié: (2023)

Disproving Termination of Non-Erasing Sole Combinatory Calculus with Tree Automata (Full Version)
par: Nakano, Keisuke, et autres
Publié: (2024)

Grammar-Constrained (CFL) Reachability: Subcubic Preprocessing, Indexing Trade-offs, and Structured Decoding Semantics
par: Alpay, Faruk, et autres
Publié: (2026)

Jump Complexity of Deterministic Finite Automata with Translucent Letters
par: Fazekas, Szilárd Zsolt, et autres
Publié: (2025)

Decidability of membership problems for flat rational subsets of $\mathrm{GL}(2,\mathbb{Q})$ and singular matrices
par: Diekert, Volker, et autres
Publié: (2019)

On Quantum Context-Free Grammars
par: Aruja, Merina, et autres
Publié: (2025)

Languages of Words of Low Automatic Complexity Are Hard to Compute
par: Chen, Joey, et autres
Publié: (2025)

Axiomatizing NFAs Generated by Regular Grammars
par: Gorrieri, Roberto
Publié: (2024)

Black-box Context-free Grammar Inference for Readable & Natural Grammars
par: Arefin, Mohammad Rifat, et autres
Publié: (2025)

On Transition Constructions for Automata -- A Categorical Perspective
par: Cruchten, Mike
Publié: (2024)

Polynomial Complementation of Nondeterministic 2-Way Finite Automata by 1-Limited Automata
par: Guillon, Bruno, et autres
Publié: (2025)

Kleene Theorems for Lasso Languages and $ω$-Languages
par: Cruchten, Mike
Publié: (2024)

Input-Erasing Two-Way Finite Automata
par: Meduna, Alexander, et autres
Publié: (2025)

Weighing Obese Timed Languages
par: Asarin, Eugene, et autres
Publié: (2025)

Computing the Bandwidth of Meager Timed Automata
par: Asarin, Eugene, et autres
Publié: (2024)

Propositional dynamic logic and asynchronous cascade decompositions for regular trace languages
par: Adsul, Bharat, et autres
Publié: (2024)

Subshifts defined by nondeterministic and alternating plane-walking automata
par: de Menibus, Benjamin Hellouin, et autres
Publié: (2024)

Attention Meets Reachability: Structural Equivalence and Efficiency in Grammar-Constrained LLM Decoding
par: Alpay, Faruk, et autres
Publié: (2026)

A Formalization of Co-Transcriptional Splicing as an Operation on Formal Languages
par: Cho, Da-Jung, et autres
Publié: (2025)

The Algebra of Nondeterministic Finite Automata
par: Gorrieri, Roberto
Publié: (2023)

Solutions of Word Equations over Partially Commutative Structures
par: Diekert, Volker, et autres
Publié: (2016)

From higher-order rewriting systems to higher-order categorial algebras and higher-order Curry-Howard isomorphisms
par: Vidal, Juan Climent, et autres
Publié: (2024)

Subsequence Matching and Analysis Problems for Formal Languages
par: Fazekas, Szilárd Zsolt, et autres
Publié: (2024)

The number of primitive words of unbounded exponent in the language of an HD0L-system is finite
par: Klouda, Karel, et autres
Publié: (2021)

Well-quasi-ordered classes of bounded clique-width
par: Dumas, Maël, et autres
Publié: (2026)

$\mathbb{N}$-polyregular functions arise from well-quasi-orderings
par: Lopez, Aliaume
Publié: (2024)

Evaluating Massively Parallel Algorithms for DFA Minimisation, Equivalence Checking and Inclusion Checking
par: Heemstra, Jan, et autres
Publié: (2025)

The Word Problem for Finitary Automaton Groups
par: Kotowsky, Maximilian, et autres
Publié: (2023)

Eve-positional languages: putting order into Büchi automata
par: Idir, Olivier
Publié: (2026)

Decomposition of Automata recognizing Ideals
par: Berry, Mathias, et autres
Publié: (2026)

On universality of regular realizability problems
par: Rubtsov, Alexander, et autres
Publié: (2023)

Learning Automata with Name Allocation
par: Frank, Florian, et autres
Publié: (2025)

Alternating Nominal Automata with Name Allocation
par: Frank, Florian, et autres
Publié: (2024)

Deciding Sparseness of Regular Languages of Finite Trees and Infinite Words
par: Eickmeyer, Kord, et autres
Publié: (2025)

Using games and universal trees to characterise the nondeterministic index of tree languages
par: Idir, Olivier, et autres
Publié: (2025)