scientific article; zbMATH DE number 3628412

zbMath0404.68076MaRDI QIDQ4190159

Matthias Jantzen

Publication date: 1979

Full work available at URL: https://eudml.org/doc/92087

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

zbMATH Keywords

Computation Sequence SetsLeast Intersection-Closed Full TrioOne-Sided Dyck LangugagePetri Net Languages

Mathematics Subject Classification ID

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

Related Items

CTS systems and Petri nets ⋮ 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 ⋮ Petri nets and regular languages ⋮ The power of synchronizing operations on strings ⋮ Two-way deterministic multi-weak-counter machines ⋮ Refining the hierarchy of blind multicounter languages and twist-closed trios. ⋮ Petri net languages and infinite subsets of \(\mathbb{N}^m\) ⋮ Unboundedness Problems for Languages of Vector Addition Systems. ⋮ Consensual languages and matching finite-state computations ⋮ Recursive Petri nets ⋮ A structure to decide reachability in Petri nets ⋮ Counter machines, Petri nets, and consensual computation ⋮ Methods for behavior descriptions of structure-complex Petri nets ⋮ \(X\)-automata on \(\omega\)-words ⋮ Infinite behaviour of Petri nets ⋮ General decidability results for asynchronous shared-memory programs: higher-order and beyond ⋮ Reachability problems in low-dimensional nondeterministic polynomial maps over integers ⋮ Langages à un compteur ⋮ Groups Whose Word Problem is a Petri Net Language ⋮ Super-nets and their hierarchy ⋮ Remarks on two-way automata with weak-counters ⋮ A normal form theorem for label grammars ⋮ Extending regular expressions with iterated shuffle

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A decidability theorem for a class of vector-addition systems
• Reversal-bounded multipushdown machines
• Remarks on the complexity of nondeterministic counter languages
• Some uniformly erasable families of languages
• Computation sequence sets
• Remarks on blind and partially blind one-way multicounter machines
• Principal AFL
• On derivation languages corresponding to context-free grammars
• Petri nets and szilard languages
• Reachability Problems in Vector Addition Systems
• An Infinite Hierarchy of Context-Free Languages
• Associate languages and derivational complexity of formal grammars and languages
• Interpolated Denumerants and Lambert Series