Basic notions of universal algebra for language theory and graph grammars (Q671349): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: ALGOL 60 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algebraic theory of graph reduction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Easy problems for tree-decomposable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Un théorème de duplication pour les forets algébriques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4273664 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph expressions and graph rewritings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5762080 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5611784 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the existence of minimum asynchronous automata and on the equivalence problem for unambiguous regular trace languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asynchronous mappings and asynchronous cellular automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equivalences and transformations of regular systems - applications to recursive program schemes and grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: An axiomatic definition of context-free rewriting and its application to NLC graph grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3993363 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385531 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385535 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The monadic second-order logic of graphs. I: Recognizable sets of finite graphs / 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: The monadic second-order logic of graphs. VII: Graphs as relational structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4273663 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4273871 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizable sets of graphs: equivalent definitions and closure properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structural properties of context-free sets of graphs generated by vertex replacement / rank
 
Normal rank
Property / cites work
 
Property / cites work: Handle-rewriting hypergraph grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monadic second-order evaluations on tree-decomposable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The IO- and OI-hierarchies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385532 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3221381 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4079524 / rank
 
Normal rank
Property / cites work
 
Property / cites work: IO and OI. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4179852 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two Families of Languages Related to ALGOL / rank
 
Normal rank
Property / cites work
 
Property / cites work: Initial Algebra Semantics and Continuous Algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3738547 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hyperedge replacement: grammars and languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4023825 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed point theorems and semantics: A folk tale / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tools for proving inductive equalities, relative completeness, and \(\omega\)-completeness / rank
 
Normal rank
Property / cites work
 
Property / cites work: On generalized language equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic automata and context-free sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Easy multiplications. I: The realm of Kleene's theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Commutative Regular Equations and Parikh's Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3926047 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4002149 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385539 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Notes on finite asynchronous automata / rank
 
Normal rank

Latest revision as of 10:57, 27 May 2024

scientific article
Language Label Description Also known as
English
Basic notions of universal algebra for language theory and graph grammars
scientific article

    Statements

    Basic notions of universal algebra for language theory and graph grammars (English)
    0 references
    0 references
    27 February 1997
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    recognizable subsets of general algebras
    0 references
    regular languages
    0 references
    equational subsets
    0 references
    context-free languages
    0 references
    graph grammars
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references