
Expressive power of pebbles Automata
Author(s) -
Mikołaj Bojańczyk,
Mathias Samuelides,
Thomas Schwentick,
Luc Segoufin
Publication year - 2006
Publication title -
hal (le centre pour la communication scientifique directe)
Language(s) - Uncategorized
Resource type - Conference proceedings
Subject(s) - nondeterministic algorithm , automaton , expressive power , tree (set theory) , nondeterministic finite automaton , tree automaton , computer science , discrete mathematics , regular language , deterministic automaton , nested word , automata theory , theoretical computer science , mathematics , quantum finite automata , combinatorics