Pages that link to "Item:Q3736915"
From MaRDI portal
The following pages link to The complexity of equivalence problems for commutative grammars (Q3736915):
Displayed 10 items.
- On reachability equivalence for BPP-nets (Q1391745) (← links)
- Decidability and complexity for quiescent consistency and its variations (Q1680503) (← links)
- A type checking algorithm for concurrent object protocols (Q1785846) (← links)
- On axioms for commutative regular equations without addition. (Q1853544) (← links)
- Equational theories for automata (Q2074221) (← links)
- Context-free commutative grammars with integer counters and resets (Q2636518) (← links)
- A Fully Equational Proof of Parikh's Theorem (Q4787831) (← links)
- The Parikh Property for Weighted Context-Free Grammars (Q5090971) (← links)
- Operational State Complexity and Decidability of Jumping Finite Automata (Q5384429) (← links)
- State Complexity of Permutation and the Language Inclusion Problem up to Parikh Equivalence on Alphabetical Pattern Constraints and Partially Ordered NFAs (Q6070752) (← links)