Sciweavers

Share
12 search results - page 1 / 3
» Synchronizing Automata over Nested Words
Sort
View
ICALP
2007
Springer
10 years 2 months ago
Regular Languages of Nested Words: Fixed Points, Automata, and Synchronization
Abstract. Nested words are a restriction of the class of visibly pushdown languages that provide a natural model of runs of programs with recursive procedure calls. The usual conne...
Marcelo Arenas, Pablo Barceló, Leonid Libki...
FOSSACS
2016
Springer
4 years 4 months ago
Synchronizing Automata over Nested Words
Abstract. We extend the concept of a synchronizing word from ļ¬nitestate automata (DFA) to nested word automata (NWA): A well-matched nested word is called synchronizing if it res...
Dmitry Chistikov, Pavel Martyugin, Mahsa Shirmoham...
CSR
2007
Springer
10 years 2 months ago
Marrying Words and Trees
Traditionally, data that has both linear and hierarchical structure, such as annotated linguistic data, is modeled using ordered trees and queried using tree automata. In this pap...
Rajeev Alur
FCT
2007
Springer
9 years 11 months ago
Factorisation Forests for Infinite Words
The theorem of factorisation forests shows the existence of nested factorisations -- a la Ramsey -- for finite words. This theorem has important applications in semigroup theory, a...
Thomas Colcombet
TCS
2010
9 years 2 months ago
Factorization forests for infinite words and applications to countable scattered linear orderings
The theorem of factorization forests of Imre Simon shows the existence of nested factorizations -- `a la Ramsey -- for finite words. This theorem has important applications in sem...
Thomas Colcombet
books