Search
Selected: All

A Saturation Method for the Modal Mu-Calculus with Backwards Modalities over Pushdown Systems

Computer Science – Formal Languages and Automata Theory
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

A Short Decidability Proof for DPDA Language Equivalence via First-Order Grammars

Computer Science – Formal Languages and Automata Theory
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

A state of a dynamic computational structure distributed in an environment: a model and its corollaries

Computer Science – Formal Languages and Automata Theory
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

A Sufficient Condition for Hanna Neumann Property of Submonoids of a Free Monoid

Computer Science – Formal Languages and Automata Theory
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

A Tighter Bound for the Determinization of Visibly Pushdown Automata

Computer Science – Formal Languages and Automata Theory
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

A Type System for a Stochastic CLS

Computer Science – Formal Languages and Automata Theory
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

A unifying approach to picture grammars

Computer Science – Formal Languages and Automata Theory
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

A weakly universal cellular automaton in the hyperbolic 3D space with three states

Computer Science – Formal Languages and Automata Theory
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Abelian Primitive Words

Computer Science – Formal Languages and Automata Theory
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Abelian returns in Sturmian words

Computer Science – Formal Languages and Automata Theory
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

About the embedding of one dimensional cellular automata into hyperbolic cellular automata

Computer Science – Formal Languages and Automata Theory
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Absoluteness of subword inequality is undecidable

Computer Science – Formal Languages and Automata Theory
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Adaptive Scheduling of Data Paths using Uppaal Tiga

Computer Science – Formal Languages and Automata Theory
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Algebraic Linear Orderings

Computer Science – Formal Languages and Automata Theory
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Algebraic Ordinals

Computer Science – Formal Languages and Automata Theory
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Algebraic properties of structured context-free languages: old approaches and novel developments

Computer Science – Formal Languages and Automata Theory
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Algorithms for computing the greatest simulations and bisimulations between fuzzy automata

Computer Science – Formal Languages and Automata Theory
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Algorithms for Glushkov K-graphs

Computer Science – Formal Languages and Automata Theory
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Almost Linear Büchi Automata

Computer Science – Formal Languages and Automata Theory
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Almost overlap-free words and the word problem for the free Burnside semigroup satisfying x^2=x^3

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.