Towards a language theory for infinite N-free pomsets. (Q1874399): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4313087 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The monadic second-order logic of graphs. V: On closing the gap between definability and recognizability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monadic second-order definable graph transductions: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Axiomatizing the subsumption and subword preorders on finite and infinite partial words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4737909 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3666827 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The equational theory of pomsets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3922196 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modest theory of short chains. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4003410 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monadic second-order definable text languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizability equals definability for partial k-paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2754184 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2762523 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4737908 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Application of model theoretic games to discrete linear orders and finite automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4381404 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4381401 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Series-parallel languages and the bounded-width property / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rationality in algebras with a series operation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5641083 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3698327 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3123633 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modulo-counting quantifiers over finite trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4284261 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modeling concurrency with partial orders / rank
 
Normal rank
Property / cites work
 
Property / cites work: On finite monoids having only trivial subgroups / rank
 
Normal rank
Property / cites work
 
Property / cites work: The monadic theory of order / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4741710 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Star-free regular sets of ω-sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: A combinatorial approach to the theory of ω-automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4362730 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4714446 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 16:53, 5 June 2024

scientific article
Language Label Description Also known as
English
Towards a language theory for infinite N-free pomsets.
scientific article

    Statements

    Towards a language theory for infinite N-free pomsets. (English)
    0 references
    0 references
    25 May 2003
    0 references
    0 references
    recognizable languages
    0 references
    finite words
    0 references