Name
Abstract | ||
|---|---|---|
We show that the inclusion problem is decidable for rational languages of words indexed by scattered countable linear orderings. The method leans on a reduction to the decidability of the monadic second order theory of the infinite binary tree [9]. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1051/ita/2009009 | RAIRO-THEORETICAL INFORMATICS AND APPLICATIONS |
Keywords | Field | DocType |
Finite automata,words over linear orderings-trees,monadic second order logics | Discrete mathematics,Combinatorics,Countable set,Automaton,Binary tree,Finite-state machine,Decidability,Tree automaton,Monadic predicate calculus,Monad (functional programming),Mathematics | Journal |
Volume | Issue | ISSN |
43 | 2 | 0988-3754 |
Citations | PageRank | References |
4 | 0.56 | 2 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Véronique Bruyère | 1 | 429 | 43.59 |
| Olivier Carton | 2 | 381 | 40.97 |
| Géraud Sénizergues | 3 | 297 | 27.79 |