Image de couverture de livre

Lindenmayer graph languages, first-order theories and expanders

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteur principal:	Knapik, Teodor
Format:	Preprint
Publié:	2024
Sujets:	Formal Languages and Automata Theory Logic 03D05 (Primary) 68Q42, 05C48, 92C15 (Secondary) F.4.1; F.4.2
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

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

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

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

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

Determination of the fifth Busy Beaver value
par: The bbchallenge Collaboration, et autres
Publié: (2025)

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

Rewriting Systems on Arbitrary Monoids
par: Magalhães, Eduardo
Publié: (2026)

Psi-Turing Machines: Bounded Introspection for Complexity Barriers and Oracle Separations
par: Huseynzade, Rafig
Publié: (2025)

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

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

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

Stratifiable formulae are not context-free
par: Ryan-Smith, Calliope
Publié: (2023)

Run supports and initial algebra supports of weighted automata
par: Droste, Manfred, et autres
Publié: (2024)

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

A Logic For Fresh Labelled Transition Systems
par: Bandukara, Mohamed H, et autres
Publié: (2025)

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

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

Formalizing Computational Paths and Fundamental Groups in Lean
par: Ramos, Arthur F., et autres
Publié: (2025)

Conjunctive categorial grammars and Lambek grammars with additives
par: Kuznetsov, Stepan L., et autres
Publié: (2024)

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

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

Unifying Weak Independence and Signal Hierarchy Theory: Extended Biological Petri Net Formalism with Application to Vibrio fischeri Quorum Sensing
par: Simao, Eugenio
Publié: (2025)

The Orientation Boundary for Step-Duplicating Recursors: Mechanized Impossibility, Escape, and Certification
par: Rahnama, Moses
Publié: (2025)

Gödel Mirror: A Formal System For Contradiction-Driven Recursion
par: Chan, Jhet
Publié: (2025)

A correspondence between the time and space complexity
par: Latkin, Ivan V.
Publié: (2023)

Agent Interpolation for Knowledge
par: Bílková, Marta, et autres
Publié: (2025)

On Graph Grammars and Games
par: Vijayakumar, Jayakrishna, et autres
Publié: (2024)

On the ET0L subgroup membership problem in bounded automata groups
par: Bishop, Alex, et autres
Publié: (2024)

Techniques for Showing the Decidability of the Boundedness Problem of Language Acceptors
par: Ibarra, Oscar H., et autres
Publié: (2024)

Parsing Hypergraphs using Context-Free Positional Grammars
par: Costagliola, Gennaro, et autres
Publié: (2026)

Various Types of Comet Languages and their Application in External Contextual Grammars
par: Ködding, Marvin, et autres
Publié: (2024)

Hypernode Automata
par: Bartocci, Ezio, et autres
Publié: (2023)

Free inverse monoids are co-context-free
par: Brough, Tara Macalister, et autres
Publié: (2025)

The Solver's Paradox in Formal Problem Spaces
par: Rosko, Milan
Publié: (2025)

Metalevel transformation of strategies
par: Rubio, Rubén, et autres
Publié: (2024)

Finitary Simulation of Infinitary $β$-Reduction via Taylor Expansion, and Applications
par: Cerda, Rémy, et autres
Publié: (2022)

On the Equivalence Checking Problem for Deterministic Top-Down Tree Automata
par: Deng, Zhibo, et autres
Publié: (2025)

Normalization properties of $λμ$-calculus using realizability semantics
par: Battyanyi, Peter, et autres
Publié: (2023)

Openness And Partial Adjacency In One Variable TPTL
par: Krishna, Shankara Narayanan, et autres
Publié: (2024)

Termination of Innermost-Terminating Right-Linear Overlay Term Rewrite Systems (Full Version)
par: Nishida, Naoki
Publié: (2026)