Algebraic automata and context-free sets
From MaRDI portal
Publication:5536635
Cited in
(75)- Recognizability in the Simply Typed Lambda-Calculus
- Recursive queries and context-free graph grammars
- Mappings and grammars on trees
- The star problem and the finite power property in trace monoids: Reductions beyond C4
- Recognizability of graph and pattern languages
- Equational weighted tree transformations with discounting
- 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
- An operational and denotational approach to non-context-freeness
- A structural/temporal query language for business processes
- On characterization of fuzzy tree pushdown automata
- 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
- Tree algebras and varieties of tree languages
- IO and OI. II
- 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
- Bottom-up unranked tree-to-graph transducers for translation into semantic graphs
- 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
- On the power of local graph expansion grammars with and without additional restrictions
- 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
- Logical description of context-free graph languages
- scientific article; zbMATH DE number 7204410 (Why is no real title available?)
- Series-parallel languages and the bounded-width property
- Graph expressions and graph rewritings
- Tree-based picture generation
- Logics and Automata for Totally Ordered Trees
- Conservative groupoids recognize only regular languages
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- A model theoretic description of tree adjoining grammars
- Expressive power of typed and type-free programming languages
- Equational weighted tree transformations
- BOOLEAN FUZZY SETS
- MSO definable text languages
- Context-free hypergraph grammars have the same term-generating power as attribute grammars
- The recognizability of sets of graphs is a robust property
- Existential MSO over two successors is strictly weaker than over linear orders
- Recognizable sets of graphs: equivalent definitions and closure properties
- The monadic second-order logic of graphs. V: On closing the gap between definability and recognizability
- A Mezei-Wright theorem for categorical algebras
- Stone duality, topological algebra, and recognition.
- Efficient enumeration of weighted tree languages over the tropical semiring
- scientific article; zbMATH DE number 7136663 (Why is no real title available?)
- The monadic second-order logic of graphs : Definable sets of finite graphs
- 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
- The HOM problem is EXPTIME-complete
- On rational definitions in complete algebras without rank
- 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
- The monadic second-order logic of graphs. IX: Machines and their behaviours
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)
