Algebraic automata and context-free sets

Cited In (75)

The star problem and the finite power property in trace monoids: Reductions beyond C4
Recognizability of graph and pattern languages
Recognizability, hypergraph operations, and logical types
Decidability and complexity of simultaneous rigid E-unification with one variable and related results
Macro tree transducers
Natural state transformations
A structural/temporal query language for business processes
Definable transductions and weighted logics for texts
Equational tree transformations
Theory of formal grammars
Basic notions of universal algebra for language theory and graph grammars
Object grammars and bijections.
Monadic second-order definable text languages
Nondeterministic operations on finite relational structures
IO and OI. II
Tree algebras and varieties of tree languages
Algebraic linear orderings
Equivalences and transformations of regular systems - applications to recursive program schemes and grammars
Rationality in algebras with a series operation
Variable tree automata over infinite ranked alphabets
A comparison of tree transductions defined by monadic second order logic and by attribute grammars
Equivalent definitions of recognizability for sets of graphs of bounded tree-width
Finite loops recognize exactly the regular open languages
Generalized sequential machine maps
Attributed tree grammars
IO and OI. I
The IO- and OI-hierarchies
Fuzzy tree automata
An axiomatic definition of context-free rewriting and its application to NLC graph grammars
Decidability of the finiteness of ranges of tree transductions
Handle-rewriting hypergraph grammars
A geometrical view of the determinization and minimization of finite-state automata
Context-sensitive string languages and recognizable picture languages
The generative power of delegation networks
Pebble machines and tree walking machines
Graph expressions and graph rewritings
Logical description of context-free graph languages
Series-parallel languages and the bounded-width property
Tree-based picture generation
A model theoretic description of tree adjoining grammars
The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
BOOLEAN FUZZY SETS
MSO definable text languages
Conservative groupoids recognize only regular languages
Expressive power of typed and type-free programming languages
Equational weighted tree transformations
Context-free hypergraph grammars have the same term-generating power as attribute grammars
The recognizability of sets of graphs is a robust property
Recognizable sets of graphs: equivalent definitions and closure properties
Existential MSO over two successors is strictly weaker than over linear orders
The monadic second-order logic of graphs. V: On closing the gap between definability and recognizability
A Mezei-Wright theorem for categorical algebras
Algebraic recognizability of regular tree languages
Extended linear macro grammars, iteration grammars, and register programs
Recursion-closed algebraic theories
Adaptive star grammars and their languages
On rational definitions in complete algebras without rank
Recognizability in the Simply Typed Lambda-Calculus
The monadic second-order logic of graphs. IX: Machines and their behaviours
Mappings and grammars on trees
Recursive queries and context-free graph grammars
Equational weighted tree transformations with discounting
An operational and denotational approach to non-context-freeness
On characterization of fuzzy tree pushdown automata
Bottom-up unranked tree-to-graph transducers for translation into semantic graphs
On the power of local graph expansion grammars with and without additional restrictions
Title not available (Why is that?)
Logics and Automata for Totally Ordered Trees
Stone duality, topological algebra, and recognition.
Efficient enumeration of weighted tree languages over the tropical semiring
Title not available (Why is that?)
The monadic second-order logic of graphs : Definable sets of finite graphs
The HOM problem is EXPTIME-complete
An algebraic characterization of semirings for which the support of every recognizable series is recognizable
An Algebraic Characterization of Semirings for Which the Support of Every Recognizable Series Is Recognizable

This page was built for publication: Algebraic automata and context-free sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5536635)