Search
Selected: R

Random Context and Semi-Conditional Insertion-Deletion Systems

Computer Science – Formal Languages and Automata Theory
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Rankers over Infinite Words

Computer Science – Formal Languages and Automata Theory
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Rational subsets of groups

Computer Science – Formal Languages and Automata Theory
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Reaction Automata

Computer Science – Formal Languages and Automata Theory
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Reactive Safety

Computer Science – Formal Languages and Automata Theory
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Recompression: a simple and powerful technique for word equations

Computer Science – Formal Languages and Automata Theory
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Reduction of fuzzy automata by means of fuzzy quasi-orders

Computer Science – Formal Languages and Automata Theory
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Regular Expressions, au point

Computer Science – Formal Languages and Automata Theory
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Regular Functions, Cost Register Automata, and Generalized Min-Cost Problems

Computer Science – Formal Languages and Automata Theory
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Regular Languages are Church-Rosser Congruential

Computer Science – Formal Languages and Automata Theory
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Regular realizability problems and models of a generalized nondeterminism

Computer Science – Formal Languages and Automata Theory
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Relating timed and register automata

Computer Science – Formal Languages and Automata Theory
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Relation between the Usual Order and the Enumeration Orders of Elements of r.e. Sets

Computer Science – Formal Languages and Automata Theory
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Remarks on separating words

Computer Science – Formal Languages and Automata Theory
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Remembering Chandra Kintala

Computer Science – Formal Languages and Automata Theory
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Representing Real Numbers in a Generalized Numeration Systems

Computer Science – Formal Languages and Automata Theory
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Representing Small Ordinals by Finite Automata

Computer Science – Formal Languages and Automata Theory
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Restarting Automata with Auxiliary Symbols and Small Lookahead

Computer Science – Formal Languages and Automata Theory
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0
  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.