scientific article; zbMATH DE number 3366846

zbMath0231.94041MaRDI QIDQ5639639

No author found.

Publication date: 1971

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

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Research exposition (monographs, survey articles) pertaining to computer science (68-02)

Related Items (only showing first 100 items - show all)

Convolution as a Unifying Concept ⋮ Feedback, trace and fixed-point semantics ⋮ Non-associative Kleene Algebra and Temporal Logics ⋮ Stone Relation Algebras ⋮ Linear preservers for matrices over a class of semirings ⋮ Some quasi-varieties of iteration theories ⋮ Unnamed Item ⋮ Construction of a Deterministicω-Automaton Using Derivatives ⋮ *-Continuous Kleene $$\omega $$-Algebras ⋮ Nonfinite axiomatizability of the equational theory of shuffle ⋮ Rewriting regular inequalities ⋮ Unnamed Item ⋮ Relation-Algebraic Verification of Prim’s Minimum Spanning Tree Algorithm ⋮ SCHEMA FOR PARALLEL INSERTION AND DELETION: REVISITED ⋮ Quantales, observational logic and process semantics ⋮ Equational axioms for regular sets ⋮ Concurrent Kleene Algebra ⋮ Matrix versions of aperiodic $K$-rational identities ⋮ Unifying Lazy and Strict Computations ⋮ Automated Reasoning in Higher-Order Regular Algebra ⋮ Left-Handed Completeness ⋮ Relational Representation Theorem for Powerset Quantales ⋮ Demonic operators and monotype factors ⋮ Newton series, coinductively: a comparative study of composition ⋮ Rational and Recognisable Power Series ⋮ Weighted Automata and Weighted Logics ⋮ Temporal Structures ⋮ Three New Algorithms for Regular Language Enumeration ⋮ Une remarque sur les systèmes complets d'identités rationnelles ⋮ Efficient Program Transformers for Translating LCC to PDL ⋮ Exploring an Interface Model for CKA ⋮ Solving polynomial fixed point equations ⋮ Generating Posets Beyond N ⋮ Preorders, Partial Semigroups, and Quantales ⋮ Latest News about Demonic Algebra with Domain ⋮ Automated Reasoning for Hybrid Systems — Two Case Studies — ⋮ Solving Linear Equations in *-continuous Action Lattices ⋮ Categorical semantics of a simple differential programming language ⋮ Automata and one-dimensional TQFTs with defects ⋮ Efficient Enumeration of Regular Languages ⋮ On difunctions ⋮ The Triple-Pair Construction for Weighted ω-Pushdown Automata ⋮ Concurrent NetKAT. Modeling and analyzing stateful, concurrent networks ⋮ Unnamed Item ⋮ Completeness and the finite model property for Kleene algebra, reconsidered ⋮ Enhanced coalgebraic bisimulation ⋮ Words-to-Letters Valuations for Language Kleene Algebras with Variable Complements ⋮ Two-way representations and weighted automata ⋮ A Discrete Geometric Model of Concurrent Program Execution ⋮ A note on the iteration of infinite matrices ⋮ Unnamed Item ⋮ Iteration Semirings ⋮ Unnamed Item ⋮ On embedding in complete semirings ⋮ Une condition impliquant toutes les identités rationnelles ⋮ On Kleene algebras ⋮ On the Coalgebraic Theory of Kleene Algebra with Tests ⋮ Bijective sequential mappings of a free monoid onto another ⋮ A CHARACTERIZATION OF THE ARITHMETICAL HIERARCHY BY LANGUAGE EQUATIONS ⋮ MINIMALIZATIONS OF NFA USING THE UNIVERSAL AUTOMATON ⋮ On Hadamard Series and Rotating Q-Automata ⋮ On Language Decompositions and Primality ⋮ A Unifying Kleene Theorem for Weighted Finite Automata ⋮ Completeness for Identity-free Kleene Lattices ⋮ Assertions and recursions ⋮ Coinductive Algorithms for Büchi Automata ⋮ Elements of Stream Calculus ⋮ The algebra of stream processing functions ⋮ Unnamed Item ⋮ A UNIQUE DECOMPOSITION THEOREM FOR FACTORIAL LANGUAGES ⋮ How expressions can code for automata ⋮ Matrix Invariants over Semirings ⋮ A Finite Axiomatization of Nondeterministic Regular Expressions ⋮ Language Decompositions, Primality, and Trajectory-Based Operations ⋮ Multi-tilde Operators and Their Glushkov Automata ⋮ The View Selection Problem for Regular Path Queries ⋮ Uniformizing Rational Relations for Natural Language Applications Using Weighted Determinization ⋮ Unnamed Item ⋮ Finite Automata as Time-Inv Linear Systems Observability, Reachability and More ⋮ Traced Premonoidal Categories ⋮ Some more on the basis finite automaton ⋮ Partial Conway and Iteration Semiring-Semimodule Pairs ⋮ Unnamed Item ⋮ KAT-ML: an interactive theorem prover for Kleene algebra with tests ⋮ Suites algébriques, automates et substitutions ⋮ Reversible Kleene lattices ⋮ On the simplest centralizer of a language ⋮ John Horton Conway FRS ⋮ On Conjugacy of Languages ⋮ An algebraic representation of the fixed-point closure of *-continuous Kleene algebras – A categorical Chomsky–Schützenberger theorem ⋮ Clifford Algebras, Spin Groups and Qubit Trees ⋮ A Fully Equational Proof of Parikh's Theorem ⋮ Varieties and covarieties of languages (extended abstract) ⋮ Simplifying regular expressions further ⋮ Fuzzy terms ⋮ The universal fuzzy automaton ⋮ On language equations with invertible operations ⋮ On total regulators generated by derivation relations ⋮ Pair algebras and Galois connections. ⋮ On syntactic nuclei of rational languages

This page was built for publication: