scientific article
From MaRDI portal
Publication:3995303
zbMath0725.68006MaRDI QIDQ3995303
Publication date: 23 January 1993
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Formal languages and automata (68Q45) Proceedings, conferences, collections, etc. pertaining to computer science (68-06) Algebraic theory of languages and automata (68Q70) Theory of computing (68Q99)
Related Items
Undecidability through Fourier series, On the structure of varieties with equationally definable principal congruences. III, Linear temporal logic -- from infinite to finite horizon, Construction of some nonautomatic sequences by cellular automata, McNaughton games and extracting strategies for concurrent programs, On store languages and applications, On the power of finite ambiguity in Büchi complementation, A first-order logic characterization of safety and co-safety languages, An effective version of Stallings' theorem in the case of context-free groups, Equality Logic, Simulating alternating tree automata by nondeterministic automata: New results and new proofs of the theorems of Rabin, McNaughton and Safra, An extension of Büchi’s problem for polynomial rings in zero characteristic, Coinductive Algorithms for Büchi Automata, On store languages of language acceptors, A Hierarchical Completeness Proof for Propositional Interval Temporal Logic with Finite Time, Infinite games on finitely coloured graphs with applications to automata on infinite trees, Automata on finite trees, On relation between linear temporal logic and quantum finite automata, Infinite games played on finite graphs
