Cover Image

Various Types of Comet Languages and their Application in External Contextual Grammars

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Ködding, Marvin, Truthe, Bianca
Format:	Preprint
Published:	2024
Subjects:	Formal Languages and Automata Theory F.4.2; F.4.3
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

Idefix-Closed Languages and Their Application in Contextual Grammars
by: Ködding, Marvin, et al.
Published: (2025)

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

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

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

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

How to Demonstrate Metalinearness and Regularity by Tree-Restricted General Grammars
by: Havel, Martin, et al.
Published: (2024)

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

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

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

Algebraic Language Theory with Effects
by: Lenke, Fabian, et al.
Published: (2024)

Store Languages of Turing Machines and Counter Machines
by: Friesen, Noah, et al.
Published: (2025)

Normal Forms for Elements of ${}^*$-Continuous Kleene Algebras Representing the Context-Free Languages
by: Hopkins, Mark, et al.
Published: (2023)

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

Planning with Probabilistic Opacity and Transparency: A Computational Model of Opaque/Transparent Observations
by: Udupa, Sumukha, et al.
Published: (2024)

Verifying Unboundedness via Amalgamation
by: Anand, Ashwani, et al.
Published: (2024)

Monads, Comonads, and Transducers
by: Stefański, Rafał
Published: (2024)

A Myhill-Nerode style Characterization for Timed Automata With Integer Resets
by: Doveri, Kyveli, et al.
Published: (2024)

Commuting upper triangular binary morphisms
by: Honkala, Juha
Published: (2023)

Active Learning Techniques for Pomset Recognizers
by: Pommellet, Adrien, et al.
Published: (2025)

Minimal History-Deterministic Co-Buchi Automata: Congruences and Passive Learning
by: Löding, Christof, et al.
Published: (2025)

A Robust Measure on FDFAs Following Duo-Normalized Acceptance
by: Fisman, Dana, et al.
Published: (2023)

Active Learning of Upward-Closed Sets of Words
by: Aristote, Quentin
Published: (2025)

Deciding DFA-Primality is NP-Hard
by: Spenner, Daniel Alexander
Published: (2026)

Omega-Regular Robustness
by: Fisman, Dana, et al.
Published: (2025)

Runtime Consultants
by: Fisman, Dana, et al.
Published: (2025)

Learning Realtime One-Counter Automata
by: Bruyère, Véronique, et al.
Published: (2021)

On History-Deterministic One-Counter Nets
by: Prakash, Keya, et al.
Published: (2022)

Automata with Timers
by: Bruyère, Véronique, et al.
Published: (2023)

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

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

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

A Word Sampler for Well-Typed Functions
by: Considine, Breandan
Published: (2025)

Orchestration of Music by Grammar Systems
by: Makiš, Jozef, et al.
Published: (2025)

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

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

Active Automata Learning with Advice
by: Fica, Michał, et al.
Published: (2025)

Some Remarks on Marginal Code Languages
by: Konstantinidis, Stavros
Published: (2026)

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

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