scientific article; zbMATH DE number 4001487
From MaRDI portal
Publication:4727433
zbMath0617.68050MaRDI QIDQ4727433
Publication date: 1986
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Complexity of computation (including implicit computational complexity) (03D15) Recursive functions and relations, subrecursive hierarchies (03D20)
Related Items (8)
Some complexity bounds for problems concerning finite and 2-dimensional vector addition systems with states ⋮ Context-free commutative grammars with integer counters and resets ⋮ Completeness results for conflict-free vector replacement systems ⋮ On reachability equivalence for BPP-nets ⋮ Operational State Complexity and Decidability of Jumping Finite Automata ⋮ A Framework for Classical Petri Net Problems: Conservative Petri Nets as an Application ⋮ Normal and sinkless Petri nets ⋮ Equational theories for automata
This page was built for publication:
