Multitree automata that count

DOI10.1016/j.tcs.2004.10.023zbMath1070.68075OpenAlexW2012833332MaRDI QIDQ1770418

Denis 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

LogicPresburger arithmeticFormal languagesTree-automata

Mathematics Subject Classification ID

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

Related Items (8)

XML schema, tree logic and sheaves automata ⋮ Linear Arithmetic with Stars ⋮ Tree Automata for Non-linear Arithmetic ⋮ Fractional Collections with Cardinality Bounds, and Mixed Linear Arithmetic with Stars ⋮ Automata for unordered trees ⋮ MUNCH - Automated Reasoner for Sets and Multisets ⋮ Decision Procedures for Multisets with Cardinality Constraints ⋮ Efficient automated reasoning about sets and multisets with cardinality constraints

Cites Work

• The computational complexity of logical theories
• Logic and \(p\)-recognizable sets of integers
• Tree automata help one to solve equational formulae in AC-theories
• Alternating two-way AC-tree automata
• Semigroups, Presburger formulas, and languages
• The first order properties of products of algebraic systems
• The theory of integer multiplication with order restricted to primes is decidable
• Pumping, cleaning and symbolic constraints solving
• Feature automata and recognizable sets of feature trees
• Equality and disequality constraints on direct subterms in tree automata
• Définition et etude des Bilangages réguliers
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Multitree automata that count