Foundations of computer science. Potential, theory, cognition (Q1373997)

The articles of mathematical interest will be reviewed individually. Indexed articles: \textit{Bauer, F. L.}, The might of formulas and their limits, 1-8 [Zbl 1126.00304] \textit{Mateescu, Alexandru; Rozenberg, Grzegorz; Salomaa, Arto}, Syntactic and semantic aspects of parallelism, 79-105 [Zbl 0887.68057] \textit{Kupka, Ingbert}, Unique fixpoints in complete lattices with applications to formal languages and semantics, 107-115 [Zbl 0883.06004] \textit{Karner, Georg; Kuich, Werner}, On abstract families of languages, power series, and elements, 117-124 [Zbl 0887.68058] \textit{Lange, Klaus-Jörn}, Are there formal languages complete for \(\text{SymSPACE}(\log n)\)?, 125-134 [Zbl 0887.68059] \textit{Jantzen, Matthias}, On twist-colored trios: A new morphic characterization of r.e. sets, 135-142 [Zbl 0887.68060] \textit{Esparza, J.; Rossmanith, P.}, An automata approach to some problems on context-free grammars, 143-152 [Zbl 0895.68085] \textit{Culik, Karel; Kari, Jarkko}, On aperiodic sets of Wang tiles, 153-162 [Zbl 0883.05035] \textit{Jenner, Birgit}, Closure under complementation of logspace complexity classes. A survey, 163-175 [Zbl 0887.68037] \textit{Kirsig, Bernd}, A relation between sparse and printable sets in \(\text{NSPACE}(\log n)\), 177-184 [Zbl 0885.68068] \textit{Weihrauch, Klaus}, A foundation for computable analysis, 185-199 [Zbl 0896.03033] \textit{Ehrig, H.; Padberg, J.}, A uniform approach to Petri nets, 219-231 [Zbl 0887.68076] \textit{Kiehn, Astrid}, Observing partial order runs of Petri nets, 233-238 [Zbl 0887.68077] \textit{Meseguer, José; Montanari, Ugo; Sassone, Vladimiro}, Representation theorems for Petri nets, 239-249 [Zbl 0885.68115] \textit{Diekert, Volker}, A remark on trace equations, 251-260 [Zbl 0898.68057] \textit{Kindler, Ekkart; Reisig, Wolfgang}, Verification of distributed algorithms with algebraic Petri nets, 261-270 [Zbl 0899.68058] \textit{Daduna, Hans}, Discrete time analysis of a state dependent tandem with different customer types, 287-296 [Zbl 0887.60086] \textit{Hotz, Günter; Wu, Hongzhong}, On the arrangement complexity of uniform trees, 337-350 [Zbl 0889.94015]