The following pages link to Quasi-realtime languages (Q5582342):
Displayed 50 items.
- Weighted restarting automata and pushdown relations (Q287429) (← links)
- Observations on complete sets between linear time and polynomial time (Q627129) (← links)
- Quasi-rocking real-time pushdown automata (Q650904) (← links)
- Syntactic operators on full semiAFLs (Q758321) (← links)
- Partial commutations and faithful rational transductions (Q799383) (← links)
- A note on: `Deque automata and a subfamily of context-sensitive languages which contains all semilinear bounded languages' (by K. Ayers) (Q1097706) (← links)
- Representations of language families by homomorphic equality operations and generalized equality sets (Q1099633) (← links)
- Alternating real-time computations (Q1111386) (← links)
- Simulating two pushdown stores by one tape in \(O(n^{1.5}\,\sqrt{\log \,n})\) time (Q1113670) (← links)
- Some considerations about NPRIORITY(1) without ROM (Q1113673) (← links)
- On nontrivial separators for \(k\)-page graphs and simulations by nondeterministic one-tape Turing machines (Q1122982) (← links)
- Dynamical recognizers: real-time language recognition by analog computers (Q1129007) (← links)
- Reset machines (Q1136756) (← links)
- Multiple equality sets and Post machines (Q1148696) (← links)
- Complexity of algorithms and computations (Q1153141) (← links)
- Diagonalization, uniformity, and fixed-point theorems (Q1201287) (← links)
- Comparing complexity classes (Q1227731) (← links)
- On the pre-AFL of \([lg\;n]\) space and related families of languages (Q1231780) (← links)
- Control sets on context-free grammar forms (Q1238638) (← links)
- One way finite visit automata (Q1242687) (← links)
- Stack languages and log n space (Q1250712) (← links)
- Remarks on blind and partially blind one-way multicounter machines (Q1251070) (← links)
- A useful lemma for context-free programmed grammars (Q1256864) (← links)
- Language complexity of rotations and Sturmian sequences (Q1274922) (← links)
- Separating classes in the exponential-time hierarchy from classes in PH (Q1365687) (← links)
- Refining the hierarchy of blind multicounter languages and twist-closed trios. (Q1427852) (← links)
- Realtime subshifts (Q1566732) (← links)
- Deterministic Turing machines in the range between real-time and linear-time. (Q1853527) (← links)
- Computational power of one-way Turing machines with sublogarithmic memory restrictions (Q2262923) (← links)
- Time- and tape-bounded Turing acceptors and AFLs (Q2542726) (← links)
- Time-bounded grammars and their languages (Q2548174) (← links)
- On the extension of Gladkij's theorem and the hierarchies of languages (Q2557560) (← links)
- Real-time language recognition by one-dimensional cellular automata (Q2563020) (← links)
- Non-deterministic cellular automata and languages (Q2869781) (← links)
- On characterisation of language families in terms of inverse morphisms (Q3343457) (← links)
- The role of rudimentary relations in complexity theory (Q3347299) (← links)
- SHRINKING RESTARTING AUTOMATA (Q3434280) (← links)
- Consensus Game Acceptors (Q3451093) (← links)
- (Q3657451) (← links)
- Uniform simulations of nondeterministic real time multitape turing machines (Q3771615) (← links)
- (Q3873564) (← links)
- Compelled operations and operations of degreeP (Q3890132) (← links)
- Some formal results about stratificational grammars and their relevance to linguistics (Q3968471) (← links)
- (Q4125808) (← links)
- (Q4125809) (← links)
- (Q4170259) (← links)
- Real-time computations with restricted nondeterminism (Q4197340) (← links)
- Some restrictions onW-grammars (Q4776853) (← links)
- Two-way automata and length-preserving homomorphisms (Q4879206) (← links)
- State-complexity of finite-state devices, state compressibility and incompressibility (Q5289271) (← links)