Finite-state unification automata and relational languages

DOI10.1006/inco.1994.1085zbMath0823.68068OpenAlexW2038404317MaRDI QIDQ1341772

Nissim Francez, Yael Shemesh

Publication date: 11 January 1995

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/inco.1994.1085

zbMATH Keywords

relational languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (7)

Finite-memory automata ⋮ Unnamed Item ⋮ An algebraic characterization of deterministic regular languages over infinite alphabets. ⋮ On Synthesis of Specifications with Arithmetic ⋮ Variable Tree Automata over Infinite Ranked Alphabets ⋮ Model checking usage policies ⋮ FINITE-MEMORY AUTOMATA WITH NON-DETERMINISTIC REASSIGNMENT

This page was built for publication: Finite-state unification automata and relational languages