Cover Image

Stratifiable formulae are not context-free

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Ryan-Smith, Calliope
Format:	Preprint
Published:	2023
Subjects:	Logic Formal Languages and Automata Theory 03D05, 03E70 F.4.1; F.4.3
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

A Logic For Fresh Labelled Transition Systems
by: Bandukara, Mohamed H, et al.
Published: (2025)

Openness And Partial Adjacency In One Variable TPTL
by: Krishna, Shankara Narayanan, et al.
Published: (2024)

On Some Complexity Results for Even Linear Languages
by: Cojocaru, Liliana
Published: (2024)

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

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

Determination of the fifth Busy Beaver value
by: The bbchallenge Collaboration, et al.
Published: (2025)

Characterizing NC1 with Typed Monoids
by: Dawar, Anuj, et al.
Published: (2025)

Orbit-finite linear programming
by: Ghosh, Arka, et al.
Published: (2023)

A Nivat Theorem for Weighted Alternating Automata over Commutative Semirings
by: Grabolle, Gustav
Published: (2022)

Labelled Well Quasi Ordered Classes of Bounded Linear Clique-Width
by: Lopez, Aliaume
Published: (2024)

Word equations and the exponent of periodicity
by: Diekert, Volker, et al.
Published: (2025)

Run supports and initial algebra supports of weighted automata
by: Droste, Manfred, et al.
Published: (2024)

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

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

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

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

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

Succinctness of Cosafety Fragments of LTL via Combinatorial Proof Systems (extended version)
by: Geatti, Luca, et al.
Published: (2024)

Learning Deterministic One-Counter Automata in Polynomial Time
by: Mathew, Prince, et al.
Published: (2025)

Finitely Presentable Higher-Dimensional Automata and the Irrationality of Process Replication
by: Basold, Henning, et al.
Published: (2023)

A vector logic for intensional formal semantics
by: Quigley, Daniel
Published: (2026)

How Concise are Chains of co-Büchi Automata?
by: Ehlers, Rüdiger
Published: (2025)

A Decision Procedure for Probabilistic Kleene Algebra with Angelic Nondeterminism
by: Ong, Shawn, et al.
Published: (2025)

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

The complexity of downward closures of indexed languages
by: Mandel, Richard, et al.
Published: (2026)

Satisfiability of Context-free String Constraints with Subword-ordering and Transducers
by: Aiswarya, C, et al.
Published: (2024)

Formalizing Computational Paths and Fundamental Groups in Lean
by: Ramos, Arthur F., et al.
Published: (2025)

Gödel Mirror: A Formal System For Contradiction-Driven Recursion
by: Chan, Jhet
Published: (2025)

Model-Checking PCTL Properties of Stateless Probabilistic Pushdown Systems
by: Lin, Deren, et al.
Published: (2014)

Non-reducible Modal Transition Systems
by: Basile, Davide
Published: (2023)

Learning real-time one-counter automata using polynomially many queries
by: Mathew, Prince, et al.
Published: (2024)

Have a thing? Reasoning around recursion with dynamic typing in grounded arithmetic
by: Bobrow, Elliot, et al.
Published: (2025)

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

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

On Minimization and Learning of Deterministic $ω$-Automata in the Presence of Don't Care Words
by: Löding, Christof, et al.
Published: (2022)

Recognizing Numbers
by: Gaba, Pranshu, et al.
Published: (2025)

Lexicographic transductions of finite words
by: Filiot, Emmanuel, et al.
Published: (2025)

Probabilistic Finite Automaton Emptiness is undecidable
by: Rote, Günter
Published: (2024)

Orbit-Finite-Dimensional Vector Spaces and Weighted Register Automata
by: Bojańczyk, Mikołaj, et al.
Published: (2021)