BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × Finland
1 × Greece
1 × The Netherlands
1 × USA
4 × Germany
Collaborated with:
J.W.Carlyle C.Schnorr Y.Raz S.Moran M.Rabinovich S.A.Greibach
Talks about:
approxim (3) grammar (3) probabilist (2) automata (2) problem (2) pattern (2) generat (2) complex (2) lattic (2) map (2)

Person: Azaria Paz

DBLP DBLP: Paz:Azaria

Contributed to:

DLT 19971997
GG 19901990
ICALP 19871987
GG 19861986
GG 19821982
GG 19781978
ICALP 19771977
ICALP 19721972

Wrote 9 papers:

DLT-1997-PazC #array #automaton #evolution #probability
Chaotic Evolution via Generalized Probabilistic Automata (Probabilistic Arrays) (AP, JWC), pp. 9–35.
GG-1990-Paz #graph grammar
Usefulness and Visibility of Graph Grammars (AP), p. 56.
GG-1990-Paz90a #formal method #overview
The Theory of Graphoids: A Survey (AP), pp. 610–621.
ICALP-1987-PazS #approximate #integer
Approximating Integer Lattices by Lattices with Cyclic Factor Groups (AP, CPS), pp. 386–393.
GG-1986-CarlyleGP #complexity #generative #parallel
Complexity of pattern generation via planar parallel binary fission/fusion grammars (JWC, SAG, AP), pp. 515–533.
GG-1982-Paz #geometry
Geometry versus topology in map grammars (AP), pp. 288–296.
GG-1978-PazR #complexity #generative
Complexity of Pattern Generation by Map-L-Systems (AP, YR), pp. 367–378.
ICALP-1977-PazM #approximate #nondeterminism #optimisation #polynomial #problem
Non-Deterministic Polynomial Optimization Problems and Their Approximation (AP, SM), pp. 370–379.
ICALP-1972-PazR #approximate #automaton #linear #problem
Linear Automata — Approximation Problem (AP, MR), pp. 99–102.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.