scientific article; zbMATH DE number 3329919
From MaRDI portal
Publication:5608007
Cited in
(21)- Recursive categoricity and recursive stability
- Ehrenfeucht games and ordinal addition
- Logic over words on denumerable ordinals
- Star-free sets of words on ordinals
- Complementation of rational sets on scattered linear orderings of finite rank
- Tree acceptors and some of their applications
- Complementation of Branching Automata for Scattered and Countable Series-Parallel Posets
- Theories of orders on the set of words
- Transfinite Lyndon words
- Schützenberger and Eilenberg theorems for words on linear orderings
- Complementation of Branching Automata for Scattered and Countable N-Free Posets
- Axiomatizing omega and omega-op powers of words
- Transfinite Lyndon words
- Decision methods in the theory of ordinals
- Non-emptiness test for automata over words indexed by the reals and rationals
- Exact complexity bounds for ordinal addition
- On the expansion of monadic second-order logic with Cantor-Bendixson rank and order type predicates
- Deciding reachability in automata on words indexed by the reals and rationals
- Test sets for equality of terms in the additive structure of ordinals augmented with right multiplication by
- Factorization forests for infinite words and applications to countable scattered linear orderings
- Automata on linear orderings
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5608007)
