scientific article; zbMATH DE number 2038746

zbMath1039.68077MaRDI QIDQ4449211

Zhe Dang, Gaoyan Xie, Oscar H. Ibarra

Publication date: 8 February 2004

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2719/27190668.htm

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

Mathematics Subject Classification ID

Decidability (number-theoretic aspects) (11U05) Quadratic and bilinear Diophantine equations (11D09) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (14)

Lossiness of communication channels modeled by transducers1 ⋮ Reachability in Succinct and Parametric One-Counter Automata ⋮ Quantifying communication in synchronized languages ⋮ Quantifying Communication in Synchronized Languages ⋮ Information rate of some classes of non-regular languages: an automata-theoretic approach ⋮ Deletion operations on deterministic families of automata ⋮ Automata and processes on multisets of communicating objects ⋮ Similarity in languages and programs ⋮ Insertion operations on deterministic reversal-bounded counter machines ⋮ Execution information rate for some classes of automata ⋮ Automata on Multisets of Communicating Objects ⋮ On store languages of language acceptors ⋮ On families of full trios containing counter machine languages ⋮ Sampling automata and programs

This page was built for publication: