The Power of Non-deterministic Reassignment in Infinite-Alphabet Pushdown Automata

Authors:
Yulia Dubov;Michael Kaminski
Affiliations:
MTM --- Advanced Technology Center, Intel Israel, Haifa, Israel 31015;Department of Computer Science, Technion --- Israel Institute of Technology, Haifa, Israel 32000
Venue:
Languages: From Formal to Natural
Year:
2009

Citing 6
Cited 0

Finite-state unification automata and relational languages

Information and Computation
Finite-memory automata

Theoretical Computer Science
Finite state machines for strings over infinite alphabets

ACM Transactions on Computational Logic (TOCL)
Two-Variable Logic on Words with Data

LICS '06 Proceedings of the 21st Annual IEEE Symposium on Logic in Computer Science
LTL with the freeze quantifier and register automata

ACM Transactions on Computational Logic (TOCL)
Tree automata over infinite alphabets

Pillars of computer science

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we compare two models of pushdown automata over infinite alphabets, one with non-deterministic reassignment and the other with the deterministic one, and show that the former model is stronger than the latter.