Linear logic automata
type: Item
instance of: scholarly article
title: Linear logic automata
zbMATH Open document ID: 0859.68021
DOI: 10.1016/0168-0072(95)00035-6
published in: Annals of Pure and Applied Logic
publication date: 1996-07-24T00:00:00Z
Mathematics Subject Classification ID: 68Q05
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 68Q85
Mathematics Subject Classification ID: 03B80
zbMATH DE Number: 909719
zbMATH Keywords: linear logic automaton
zbMATH Keywords: finite automaton
zbMATH Keywords: non-deterministic Petri net
author: Max Kanovich
MaRDI profile type: Publication
full work available at URL: 0168-0072(95)00035-6
OpenAlex ID: W1981021681
cites work: Computational interpretations of linear logic
cites work: Q4936120
cites work: Programming as a Discipline of Mathematical Nature
cites work: Q4178451
cites work: Q3999206
cites work: Linear logic
cites work: Q3960845
cites work: Q3791120
cites work: Q3994895
cites work: Bounded linear logic: A modular approach to polynomial-time computability
cites work: An axiomatic basis for computer programming
cites work: On the reachability problem for 5-dimensional vector addition systems
cites work: Linear logic as a logic of computations
cites work: The complexity of Horn fragments of linear logic
cites work: Q4490754
cites work: Parallel program schemata
cites work: How to Program an Infinite Abacus
cites work: Decision problems for propositional linear logic
cites work: From petri nets to linear logic
cites work: An Algorithm for the General Petri Net Reachability Problem
cites work: The complexity of the word problems for commutative semigroups and polynomial ideals
cites work: Recursive functions of symbolic expressions and their computation by machine, Part I
cites work: Recursive unsolvability of Post's problem of ''Tag'' und other topics in theory of Turing machines
cites work: Q4712651
cites work: Q4495851
description: scientific article; zbMATH DE number 909719