scientific article; zbMATH DE number 1033559
From MaRDI portal
Publication:4344149
zbMath0883.68055MaRDI QIDQ4344149
Publication date: 14 July 1997
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (70)
A Finite Axiomatisation of Finite-State Automata Using String Diagrams ⋮ Deconfined Global Types for Asynchronous Sessions ⋮ An approach to deciding the observational equivalence of Algol-like languages ⋮ Halos and undecidability of tensor stable positive maps ⋮ A Formalisation of Finite Automata Using Hereditarily Finite Sets ⋮ The \$-calculus process algebra for problem solving: A paradigmatic shift in handling hard computational problems ⋮ Algorithmic games for full ground references ⋮ Automata-theoretical regularity characterizations for the iterated shuffle on commutative regular languages ⋮ Regular language representations in the constructive type theory of Coq ⋮ Operational complexity and pumping lemmas ⋮ Undecidability of the Spectral Gap ⋮ Undecidability of asynchronous session subtyping ⋮ Can abstract state machines be useful in language theory? ⋮ Reducing behavioural to structural properties of programs with procedures ⋮ Deciding unique decodability of bigram counts via finite automata ⋮ Sequential Relational Decomposition ⋮ Automatic Proof Generation in Kleene Algebra ⋮ On Completeness of Cost Metrics and Meta-Search Algorithms in $-Calculus ⋮ Subsequential transducers: a coalgebraic perspective ⋮ Weak call-by-value lambda calculus as a model of computation in Coq ⋮ On the existential arithmetics with addition and bitwise minimum ⋮ The existential fragment of second-order propositional intuitionistic logic is undecidable ⋮ On the existence of a cherry-picking sequence ⋮ Cyclotomic properties of polynomials associated with automatic sequences ⋮ On Jaffe's pumping lemma, revisited ⋮ Bisimulations for fuzzy automata ⋮ Nondeterministic automata: equivalence, bisimulations, and uniform relations ⋮ Binary and circular automata having maximal state complexity for the set of synchronizing words ⋮ The pumping lemma for regular languages is hard ⋮ On Minimal Pumping Constants for Regular Languages ⋮ Unnamed Item ⋮ On the boundary between decidability and undecidability of asynchronous session subtyping ⋮ Closures in Binary Partial Algebras ⋮ Combinatorial variations on Cantor's diagonal ⋮ Commutative rational term rewriting ⋮ Agent-Based Modeling, Mathematical Formalism for ⋮ Process calculi as a tool for studying coordination, contracts and session types ⋮ Some undecidable properties of SOS specifications ⋮ Computation of the greatest simulations and bisimulations between fuzzy automata ⋮ Mitigating covert channels based on analysis of the potential for communication ⋮ Verifying polymer reaction networks using bisimulation ⋮ Efficient Construction of Semilinear Representations of Languages Accepted by Unary NFA ⋮ Two collapsing hierarchies of subregularly tree controlled languages ⋮ A tree distinguishing polynomial ⋮ Antimirov and Mosses’s Rewrite System Revisited ⋮ Unary finite automata vs. arithmetic progressions ⋮ Operational Accepting State Complexity: The Unary and Finite Case ⋮ A Kleene Theorem for Polynomial Coalgebras ⋮ A Myhill-Nerode theorem for register automata and symbolic trace languages ⋮ Unnamed Item ⋮ Inference of bounded L systems with polymorphic P systems ⋮ Unnamed Item ⋮ A Formalisation of the Myhill-Nerode Theorem Based on Regular Expressions (Proof Pearl) ⋮ Robust biomolecular finite automata ⋮ On the Formalization of Some Results of Context-Free Language Theory ⋮ A game-semantic model of computation ⋮ Call-by-value lambda calculus as a model of computation in Coq ⋮ Polygon Approximations of the Euclidean Circles on the Square Grid by Broadcasting Sequences ⋮ Automata on finite trees ⋮ Towards a unified view of finite automata and semi-Markov flowgraph models ⋮ Languages, Decidability, and Complexity ⋮ The 2004 Benjamin Franklin medal in computer and cognitive science presented to Richard M. Karp ⋮ A theory of computation based on quantum logic. I ⋮ A framework to visualize equivalences between computational models of regular languages. ⋮ Motif statistics. ⋮ Automata, Boolean matrices, and ultimate periodicity. ⋮ Deciding Kleene algebra terms equivalence in Coq ⋮ A formalisation of the Myhill-Nerode theorem based on regular expressions ⋮ Counter machines ⋮ Regularity conditions for iterated shuffle on commutative regular languages
This page was built for publication:
