scientific article; zbMATH DE number 3628412
From MaRDI portal
Publication:4190159
Cites work
- scientific article; zbMATH DE number 3642736 (Why is no real title available?)
- scientific article; zbMATH DE number 3646295 (Why is no real title available?)
- scientific article; zbMATH DE number 3509706 (Why is no real title available?)
- scientific article; zbMATH DE number 3551930 (Why is no real title available?)
- scientific article; zbMATH DE number 3564361 (Why is no real title available?)
- scientific article; zbMATH DE number 3413820 (Why is no real title available?)
- A decidability theorem for a class of vector-addition systems
- An Infinite Hierarchy of Context-Free Languages
- Associate languages and derivational complexity of formal grammars and languages
- Computation sequence sets
- Interpolated Denumerants and Lambert Series
- On derivation languages corresponding to context-free grammars
- Petri nets and szilard languages
- Principal AFL
- Reachability Problems in Vector Addition Systems
- Remarks on blind and partially blind one-way multicounter machines
- Remarks on the complexity of nondeterministic counter languages
- Reversal-bounded multipushdown machines
- Some uniformly erasable families of languages
Cited in
(26)- Groups whose word problem is a Petri net language
- Regular separators for VASS coverability languages
- General Decidability Results for Asynchronous Shared-Memory Programs: Higher-Order and Beyond
- A Note on Decidable Separability by Piecewise Testable Languages
- Extending regular expressions with iterated shuffle
- Reachability problems in low-dimensional nondeterministic polynomial maps over integers
- Infinite behaviour of Petri nets
- The power of synchronizing operations on strings
- Refining the hierarchy of blind multicounter languages and twist-closed trios.
- \(X\)-automata on \(\omega\)-words
- A normal form theorem for label grammars
- An approach to computing downward closures
- Consensual languages and matching finite-state computations
- Petri net languages and infinite subsets of \(\mathbb{N}^m\)
- A structure to decide reachability in Petri nets
- General decidability results for asynchronous shared-memory programs: higher-order and beyond
- Unboundedness problems for languages of vector addition systems
- Petri nets and regular languages
- Recursive Petri nets
- Remarks on two-way automata with weak-counters
- Methods for behavior descriptions of structure-complex Petri nets
- Super-nets and their hierarchy
- Two-way deterministic multi-weak-counter machines
- Counter machines, Petri nets, and consensual computation
- Langages à un compteur
- CTS systems and Petri nets
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4190159)
