Weighted tree automata with constraints (Q2164002)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Weighted tree automata with constraints	scientific article

Statements

scholarly article

0 references

Weighted tree automata with constraints (English)

0 references

Andreas Maletti

0 references

Andreea-Teodora Nász

0 references

publication date

11 August 2022

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-031-05578-2_18

0 references

Equality and disequality constraints on direct subterms in tree automata

0 references

Implementation and Application of Automata

0 references

0 references

0 references

Tree acceptors and some of their applications

0 references

Grammatical picture generation. A tree-based approach. With CD-ROM.

0 references

The Supports of Weighted Unranked Tree Automata

0 references

0 references

0 references

Weighted Tree Automata and Tree Transducers

0 references

0 references

0 references

0 references

0 references

The Support of a Recognizable Series over a Zero-sum Free, Commutative Semiring is Recognizable

0 references

0 references

0 references

On the definition of a family of automata

0 references

Characterizing derivation trees of context-free grammars through a generalization of finite automata theory

0 references

Generalized finite automata theory with an application to a decision problem of second-order logic

0 references

Tree Automata, (Dis-)Equality Constraints and Term Rewriting

0 references

0 references

Compiler Design

0 references

Identifiers

10.1007/978-3-031-05578-2_18

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2164002

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2164002&oldid=36841581"