Search
Selected: F

Fast algorithm finding the shortest reset words

Computer Science – Formal Languages and Automata Theory
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Fault Diagnosis with Dynamic Observers

Computer Science – Formal Languages and Automata Theory
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Feasible Automata for Two-Variable Logic with Successor on Data Words

Computer Science – Formal Languages and Automata Theory
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Fife's Theorem for (7/3)-Powers

Computer Science – Formal Languages and Automata Theory
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Fife's Theorem Revisited

Computer Science – Formal Languages and Automata Theory
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Filtrations of Formal Languages by Arithmetic Progressions

Computer Science – Formal Languages and Automata Theory
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Finitary languages

Computer Science – Formal Languages and Automata Theory
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Finite Optimal Control for Time-Bounded Reachability in CTMDPs and Continuous-Time Markov Games

Computer Science – Formal Languages and Automata Theory
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Finite Orbits of Language Operations

Computer Science – Formal Languages and Automata Theory
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Finite-Repetition threshold for infinite ternary words

Computer Science – Formal Languages and Automata Theory
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Finite-State Complexity and the Size of Transducers

Computer Science – Formal Languages and Automata Theory
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Finitely presented monoids with linear Dehn function need not have regular cross-sections

Computer Science – Formal Languages and Automata Theory
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

First-order Fragments with Successor over Infinite Words

Computer Science – Formal Languages and Automata Theory
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

First-Order Quantifiers and the Syntactic Monoid of Height Fragments of Picture Languages

Computer Science – Formal Languages and Automata Theory
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Fixed points avoiding Abelian $k$-powers

Computer Science – Formal Languages and Automata Theory
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Fragments of first-order logic over infinite words

Computer Science – Formal Languages and Automata Theory
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Free inductive K-semialgebras

Computer Science – Formal Languages and Automata Theory
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Free iterative and iteration K-semialgebras

Computer Science – Formal Languages and Automata Theory
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

From Regular to Strictly Locally Testable Languages

Computer Science – Formal Languages and Automata Theory
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Fuzzy Chemical Abstract Machines

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.