scientific article; zbMATH DE number 2038746

MaRDI QIDQ4449211zbMATH OpenFDO

Authors Gaoyan Xie, Zhe Dang, 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

Mathematics Subject Classification ID

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

Recommendations

• On two-way FA with monotonic counters and quadratic Diophantine equations
• On the solvability of a class of Diophantine equations and applications
• scientific article; zbMATH DE number 4101294
• Diophantine equations, Presburger arithmetic and finite automata
• A polynomial algorithm for solving systems of two linear diophantine equations

Cited in

(16)

• On store languages of language acceptors
• On two-way FA with monotonic counters and quadratic Diophantine equations
• On families of full trios containing counter machine languages
• Sampling automata and programs
• Information rate of some classes of non-regular languages: an automata-theoretic approach
• Reachability in Succinct and Parametric One-Counter Automata
• Quantifying communication in synchronized languages
• Quantifying communication in synchronized languages
• Automata on Multisets of Communicating Objects
• Similarity in languages and programs
• Lossiness of communication channels modeled by transducers1
• Automata and processes on multisets of communicating objects
• Quadratic word equations with length constraints, counter systems, and Presburger arithmetic with divisibility
• On the complexity of convex and reverse convex prequadratic constraints
• On the solvability of a class of Diophantine equations and applications
• Execution information rate for some classes of automata

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4449211)