Automata for unordered trees
DOI10.1016/J.IC.2016.07.012zbMATH Open1362.68128OpenAlexW2481729132MaRDI QIDQ515668FDOQ515668
Authors: Adrien Boiret, Vincent Hugot, Joachim Niehren, Ralf Treinen 
Publication date: 16 March 2017
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/hal-01179493/file/DeterministicAutomataUnordered_Journal-1.pdf
Recommendations
Formal languages and automata (68Q45) Analysis of algorithms and problem complexity (68Q25) Automata and formal grammars in connection with logical questions (03D05)
Cites Work
- Semigroups, Presburger formulas, and languages
- Title not available (Why is that?)
- On Context-Free Languages
- Title not available (Why is that?)
- Monadic Datalog and the expressive power of languages for web information extraction
- Rewriting Techniques and Applications
- Title not available (Why is that?)
- Generalized finite automata theory with an application to a decision problem of second-order logic
- On the complexity of integer programming
- Characterizing derivation trees of context-free grammars through a generalization of finite automata theory
- Chrobak normal form revisited, with applications
- Title not available (Why is that?)
- Automata, Languages and Programming
- Multitree automata that count
- Title not available (Why is that?)
- Logics for Unordered Trees with Data Constraints on Siblings
- Static and dynamic semantics of NoSQL languages
- Counting in trees
- Integer vector addition systems with states
- Feature-constraint logics for unification grammars
- Records for logic programming
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Feature automata and recognizable sets of feature trees
- Complexity of problems of commutative grammars
- Database Programming Languages
- Term Rewriting and Applications
Cited In (8)
- Logics for unordered trees with data constraints
- Title not available (Why is that?)
- Finite Automata on Unranked and Unordered DAGs
- Automata, Languages and Programming
- Presburger Büchi tree automata with applications to logics with expressive counting
- Unranked Tree Automata with Sibling Equalities and Disequalities
- Title not available (Why is that?)
- Term Rewriting and Applications
Uses Software
This page was built for publication: Automata for unordered trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q515668)
