scientific article
From MaRDI portal
Publication:4036584
zbMath0769.68100MaRDI QIDQ4036584
Publication date: 18 May 1993
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Decidability of theories and sets of sentences (03B25)
Related Items
On the Ehrenfeucht-Fraïssé game in theoretical computer science, A logical approach to locality in pictures languages, Existential MSO over two successors is strictly weaker than over linear orders, Generalising automaticity to modal properties of finite structures, Definable transductions and weighted logics for texts, Computability by monadic second-order logic, Subshifts as models for MSO logic, Recognizable picture languages and domino tiling, Recognizable series on graphs and hypergraphs, Complexity of the emptiness problem for graph-walking automata and for tilings with star subgraphs, Unnamed Item, Reversibility of computations in graph-walking automata, The monadic second-order logic of graphs. IX: Machines and their behaviours, Grid structures and undecidable constraint theories, Expressive power of existential first-order sentences of Büchi's sequential calculus, Message-passing automata are expressively equivalent to EMSO logic, A Nivat Theorem for Weighted Picture Automata and Weighted MSO Logic, Asynchronous cellular automata for infinite traces, Weighted Automata and Logics on Infinite Graphs, Subshifts, Languages and Logic, Some notes on graph automata, tiling systems and partition logic, Unambiguous recognizable two-dimensional languages, Uniform and nonuniform recognizability.
