Login / Signup

Expressive Equivalence and Succinctness of Parametrized Automata with Respect to Finite Memory Automata.

Tushant JhaWalid BelkhirYannick ChevalierMichaël Rusinowitch
Published in: ICSOC Workshops (2015)
Keyphrases
  • finite automata
  • probabilistic automata
  • cellular automata
  • finite state machines
  • finite state
  • tree automata
  • lattice gas
  • regular expressions
  • database
  • modal logic
  • computing power
  • formal language theory