Factorization forests for infinite words and applications to countable scattered linear orderings (Q846364): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2009.10.013 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2127106488 / rank
 
Normal rank
Property / cites work
 
Property / cites work: R-Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logic and Rational Languages of Words Indexed by Linear Orderings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata, Semigroups and Recognizability of Words on Ordinals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3838998 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An interesting combinatorial method in the theory of locally finite semigroups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4779147 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5608007 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weak Second‐Order Arithmetic and Finite Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5525343 / rank
 
Normal rank
Property / cites work
 
Property / cites work: COMPLEMENTATION OF RATIONAL SETS ON COUNTABLE SCATTERED LINEAR ORDERINGS / rank
 
Normal rank
Property / cites work
 
Property / cites work: On factorization forests of finite height / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite automata, definable sets, and regular expressions over \(\omega^n\)- tapes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factorisation Forests for Infinite Words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modest theory of short chains. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modest theory of short chains. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for determining relative star height and star height / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Height of Factorization Forests / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3853827 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing and generating infinite sequences by a finite automaton / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3123633 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5317419 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3769981 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equations Defining the Polynomial Closure of a Lattice of Regular Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial closure and unambiguous product / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decidability of Second-Order Theories and Automata on Infinite Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5541339 / rank
 
Normal rank
Property / cites work
 
Property / cites work: $ℵ_0$-categoricity of linear orderings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factorization forests of finite height / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4036596 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3691083 / rank
 
Normal rank

Latest revision as of 11:25, 2 July 2024

scientific article
Language Label Description Also known as
English
Factorization forests for infinite words and applications to countable scattered linear orderings
scientific article

    Statements

    Factorization forests for infinite words and applications to countable scattered linear orderings (English)
    0 references
    0 references
    9 February 2010
    0 references
    0 references
    formal languages
    0 references
    semigroups
    0 references
    infinite words
    0 references
    automata
    0 references
    factorization trees
    0 references
    0 references