{"entities":{"Q1294951":{"pageid":1305701,"ns":120,"title":"Item:Q1294951","lastrevid":67107162,"modified":"2026-04-12T15:21:14Z","type":"item","id":"Q1294951","labels":{"en":{"language":"en","value":"Mathematical foundations of computer science 1997. 22nd international symposium, MFCS '97, Bratislava, Slovakia, August 25--29, 1997. Proceedings"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 1324843"}},"aliases":{},"claims":{"P31":[{"mainsnak":{"snaktype":"value","property":"P31","hash":"fd5912e4dab4b881a8eb0eb27e7893fef55176ad","datavalue":{"value":{"entity-type":"item","numeric-id":56887,"id":"Q56887"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1294951$7D8F9774-DDC2-41B1-BC71-9FF0EE26895D","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"59c8cb618a7595a75f9565997b2213805300383d","datavalue":{"value":{"text":"Mathematical foundations of computer science 1997. 22nd international symposium, MFCS '97, Bratislava, Slovakia, August 25--29, 1997. Proceedings","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q1294951$FA3911AE-3766-4A16-B4D8-74550CB9EC50","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"ff37c58669da5fb211d12e3087ed43e7fd486379","datavalue":{"value":"0920.00047","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1294951$080F75FB-CCBB-40C1-ACC6-029DE3E3FDD3","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"85c07c7737819bff773f78e2590a3bb761fe677b","datavalue":{"value":{"entity-type":"item","numeric-id":162374,"id":"Q162374"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1294951$60C4C63F-FAE1-448F-B602-545E5FBD8143","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"fa255f63ac24161ec19598d157d1cb5cacf2a9d5","datavalue":{"value":{"time":"+1999-08-18T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q1294951$68884B6D-1A1B-4F10-B17E-1F4883E826CF","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"5c375ec43565b7d7c551c7eea1b65e188ffe0244","datavalue":{"value":"The articles of mathematical interest will be reviewed individually. The 23rd international symposium 1998 has been indicated (see Zbl 0895.00049).  Indexed articles:  \\textit{Babai, L\u00e1szl\u00f3}, Communication complexity, 5-18 [Zbl 0941.68088]  \\textit{Bodlaender, Hans L.}, Treewidth: Algorithmic techniques and results, 19-36 [Zbl 0941.05057]  \\textit{Dwork, Cynthia}, Positive applications of lattices to cryptography, 44-51 [Zbl 0972.94034]  \\textit{Ferrari, GianLuigi; Montanari, Ugo}, A tile-based coordination view of asynchronous \\(\\pi\\)-calculus, 52-70 [Zbl 0941.68089]  \\textit{Hromkovi\u010d, Juraj; Schnitger, Georg}, Communication complexity and sequential computation, 71-84 [Zbl 0941.68090]  \\textit{Kraj\u00ed\u010dek, Jan}, Lower bounds for a proof system with an exponential speed-up over constant-depth Frege systems and over polynomial calculus, 85-90 [Zbl 0935.03068]  \\textit{Li\u015bkiewicz, Maciej; Reischuk, R\u00fcdiger}, Computational limitations of stochastic Turing machines and Arthur-Merlin games with small space bounds, 91-107 [Zbl 0951.68036]  \\textit{Sch\u00f6ning, Uwe}, Resolution proofs, exponential bounds, and Kolmogorov complexity, 110-116 [Zbl 0976.03063]  \\textit{Mundhenk, Martin; Goldsmith, Judy; Allender, Eric}, The complexity of policy evaluation for finite-horizon partially-observable Markov decision processes, 129-138 [Zbl 0947.90599]  \\textit{Bernardinello, Luca; Pomello, Lucia}, A category of transition systems and its relations with orthomodular posets, 139-148 [Zbl 0934.18005]  \\textit{B\u00e9rard, B\u00e9atrice; Picaronny, Claudine}, Accepting Zeno words without making time stand still, 149-158 [Zbl 0941.68044]  \\textit{Bonsangue, Marcello M.; Kok, Joost N.}, Specifying computations using hyper transition systems, 169-178 [Zbl 0941.68081]  \\textit{Cattaneo, G.; Formenti, E.; Margara, L.; Mazoyer, J.}, A shift-invariant metric on \\(S^{\\mathbb{Z}}\\) inducing a non-trivial topology, 179-188 [Zbl 0941.37006]  \\textit{Chen, Gang}, Subtyping calculus of construction. (Extended abstract), 189-198 [Zbl 0935.03023]  \\textit{Choffrut, Christian; Pighizzini, Giovanni}, Distances between languages and reflexivity of relations, 199-208 [Zbl 0941.68071]  \\textit{Ryl, Isabelle; Roos, Yves; Clerbout, Mireille}, Partial characterization of synchronization languages, 209-218 [Zbl 0941.68072]  \\textit{Heckel, Reiko; Ehrig, Hartmut; Wolter, Uwe; Corradini, Andrea}, Integrating the specification techniques of graph transformation and temporal logic, 219-228 [Zbl 0951.68055]  \\textit{Drewes, Frank}, On the generation of trees by hyperedge replacement, 229-238 [Zbl 0941.68066]  \\textit{Fernau, Henning; Stiebe, Ralf}, Regulation by valences, 239-248 [Zbl 0946.68066]  \\textit{Fokkink, Wan; van de Pol, Jaco}, Simulation as a correct transformation of rewrite systems, 249-258 [Zbl 0941.68067]  \\textit{Gavoille, Cyril}, On the dilation of interval routing, 259-268 [Zbl 0941.68097]  \\textit{Khasidashvili, Zurab; Glauert, John}, Relating conflict-free stable transition and event models. (Extended abstract), 269-278 [Zbl 0942.68061]  \\textit{Goerdt, Andreas}, The giant component threshold for random regular graphs with edge faults, 279-288 [Zbl 0941.68098]  \\textit{Heinemann, Bernhard}, A topological generalization of propositional linear time temporal logic, 289-297 [Zbl 0943.03016]  \\textit{Holzer, Markus}, Multi-head finite automata: Data-independent \\textit{versus} data-dependent computations, 299-308 [Zbl 0941.68045]  \\textit{Iwama, Kazuo}, Complexity of finding short resolution proofs, 309-318 [Zbl 0935.03067]  \\textit{Jukna, S.; Razborov, A.; Savick\u00fd, P.; Wegener, I.}, On P versus \\(\\text{NP}\\cap co-\\text{NP}\\) for decision trees and read-once branching programs, 319-326 [Zbl 0941.68062]  \\textit{Karner, Georg; Kuich, Werner}, A characterization of abstract families of algebraic power series, 327-336 [Zbl 0938.16034]  \\textit{Kobayashi, Yuji; Otto, Friedrich}, Repetitiveness of D0L-languages is decidable in polynomial time, 337-346 [Zbl 0946.68085]  \\textit{Kolpakov, Roman; Kucherov, Gregory}, Minimal letter frequency in \\(n\\)-th power-free binary words, 347-357 [Zbl 0941.68103]  \\textit{Korec, Ivan}, Real-time generation of primes by a one-dimensional cellular automaton with 11 states, 358-367 [Zbl 0941.68084]  \\textit{Manzini, Giovanni; Margara, Luciano}, Invertible linear cellular automata over \\({\\mathbf Z}_m\\): Algorithmic and dynamical aspects, 378-387 [Zbl 0941.68085]  \\textit{Martin-Vide, Carlos; Miquel-Verges, Joan; P\u0103un, Gheorghe}, Two-level contextual grammars: The internal case, 388-397 [Zbl 0946.68067]  \\textit{Meer, Klaus}, Counting problems over the reals, 398-407 [Zbl 0946.68057]  \\textit{Meinel, Christoph; Theobald, Thorsten}, On the influence of the state encoding on OBDD-representations of finite state machines, 408-417 [Zbl 0951.68037]  \\textit{Meyer, Rapha\u00ebl; Petit, Antoine}, Decomposition of TrPTL formulas, 418-427 [Zbl 0941.68082]  \\textit{Mundhenk, Martin}, NP-hard sets have many hard instances, 428-437 [Zbl 0938.03061]  \\textit{Nickelsen, Arfst}, Deciding verbose languages with linear advice, 438-447 [Zbl 0947.68069]  \\textit{Petersen, Holger}, Homomorphic images of sentential forms and terminating grammars. (Extended abstract), 448-457 [Zbl 0941.68073]  \\textit{Plump, Detlef}, Simplification orders for term graph rewriting, 458-467 [Zbl 0941.68068]  \\textit{Rensink, Arend; Wehrheim, Heike}, Dependency-based action refinement, 468-477 [Zbl 0951.68098]  \\textit{Savick\u00fd, P.; \u017d\u00e1k, S.}, A hierarchy for \\((1,+k)\\)-branching programs with respect to \\(k\\), 478-487 [Zbl 0941.68046]  \\textit{Vogler, Walter}, Partial order semantics and read arcs, 508-517 [Zbl 0941.68091]","type":"string"},"datatype":"string"},"type":"statement","id":"Q1294951$0FE2F525-3858-4FFA-8019-36FDD29B572F","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"6f2c17db95e93f9a5a19ff6c68b3a1df8b0c021e","datavalue":{"value":"00B25","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1294951$BED661F0-B275-4A72-978C-92A7F038E05B","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"ed293b811733fa9438a72e1b6ba5680a0d2aac9e","datavalue":{"value":"68-06","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1294951$EBE30669-7B7C-42CF-935B-39DA8E7D66B8","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"1750e0899c27a9a4675a3a999574d902d90c832b","datavalue":{"value":"1324843","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1294951$0C7E3775-F31B-461E-9225-C8A882D768DE","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"af7238066e52a522a18242c34a730522042a955a","datavalue":{"value":"Bratislava (Slovakia)","type":"string"},"datatype":"string"},"type":"statement","id":"Q1294951$97865D6A-C14D-409F-ABC0-DC632ECF3B17","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"5c4c4bb5a86a0fdf66f908b603f2f6975f5ef6fc","datavalue":{"value":"Proceedings","type":"string"},"datatype":"string"},"type":"statement","id":"Q1294951$40D5D00F-99DD-4D89-8815-651351E84FBE","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"1b165f2c80f889e3c73f8a20cfd816794dd15c80","datavalue":{"value":"Symposium","type":"string"},"datatype":"string"},"type":"statement","id":"Q1294951$1E13723F-5195-4073-971F-84B8F47FDA73","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"4d918c101fc1eb48f28f0011e0f0261efd714813","datavalue":{"value":"MFCS '97","type":"string"},"datatype":"string"},"type":"statement","id":"Q1294951$08646EDE-3451-42B7-B8BE-320EFA3C31D4","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"c6d674fb8e65633ae0d726f1a9a5b8aa291960f3","datavalue":{"value":"Mathematical foundations","type":"string"},"datatype":"string"},"type":"statement","id":"Q1294951$6A81A4EE-3885-4C32-ABDF-99BD6E44281A","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"fa78ad5518ca246bcf12a7a95d0f4aea27c592e5","datavalue":{"value":"Computer science","type":"string"},"datatype":"string"},"type":"statement","id":"Q1294951$1E7ADD90-5032-4DF3-85B1-AC09EB9BFF22","rank":"normal"}],"P1460":[{"mainsnak":{"snaktype":"value","property":"P1460","hash":"57f7fea50d2ce1b39b695c4a1313582eed405e38","datavalue":{"value":{"entity-type":"item","numeric-id":5976449,"id":"Q5976449"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1294951$69D320F5-568B-4320-86A3-4D04233FD25D","rank":"normal"}],"P12":[{"mainsnak":{"snaktype":"value","property":"P12","hash":"55bce4f5504a9acfc7c11a8d9dda2e0dffa89ed8","datavalue":{"value":"Q56814154","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1294951$A9E0EA32-956B-466E-AA4E-F3411B612A6F","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"c6743e5c1ce67f4e9034b01c0c35b20bdba9a72c","datavalue":{"value":"https://doi.org/10.1007/bfb0029943","type":"string"},"datatype":"url"},"type":"statement","id":"Q1294951$82BE9634-F1A0-4CDE-8D45-EDFB03A22EE5","rank":"normal"}],"P388":[{"mainsnak":{"snaktype":"value","property":"P388","hash":"df7a42705ff5cf650ea32bc9a92a9d0e33638767","datavalue":{"value":"W2498316819","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1294951$AD0CAD5A-80F8-4A5F-B5CA-8681DBCF75CA","rank":"normal"}],"P1635":[{"mainsnak":{"snaktype":"value","property":"P1635","hash":"db2a0b0a3da23a10b54a66f9109d3b9de1503cb8","datavalue":{"value":"conf/mfcs/1997","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1294951$84478D11-6B2E-403D-8BD7-DEF6580B28DC","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"6d0bc6d71f149c743d9affe6221e6e5dce9ff757","datavalue":{"value":"10.1007/BFB0029943","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1294951$39C00BAA-1200-494B-9AB8-B51B2754CA57","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Mathematical foundations of computer science 1997. 22nd international symposium, MFCS '97, Bratislava, Slovakia, August 25--29, 1997. Proceedings","badges":[]}}}}}