scientific article

From MaRDI portal
Publication:3999156

zbMath0714.68001MaRDI QIDQ3999156

No author found.

Publication date: 23 January 1993


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.



Related Items (42)

A maximal-literal unit strategy for horn clausesFormal Methods to Improve Public Administration Business ProcessesIncompleteness Theorems, Large Cardinals, and Automata over Infinite WordsRecursively defined tree transductionsA termination ordering for higher order rewrite systemsThe first-order theory of one-step rewriting is undecidableHigher-order familiesA power-set construction for reducing Büchi automata to non-determinism degree twoComputation on abstract data types. The extensional approach, with an application to streamsSet-theoretic graph rewritingComputing the Wadge degree, the Lifschitz degree, and the Rabin index of a regular language of infinite words in polynomial timeOn the High Complexity of Petri Nets $$\omega $$-LanguagesOn Minimization and Learning of Deterministic ω-Automata in the Presence of Don’t Care WordsIncorporating decision procedures in implicit induction.Some complete \(\omega\)-powers of a one-counter language, for any Borel class of finite rankDevelopment closed critical pairsA field guide to equational logicProof-theoretic notions for software maintenanceThe isomorphism relation between tree-automatic structuresExpressive power of existential first-order sentences of Büchi's sequential calculusDependent vector types for data structuring in multirate FaustA graphic language based on timing diagramsPolishness of some topologies related to word or tree automataFifty years of Hoare's logicAsynchronous cellular automata for infinite tracesFormal composition of hybrid systemsOn the König deficiency of zero-reducible graphsIntersection of \(-\omega \)-regular expressionsThe first-order theory of linear one-step rewriting is undecidableReasoning about nondeterministic and concurrent actions: A process algebra approachUnnamed ItemOrder-sorted Homeomorphic Embedding Modulo Combinations of Associativity and/or Commutativity Axioms*An efficient null-free procedure for deciding regular language membershipComputation paths logic: An expressive, yet elementary, process logicStar-free sets of words on ordinalsIterating transducersBasic analytic combinatorics of directed lattice pathsModular termination proofs for rewriting using dependency pairsFixpoint semantics for logic programming a surveyCOMPOSITIONALITY, COMPUTABILITY, AND COMPLEXITYOn the Expressive Power of Non-deterministic and Unambiguous Petri Nets over Infinite WordsConfluence without termination via parallel critical pairs




This page was built for publication: