Tree Automata for Non-linear Arithmetic

DOI10.1007/978-3-540-70590-1_20zbMath1155.68044OpenAlexW1586171360MaRDI QIDQ3522025

Hitoshi Ohsaki, Naoki Kobayashi

Publication date: 28 August 2008

Published in: Rewriting Techniques and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-70590-1_20

zbMATH Keywords

definabilitytree automatatree languagesequational theoriesPresburger arithmeticarithmetic relationsAC tree automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) First-order arithmetic and fragments (03F30) Grammars and rewriting systems (68Q42)

Related Items (1)

Tree Automata for Non-linear Arithmetic

Cites Work

• XML schema, tree logic and sheaves automata
• Multitree automata that count
• Alternating two-way AC-tree automata
• Semigroups, Presburger formulas, and languages
• Characterizing derivation trees of context-free grammars through a generalization of finite automata theory
• Tree Automata for Non-linear Arithmetic
• Monotone AC-Tree Automata
• On Context-Free Languages
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Tree Automata for Non-linear Arithmetic