The following pages link to (Q3862379):
Displaying 50 items.
- New developments in structural complexity theory (Q913509) (← links)
- New techniques for proving the decidability of equivalence problem (Q913523) (← links)
- Downward translations of equality (Q914368) (← links)
- Semantics of types for database objects (Q915443) (← links)
- Kolmogorov complexity and degrees of tally sets (Q916650) (← links)
- On the complexity of 1-tape ATMs and off-line 1-tape ATMs running in constant reversals (Q917283) (← links)
- A uniform method for proving lower bounds on the computational complexity of logical theories (Q917543) (← links)
- CCS expressions, finite state processes, and three problems of equivalence (Q918211) (← links)
- Defining, analysing and implementing communication protocols using attribute grammars (Q919803) (← links)
- Extended regular expressions of star degree at most two (Q921911) (← links)
- Reasoning about XML update constraints (Q923878) (← links)
- Learning and extending sublanguages (Q924178) (← links)
- Regular expression constrained sequence alignment (Q925058) (← links)
- Learning languages from positive data and negative counterexamples (Q927865) (← links)
- On some questions regarding \(k\)-regular and \(k\)-context-free sequences (Q930914) (← links)
- Computation of distances for regular and context-free probabilistic languages (Q932320) (← links)
- Physical limits of inference (Q933440) (← links)
- Verification of evolving software via component substitutability analysis (Q934712) (← links)
- Multiple pattern matching: a Markov chain approach (Q938109) (← links)
- Embedding finite automata within regular expressions (Q947783) (← links)
- Commutation-augmented pregroup grammars and push-down automata with cancellation (Q948066) (← links)
- Computational complexity of dynamical systems: the case of cellular automata (Q948080) (← links)
- Generalizations of 1-deterministic regular languages (Q948081) (← links)
- State complexity of basic language operations combined with reversal (Q948089) (← links)
- Membrane systems with proteins embedded in membranes (Q953537) (← links)
- Approximation and universality of fuzzy Turing machines (Q954457) (← links)
- Universal automata and NFA learning (Q954990) (← links)
- Monoid generalizations of the Richard Thompson groups. (Q958127) (← links)
- Machine semantics (Q959818) (← links)
- On the expressiveness of interaction (Q960859) (← links)
- A search algorithm for subshift attractors of cellular automata (Q968269) (← links)
- Modelling programmed frameshifting with frameshift machines (Q968400) (← links)
- Conformant plans and beyond: principles and complexity (Q969534) (← links)
- State fusion of fuzzy automata with application on target tracking (Q971574) (← links)
- Finite automata based algorithms on subsequences and supersequences of degenerate strings (Q972350) (← links)
- A characterization of the entropies of multidimensional shifts of finite type (Q974081) (← links)
- \((\alpha,\beta)\)-fuzzy ideals of hemirings (Q980071) (← links)
- The IELR(1) algorithm for generating minimal LR(1) parser tables for non-LR(1) grammars with conflict resolution (Q988183) (← links)
- On the complexity of checking semantic equivalences between pushdown processes and finite-state processes (Q988552) (← links)
- On the separability of sparse context-free languages and of bounded rational relations (Q995585) (← links)
- Translational lemmas for DLOGTIME-uniform circuits, alternating TMs, and PRAMs (Q995752) (← links)
- Characterizing turbulence in globally coupled maps with stochastic finite automata (Q997914) (← links)
- Interacting with an artificial partner: modeling the role of emotional aspects (Q999435) (← links)
- Some algebraic properties of measure-once two-way quantum finite automata (Q1007122) (← links)
- Weakly regular quantum grammars and asynchronous quantum automata (Q1013764) (← links)
- On the dynamics and recursive properties of multidimensional symbolic systems (Q1016235) (← links)
- Don't care words with an application to the automata-based approach for real addition (Q1028730) (← links)
- Anyone but him: the complexity of precluding an alternative (Q1028907) (← links)
- State complexity of basic operations on suffix-free regular languages (Q1029324) (← links)
- The Parikh counting functions of sparse context-free languages are quasi-polynomials (Q1034637) (← links)
