The following pages link to Theoretical Computer Science (Q123643):
Displaying 50 items.
- Weighted automata and weighted logics with discounting (Q840767) (← links)
- Defining syntax-directed translations by tree bimorphisms (Q840769) (← links)
- Finite state automata representing two-dimensional subshifts (Q840771) (← links)
- Synchronizing automata preserving a chain of partial orders (Q840772) (← links)
- A computational model for tiling recognizable two-dimensional languages (Q840773) (← links)
- The degree of word-expansion of lexicalized RRWW-automata - A new measure for the degree of nondeterminism of (context-free) languages (Q840776) (← links)
- Backward and forward bisimulation minimization of tree automata (Q840778) (← links)
- General suffix automaton construction algorithm and space bounds (Q840781) (← links)
- Accelerating Boyer-Moore searches on binary texts (Q840783) (← links)
- Probabilistic and nondeterministic aspects of anonymity (Q843094) (← links)
- On determinism in modal transition systems (Q843096) (← links)
- Reactive systems, (semi-)saturated semantics and coalgebras on presheaves (Q843097) (← links)
- An analysis of the exponential decay principle in probabilistic trust models (Q843100) (← links)
- Dynamic matrix rank (Q843102) (← links)
- Causal message sequence charts (Q843103) (← links)
- Configuration structures, event structures and Petri nets (Q843106) (← links)
- Prime algebraicity (Q843107) (← links)
- On stateless multihead automata: hierarchies and the emptiness problem (Q844888) (← links)
- On the stability of sand piles model (Q844890) (← links)
- Comparing notions of randomness (Q844892) (← links)
- On a special class of primitive words (Q844893) (← links)
- Definable transductions and weighted logics for texts (Q844894) (← links)
- When ignorance helps: graphical multicast cost sharing games (Q844895) (← links)
- Energy optimal schedules for jobs with multiple active intervals (Q844896) (← links)
- A shorter proof that palindromes are not a Church-Rosser language, with extensions to almost-confluent and preperfect Thue systems (Q844899) (← links)
- Listing closed sets of strongly accessible set systems with applications to data mining (Q844900) (← links)
- Special issue: Fundamentals of computation theory (FCT 2007). Selected papers based on the presentations at the 16th international symposium, Budapest, Hungary, August 27--30, 2007. (Q845047) (← links)
- On notions of regularity for data languages (Q846359) (← links)
- Complexity issues in color-preserving graph embeddings (Q846361) (← links)
- Extended strings and graphs for simple gene assembly (Q846362) (← links)
- On blockwise symmetric signatures for matchgates (Q846363) (← links)
- Factorization forests for infinite words and applications to countable scattered linear orderings (Q846364) (← links)
- Productivity of stream definitions (Q846366) (← links)
- On the complexity of kings (Q846367) (← links)
- Notions of hyperbolicity in monoids. (Q846368) (← links)
- Real-time reversible iterative arrays (Q846369) (← links)
- Some complexity results for prefix Gröbner bases in free monoid rings (Q846370) (← links)
- Masking traveling beams: optical solutions for NP-complete problems, trading space for time (Q847661) (← links)
- Plateaus can be harder in multi-objective optimization (Q847662) (← links)
- Constants and label-equivalence: a decision procedure for reflexive regular splicing languages (Q847663) (← links)
- Non-confluence in divisionless P systems with active membranes (Q847664) (← links)
- Solving the minimum bisection problem using a biologically inspired computational model (Q847667) (← links)
- Combining overlap and containment for gene assembly in ciliates (Q847668) (← links)
- Spiking neural P systems: an improved normal form (Q847669) (← links)
- Algorithmic properties of ciliate sequence alignment (Q847670) (← links)
- Choosing selection pressure for wide-gap problems (Q847671) (← links)
- Special issue: Formal methods for components and objects. Selected and extended papers based on the presentations at the 3rd international symposium on formal methods for components and objects (FMCO), Leiden, The Netherland, November 2--5, 2004. (Q851703) (← links)
- Special issue: Spatial representation: Discrete vs. continuous computational models. Papers of the workshop, Schloss Dagstuhl, Germany, August 2004. (Q851705) (← links)
- Special issue: Computing and combinatorics. Selected and extended papers based on the presentations at the 10th annual international conference on computing and combinatorics (COCOON 2004, Jeju Island, Korea, August 2004. (Q852479) (← links)
- Special issue: Algorithmic applications in management. Selected papers based on the presentations at the 1st international conference (AAIM 2005), Xi'an, China, June 22--25, 2005. (Q852480) (← links)
