An Approach to Computing Downward Closures

DOI10.1007/978-3-662-47666-6_35zbMath1440.68166arXiv1503.01068OpenAlexW1646789098MaRDI QIDQ3449495

Georg Zetzsche

Publication date: 4 November 2015

Published in: Automata, Languages, and Programming (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1503.01068

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (14)

An Approach to Computing Downward Closures ⋮ General Decidability Results for Asynchronous Shared-Memory Programs: Higher-Order and Beyond ⋮ A Note on Decidable Separability by Piecewise Testable Languages ⋮ Cost Automata, Safe Schemes, and Downward Closures ⋮ Unboundedness problems for machines with reversal-bounded counters ⋮ Existential Definability over the Subword Ordering ⋮ Unboundedness Problems for Languages of Vector Addition Systems. ⋮ Unnamed Item ⋮ On finite-index indexed grammars and their restrictions ⋮ General decidability results for asynchronous shared-memory programs: higher-order and beyond ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Semilinearity of Families of Languages ⋮ The Complexity of the Diagonal Problem for Recursion Schemes

Cites Work

• A shrinking lemma for indexed languages
• On multiple context-free grammars
• On derivation trees of indexed grammars - an extension of the uvwxy- theorem
• A relationship between ETOL and EDTOL languages
• Effective constructions in well-partially-ordered free monoids
• Undecidable problems in unreliable computations.
• Using forward reachability analysis for verification of lossy channel systems
• The size of Higman-Haines sets
• Regular Cost Functions, Part I: Logic and Algebra over Words
• Model Checking Vector Addition Systems with one zero-test
• A Pumping Lemma for Collapsible Pushdown Graphs of Level 2
• On Infinite Words Determined by Indexed Languages
• Computing Downward Closures for Stacked Counter Automata
• An Approach to Computing Downward Closures
• The Downward-Closure of Petri Net Languages
• Indexed Grammars—An Extension of Context-Free Grammars
• On free monoids partially ordered by embedding
• Reachability analysis of pushdown automata: Application to model-checking
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An Approach to Computing Downward Closures