scientific article; zbMATH DE number 7453188

MaRDI QIDQ5020647

Lorenzo Clemente

Publication date: 6 January 2022

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

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items

On the decidability of infix inclusion problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A holonomic systems approach to special functions identities
• A graph-based regularity test for deterministic context-free languages
• Complexity of deciding Tarski algebra
• On path equivalence of nondeterministic finite automata
• The containment problem for unambiguous register automata and unambiguous timed automata
• Language equivalence of probabilistic pushdown automata
• Automata theory in nominal sets
• Complexity Results and the Growths of Hairpin Completions of Regular Languages (Extended Abstract)
• COMPUTING LEAST FIXED POINTS OF PROBABILISTIC SYSTEMS OF POLYNOMIALS
• Recursive Markov chains, stochastic grammars, and monotone systems of nonlinear equations
• On the Complexity of Numerical Analysis
• Regularity and Related Problems for Deterministic Pushdown Automata
• The equivalence problem for deterministic pushdown automata is decidable
• Universality Problem for Unambiguous VASS
• Stochastic Context-Free Grammars, Regular Languages, and Newton’s Method
• Ambiguity in context free languages
• A regularity test for pushdown machines
• On the multiplicity equivalence problem for context-free grammars