Pages that link to "Item:Q1872706"
From MaRDI portal
The following pages link to Some decision problems concerning semilinearity and commutation. (Q1872706):
Displaying 34 items.
- The effect of end-markers on counter machines and commutativity (Q265080) (← links)
- On sets of numbers accepted by P/T systems composed by join (Q410705) (← links)
- Bounded underapproximations (Q453533) (← links)
- On the complexity of decidable cases of the commutation problem of languages (Q557812) (← links)
- Families of languages defined by ciliate bio-operations (Q596126) (← links)
- On the computational complexity of membrane systems (Q596128) (← links)
- One-reversal counter machines and multihead automata: revisited (Q714812) (← links)
- On the solvability of a class of Diophantine equations and applications (Q818150) (← links)
- On spiking neural P systems and partially blind counter machines (Q926511) (← links)
- Characterizations of some classes of spiking neural P systems (Q1035724) (← links)
- Visibly pushdown transducers (Q1672009) (← links)
- On the complexity and decidability of some problems involving shuffle (Q1706154) (← links)
- Accepting runs in a two-way finite automaton (Q1753992) (← links)
- On membrane hierarchy in P systems (Q1779299) (← links)
- On store languages of language acceptors (Q1786598) (← links)
- Subword histories and Parikh matrices (Q1878676) (← links)
- Relationships between bounded languages, counter machines, finite-index grammars, ambiguity, and commutative regularity (Q1998865) (← links)
- Visit-bounded stack automata (Q2163998) (← links)
- On families of full trios containing counter machine languages (Q2333810) (← links)
- Playing with Conway's problem (Q2378537) (← links)
- Deletion operations on deterministic families of automata (Q2407104) (← links)
- On store languages and applications (Q2417850) (← links)
- On counting functions and slenderness of languages (Q2422037) (← links)
- On composition and lookahead delegation of \(e\)-services modeled by automata (Q2566017) (← links)
- On Families of Full Trios Containing Counter Machine Languages (Q2817390) (← links)
- On Bounded Semilinear Languages, Counter Machines, and Finite-Index ET0L (Q2830214) (← links)
- One-Reversal Counter Machines and Multihead Automata: Revisited (Q3075514) (← links)
- A sharpening of the Parikh mapping (Q3147022) (← links)
- On the Boundedness Property of Semilinear Sets (Q4922123) (← links)
- Input-Position-Restricted Models of Language Acceptors (Q5112180) (← links)
- Semilinearity of Families of Languages (Q5859668) (← links)
- Variations of checking stack automata: obtaining unexpected decidability properties (Q5915651) (← links)
- On spiking neural P systems (Q5962071) (← links)
- Visit-bounded stack automata (Q6056625) (← links)
