Search
Selected: All

Autonomous push-down automaton built on DNA

Computer Science – Formal Languages and Automata Theory
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Bacteria inspired patterns grown with hyperbolic cellular automata

Computer Science – Formal Languages and Automata Theory
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Bisimulations for fuzzy automata

Computer Science – Formal Languages and Automata Theory
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Bottom-up rewriting for words and terms

Computer Science – Formal Languages and Automata Theory
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Bounded Counter Languages

Computer Science – Formal Languages and Automata Theory
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Bounded Languages Meet Cellular Automata with Sparse Communication

Computer Science – Formal Languages and Automata Theory
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Bounded Parikh Automata

Computer Science – Formal Languages and Automata Theory
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Büchi Automata can have Smaller Quotients

Computer Science – Formal Languages and Automata Theory
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Büchi Complementation and Size-Change Termination

Computer Science – Formal Languages and Automata Theory
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Büchi complementation made tight

Computer Science – Formal Languages and Automata Theory
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Bulking II: Classifications of Cellular Automata

Computer Science – Formal Languages and Automata Theory
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Canonizable Partial Order Generators

Computer Science – Formal Languages and Automata Theory
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Cantor Topologies for Finite Words

Computer Science – Formal Languages and Automata Theory
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Capacity Bounded Grammars and Petri Nets

Computer Science – Formal Languages and Automata Theory
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Ciliate Gene Unscrambling with Fewer Templates

Computer Science – Formal Languages and Automata Theory
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Circular Languages Generated by Complete Splicing Systems and Pure Unitary Languages

Computer Science – Formal Languages and Automata Theory
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Circular words and applications

Computer Science – Formal Languages and Automata Theory
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Combinatorial Characterization of Formal Languages

Computer Science – Formal Languages and Automata Theory
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Combinatorics on words in information security: Unavoidable regularities in the construction of multicollision attacks on iterated hash functions

Computer Science – Formal Languages and Automata Theory
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Comparison of Two Context-Free Rewriting Systems with Simple Context-Checking Mechanisms

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.