Priority downward closures

DOI10.4230/LIPICS.CONCUR.2023.39MaRDI QIDQ6967307zbMATH OpenFDO

Authors Georg Zetzsche

Publication date 26 June 2025

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.CONCUR.2023.39

zbMATH Keywords

abstractioncomputabilitydownward closurenon-deterministic finite automatapriority orderpushdown automata

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cites work

• A Second Course in Formal Languages and Automata Theory
• An approach to computing downward closures
• Computing downward closures for stacked counter automata
• Context-bounded analysis for concurrent programs with dynamic creation of threads
• Context-bounded analysis of concurrent programs (invited talk)
• Effective constructions in well-partially-ordered free monoids
• Finite automata for the sub- and superword closure of CFLs: descriptional and computational complexity
• General Decidability Results for Asynchronous Shared-Memory Programs: Higher-Order and Beyond
• scientific article; zbMATH DE number 3660804 (Why is no real title available?)
• scientific article; zbMATH DE number 1512704 (Why is no real title available?)
• scientific article; zbMATH DE number 1754626 (Why is no real title available?)
• scientific article; zbMATH DE number 10087 (Why is no real title available?)
• scientific article; zbMATH DE number 7204383 (Why is no real title available?)
• On free monoids partially ordered by embedding
• Ordering by Divisibility in Abstract Algebras
• Priority downward closures
• Safety of Parametrized Asynchronous Shared-Memory Systems is Almost Always Decidable
• Separability by piecewise testable languages and downward closures beyond subwords
• The Asynchronous Transfer Mode: a tutorial
• The complexity of downward closure comparisons
• The complexity of regular abstractions of one-counter languages
• The diagonal problem for higher-order recursion schemes is decidable
• The downward-closure of Petri net languages
• The power of priority channel systems
• The size of Higman-Haines sets
• Unboundedness and downward closures of higher-order pushdown automata

Cited in

(4)

• k-universality of regular languages revisited
• Priority downward closures
• Verifying unboundedness via amalgamation
• Subsequence matching and analysis problems for formal languages

This page was built for publication: Priority downward closures

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6967307)