Search
Selected: All

Graph-Controlled Insertion-Deletion Systems

Computer Science – Formal Languages and Automata Theory
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Groups defined by automata

Computer Science – Formal Languages and Automata Theory
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

How much could we cover a set by c.e sets?

Computer Science – Formal Languages and Automata Theory
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Implementing Turing Machines in Dynamic Field Architectures

Computer Science – Formal Languages and Automata Theory
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Independent sets of words and the synchronization problem

Computer Science – Formal Languages and Automata Theory
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Infinite permutations vs. infinite words

Computer Science – Formal Languages and Automata Theory
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Integer Reset Timed Automata: Clock Reduction and Determinizability

Computer Science – Formal Languages and Automata Theory
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Interrupt Timed Automata: verification and expressiveness

Computer Science – Formal Languages and Automata Theory
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Inverse Star, Borders, and Palstars

Computer Science – Formal Languages and Automata Theory
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Isomorphism of regular trees and words

Computer Science – Formal Languages and Automata Theory
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

It Is NL-complete to Decide Whether a Hairpin Completion of Regular Languages Is Regular

Computer Science – Formal Languages and Automata Theory
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Iterated Hairpin Completions of Non-crossing Words

Computer Science – Formal Languages and Automata Theory
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

IUPC: Identification and Unification of Process Constraints

Computer Science – Formal Languages and Automata Theory
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Jancar's formal system for deciding bisimulation of first-order grammars and its non-soundness

Computer Science – Formal Languages and Automata Theory
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

k-Automatic sets of rational numbers

Computer Science – Formal Languages and Automata Theory
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Languages of Dot-depth One over Infinite Words

Computer Science – Formal Languages and Automata Theory
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Late Weak Bisimulation for Markov Automata

Computer Science – Formal Languages and Automata Theory
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Lattices of Logical Fragments over Words

Computer Science – Formal Languages and Automata Theory
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Learning Residual Finite-State Automata Using Observation Tables

Computer Science – Formal Languages and Automata Theory
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Length of the Shortest Word in the Intersection of Regular Languages

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.