BOOK-CHAPTER

Variable Tree Automata over Infinite Ranked Alphabets

Irini-Eleftheria MensGeorge Rahonis

Year: 2011 Lecture notes in computer science Pages: 247-260   Publisher: Springer Science+Business Media
Keywords:
Decidability Tree automaton Automaton Discrete mathematics Mathematics Tree (set theory) Deterministic automaton K-ary tree Nondeterministic finite automaton Combinatorics Computer science Automata theory Binary tree Tree structure Theoretical computer science

Metrics

4
Cited By
0.82
FWCI (Field Weighted Citation Impact)
23
Refs
0.70
Citation Normalized Percentile
Is in top 1%
Is in top 10%

Citation History

Topics

semigroups and automata theory
Physical Sciences →  Computer Science →  Computational Theory and Mathematics
Formal Methods in Verification
Physical Sciences →  Computer Science →  Computational Theory and Mathematics
Logic, programming, and type systems
Physical Sciences →  Computer Science →  Artificial Intelligence

Related Documents

BOOK-CHAPTER

Tree Automata over Infinite Alphabets

Michael KaminskiTony Tan

Lecture notes in computer science Year: 2008 Pages: 386-423
BOOK-CHAPTER

Variable Automata over Infinite Alphabets

Orna GrümbergOrna KupfermanSarai Sheinvald

Lecture notes in computer science Year: 2010 Pages: 561-572
JOURNAL ARTICLE

Variable automata over infinite alphabets

Orna GrümbergOrna KupfermanSarai Sheinvald

Journal:   Formal Methods in System Design Year: 2025
JOURNAL ARTICLE

Weighted Variable Automata over Infinite Alphabets

Μαρία Πίττου

Journal:   Aristotle University of Thessaloniki Year: 2014
© 2026 ScienceGate Book Chapters — All rights reserved.