Multitree automata that count

DOI10.1016/J.TCS.2004.10.023MaRDI QIDQ1770418zbMATH OpenOpenAlexFDO

Authors D. Lugiez

Publication date 6 April 2005

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2004.10.023

zbMATH Keywords

Presburger arithmeticLogicFormal languagesTree-automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05)

Recommendations

• scientific article; zbMATH DE number 1956522
• Automata on infinite trees with counting constraints
• Automata on infinite trees with counting constraints
• scientific article
• Tree automata
• Learning Multiplicity Tree Automata
• Automata on finite trees
• Trees in partial higher dimensional automata

Cites work

• scientific article; zbMATH DE number 3921983 (Why is no real title available?)
• scientific article; zbMATH DE number 3501006 (Why is no real title available?)
• scientific article; zbMATH DE number 1956522 (Why is no real title available?)
• scientific article; zbMATH DE number 2043529 (Why is no real title available?)
• scientific article; zbMATH DE number 2043533 (Why is no real title available?)
• scientific article; zbMATH DE number 1841842 (Why is no real title available?)
• scientific article; zbMATH DE number 2090317 (Why is no real title available?)
• scientific article; zbMATH DE number 1414314 (Why is no real title available?)
• scientific article; zbMATH DE number 3293666 (Why is no real title available?)
• Alternating two-way AC-tree automata
• Définition et etude des Bilangages réguliers
• Equality and disequality constraints on direct subterms in tree automata
• Feature automata and recognizable sets of feature trees
• Logic and p-recognizable sets of integers
• Pumping, cleaning and symbolic constraints solving
• Rewriting in the partial algebra of typed terms modulo AC
• Semigroups, Presburger formulas, and languages
• The computational complexity of logical theories
• The first order properties of products of algebraic systems
• The theory of integer multiplication with order restricted to primes is decidable
• Tree automata help one to solve equational formulae in AC-theories

Cited in

(10)

• Efficient automated reasoning about sets and multisets with cardinality constraints
• scientific article; zbMATH DE number 1956522 (Why is no real title available?)
• Counting in trees
• Fractional Collections with Cardinality Bounds, and Mixed Linear Arithmetic with Stars
• XML schema, tree logic and sheaves automata
• Tree Automata for Non-linear Arithmetic
• Linear Arithmetic with Stars
• Decision Procedures for Multisets with Cardinality Constraints
• MUNCH -- automated reasoner for sets and multisets
• Automata for unordered trees

This page was built for publication: Multitree automata that count

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