Cover Image

Walking on Words

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Pratt-Hartmann, Ian
Format:	Preprint
Published:	2022
Subjects:	Discrete Mathematics Formal Languages and Automata Theory 68Q42 F.4.2; G.2.1
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

On Graph Grammars and Games
by: Vijayakumar, Jayakrishna, et al.
Published: (2024)

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

Anti-Context-Free languages
by: Cardó, Carles
Published: (2024)

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

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

Some Results on Digital Segments and Balanced Words
by: De Luca, Alessandro, et al.
Published: (2022)

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

A Uniform Framework for Problems on Context-Free Grammars
by: Esparza, Javier, et al.
Published: (2024)

Black-box Context-free Grammar Inference for Readable & Natural Grammars
by: Arefin, Mohammad Rifat, et al.
Published: (2025)

Construction of Minkowski Sums by Cellular Automata
by: Tahay, Pierre-Adrien
Published: (2024)

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

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

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

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

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

Identity Testing for Stochastic Languages
by: Agarwal, Smayan, et al.
Published: (2025)

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

High-Performance Generation of Constrained Inputs
by: Crump, Addison, et al.
Published: (2025)

Rewriting Systems on Arbitrary Monoids
by: Magalhães, Eduardo
Published: (2026)

Intrinsic Verification of Parsers and Formal Grammar Theory in Dependent Lambek Calculus (Extended Version)
by: Schaefer, Steven, et al.
Published: (2025)

Dorst-Smeulders Coding for Arbitrary Binary Words
by: De Luca, Alessandro, et al.
Published: (2025)

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

Lindenmayer graph languages, first-order theories and expanders
by: Knapik, Teodor
Published: (2024)

Finding codes on infinite grids automatically
by: Salo, Ville, et al.
Published: (2023)

Dissecting power of intersection of two context-free languages
by: Rukavicka, Josef
Published: (2020)

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

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

Decidability of membership problems for flat rational subsets of $\mathrm{GL}(2,\mathbb{Q})$ and singular matrices
by: Diekert, Volker, et al.
Published: (2019)

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

Tight Bounds for the Number of Absent Subsequences
by: Adamson, Duncan, et al.
Published: (2024)

LR Parsing of Permutation Phrases
by: Kostičová, Jana
Published: (2024)

On Quantum Context-Free Grammars
by: Aruja, Merina, et al.
Published: (2025)

Words with factor complexity $2n+1$ and minimal critical exponent
by: Currie, James D.
Published: (2025)

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

On a Generalization of the Christoffel Tree: Epichristoffel Trees
by: Krishnamoorthy, Abhishek, et al.
Published: (2025)

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

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

The Word Problem for Finitary Automaton Groups
by: Kotowsky, Maximilian, et al.
Published: (2023)

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

Hypernode Automata
by: Bartocci, Ezio, et al.
Published: (2023)