scientific article; zbMATH DE number 1834677

zbMath0999.68110MaRDI QIDQ4779173

Thomas Schwentick, Victor Vianu, Frank Neven

Publication date: 25 November 2002

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2136/21360560

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Decidability of theories and sets of sentences (03B25)

Related Items (17)

The decision problem for some logics for finite words on infinite alphabets ⋮ Nominal Automata for Resource Usage Control ⋮ On temporal logics with data variable quantifications: decidability and complexity ⋮ Layered memory automata: recognizers for quasi-regular languages with unbounded memory ⋮ Unnamed Item ⋮ An algebraic approach to data languages and timed languages ⋮ Unnamed Item ⋮ A note on the emptiness problem for alternating finite-memory automata ⋮ An algebraic characterization of deterministic regular languages over infinite alphabets. ⋮ On Synthesis of Specifications with Arithmetic ⋮ Transducer-based analysis of cryptographic protocols ⋮ Variable Tree Automata over Infinite Ranked Alphabets ⋮ Regular and context-free nominal traces ⋮ Deadlock Detection in Linear Recursive Programs ⋮ Tree Automata over Infinite Alphabets ⋮ Counting Multiplicity over Infinite Alphabets ⋮ An automata-theoretic approach to model-checking systems and specifications over infinite data domains

This page was built for publication: