Title of article
TREE AUTOMATA AND AUTOMATAON LINEAR ORDERI NGS
Author/Authors
Veronique Bruyere، نويسنده , , Olivie r Carton and Geraud Senizergues، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2009
Pages
18
From page
321
To page
338
Abstract
We sh ow t h at t h e i n c lu sion p r ob lem i s d ecid ab le for r at io-n al lan gu ages of word s in d e x e d by scat t e red c ou nt ab le lin ear ord erin gs.Th e m et h o d lean s on a r ed u c t ion t o t h e d ecid ab ility of t h e mon ad ic sec-on d order theory of the infinite binary tree
Keywords
monadic second order logics , finite automata , words over linear orderings-trees
Journal title
RAIRO - Theoretical Informatics and Applications
Serial Year
2009
Journal title
RAIRO - Theoretical Informatics and Applications
Record number
666018
Link To Document