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.
Formal languages and automata (68Q45) Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60) Abstract data types; algebraic specification (68Q65) Grammars and rewriting systems (68Q42) General reference works (handbooks, dictionaries, bibliographies, etc.) pertaining to computer science (68-00)
Related Items (42)
A maximal-literal unit strategy for horn clauses ⋮ Formal Methods to Improve Public Administration Business Processes ⋮ Incompleteness Theorems, Large Cardinals, and Automata over Infinite Words ⋮ Recursively defined tree transductions ⋮ A termination ordering for higher order rewrite systems ⋮ The first-order theory of one-step rewriting is undecidable ⋮ Higher-order families ⋮ A power-set construction for reducing Büchi automata to non-determinism degree two ⋮ Computation on abstract data types. The extensional approach, with an application to streams ⋮ Set-theoretic graph rewriting ⋮ Computing the Wadge degree, the Lifschitz degree, and the Rabin index of a regular language of infinite words in polynomial time ⋮ On the High Complexity of Petri Nets $$\omega $$-Languages ⋮ On Minimization and Learning of Deterministic ω-Automata in the Presence of Don’t Care Words ⋮ Incorporating decision procedures in implicit induction. ⋮ Some complete \(\omega\)-powers of a one-counter language, for any Borel class of finite rank ⋮ Development closed critical pairs ⋮ A field guide to equational logic ⋮ Proof-theoretic notions for software maintenance ⋮ The isomorphism relation between tree-automatic structures ⋮ Expressive power of existential first-order sentences of Büchi's sequential calculus ⋮ Dependent vector types for data structuring in multirate Faust ⋮ A graphic language based on timing diagrams ⋮ Polishness of some topologies related to word or tree automata ⋮ Fifty years of Hoare's logic ⋮ Asynchronous cellular automata for infinite traces ⋮ Formal composition of hybrid systems ⋮ On the König deficiency of zero-reducible graphs ⋮ Intersection of \(-\omega \)-regular expressions ⋮ The first-order theory of linear one-step rewriting is undecidable ⋮ Reasoning about nondeterministic and concurrent actions: A process algebra approach ⋮ Unnamed Item ⋮ Order-sorted Homeomorphic Embedding Modulo Combinations of Associativity and/or Commutativity Axioms* ⋮ An efficient null-free procedure for deciding regular language membership ⋮ Computation paths logic: An expressive, yet elementary, process logic ⋮ Star-free sets of words on ordinals ⋮ Iterating transducers ⋮ Basic analytic combinatorics of directed lattice paths ⋮ Modular termination proofs for rewriting using dependency pairs ⋮ Fixpoint semantics for logic programming a survey ⋮ COMPOSITIONALITY, COMPUTABILITY, AND COMPLEXITY ⋮ On the Expressive Power of Non-deterministic and Unambiguous Petri Nets over Infinite Words ⋮ Confluence without termination via parallel critical pairs
This page was built for publication: