Regular Languages of Words Over Countable Linear Orderings
Main Authors: | Carton, O, Colcombet, T, Puppis, G |
---|---|
Format: | Journal article |
Published: |
2011
|
Similar Items
-
Bounded reparability for regular tree languages
by: Puppis, G, et al.
Published: (2012) -
The monadic second order theory of all countable ordinals /
by: 359235 Buchi, J. Richard, et al.
Published: (1984) -
Transience in countable MDPs
by: Kiefer, SM, et al.
Published: (2021) -
Monotone countable paracompactness
by: Good, C, et al.
Published: (2000) -
The point−countable base problem
by: Rosoce, A, et al.
Published: (1990)