Pages that link to "Item:Q1251070"
From MaRDI portal
The following pages link to Remarks on blind and partially blind one-way multicounter machines (Q1251070):
Displaying 50 items.
- Thompson's group \(F\) is 1-counter graph automatic. (Q285894) (← links)
- \(\mathcal C\)-graph automatic groups. (Q403809) (← links)
- Counter machines, Petri nets, and consensual computation (Q517037) (← links)
- P systems with minimal insertion and deletion (Q616500) (← links)
- Remarks on two-way automata with weak-counters (Q793509) (← links)
- On spiking neural P systems and partially blind counter machines (Q926511) (← links)
- Asynchronous spiking neural P systems (Q1019715) (← links)
- Characterizations of some classes of spiking neural P systems (Q1035724) (← links)
- Rational subsets of polycyclic monoids and valence automata (Q1041050) (← links)
- Extending regular expressions with iterated shuffle (Q1063422) (← links)
- On the power of alternation in automata theory (Q1068537) (← links)
- CTS systems and Petri nets (Q1085981) (← links)
- Reversal-bounded nondeterministic multicounter machines and complementation (Q1094884) (← links)
- Reset machines (Q1136756) (← links)
- One-way weak-stack-counter automata (Q1137874) (← links)
- The power of synchronizing operations on strings (Q1161057) (← links)
- Two-way deterministic multi-weak-counter machines (Q1165028) (← links)
- Place/transition nets with debit arcs (Q1186570) (← links)
- \(X\)-automata on \(\omega\)-words (Q1210539) (← links)
- A uniform approach to true-concurrency and interleaving semantics for Petri nets (Q1274975) (← links)
- Nonterminal complexity of programmed grammars. (Q1401269) (← links)
- Refining the hierarchy of blind multicounter languages and twist-closed trios. (Q1427852) (← links)
- Sequential grammars and automata with valences (Q1605318) (← links)
- A well-structured framework for analysing Petri net extensions (Q1763373) (← links)
- On the sentence valuation in a semiring (Q1810466) (← links)
- On some bounded semiAFLs and AFLs (Q1837538) (← links)
- Langages à un compteur (Q1838045) (← links)
- From regulated rewriting to computing with membranes: collapsing hierarchies (Q1884943) (← links)
- The conformon-P system: a molecular and cell biology-inspired computability model (Q1884951) (← links)
- The fixed point problem of a simple reversible language (Q1989327) (← links)
- Relationships between bounded languages, counter machines, finite-index grammars, ambiguity, and commutative regularity (Q1998865) (← links)
- General decidability results for asynchronous shared-memory programs: higher-order and beyond (Q2044219) (← links)
- Reachability problems in low-dimensional nondeterministic polynomial maps over integers (Q2051802) (← links)
- Finite transducers and rational transductions (Q2074205) (← links)
- On the group memory complexity of extended finite automata over groups (Q2210871) (← links)
- A class of restricted P colonies with string environment (Q2311263) (← links)
- On families of full trios containing counter machine languages (Q2333810) (← links)
- Characterization and complexity results on jumping finite automata (Q2357104) (← links)
- On Boolean closed full trios and rational Kripke frames (Q2363961) (← links)
- On counting functions and slenderness of languages (Q2422037) (← links)
- Computation power of asynchronous spiking neural P systems with polarizations (Q2422045) (← links)
- On the topological complexity of \(\omega\)-languages of non-deterministic Petri nets (Q2446063) (← links)
- A multiset-based model of synchronizing agents: Computability and robustness (Q2474434) (← links)
- On partially blind multihead finite automata. (Q2490819) (← links)
- Word problems recognisable by deterministic blind monoid automata (Q2508978) (← links)
- Interference automata (Q2518378) (← links)
- Context-free commutative grammars with integer counters and resets (Q2636518) (← links)
- Geodesic growth in virtually abelian groups (Q2659140) (← links)
- Recent advances on reachability problems for valence systems (invited talk) (Q2695487) (← links)
- Finite automata over free groups (Q2709977) (← links)
