Shuffle languages, Petri nets, and context-sensitive grammars

Authors:
Jay Gischer
Affiliations:
Univ. of Washington, Seattle
Venue:
Communications of the ACM
Year:
1981

Citing 3
Cited 22

PETRI NET LANGUAGE

PETRI NET LANGUAGE
Formal languages and their relation to automata

Formal languages and their relation to automata
The Mathematical Theory of Context-Free Languages

The Mathematical Theory of Context-Free Languages

Resource usage analysis

POPL '02 Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Resource usage analysis

ACM Transactions on Programming Languages and Systems (TOPLAS)
Synchronized shuffles

Theoretical Computer Science
Synchronized Shuffle on Backbones

Fundamenta Informaticae - SPECIAL ISSUE ON TRAJECTORIES OF LANGUAGE THEORY Dedicated to the memory of Alexandru Mateescu
Infinite unfair shuffles and associativity

Theoretical Computer Science
Production planning by shuffle operation

ICCOMP'07 Proceedings of the 11th WSEAS International Conference on Computers
Shuffle from sequential to parallel in production planning

WSEAS Transactions on Computer Research
Associativity of Infinite Synchronized Shuffles and Team Automata

Fundamenta Informaticae
Pomset mcfgs

IWPT '07 Proceedings of the 10th International Conference on Parsing Technologies
Algorithmic analysis of array-accessing programs

CSL'09/EACSL'09 Proceedings of the 23rd CSL international conference and 18th EACSL Annual conference on Computer science logic
Learning deterministic finite automata from interleaved strings

ICGI'10 Proceedings of the 10th international colloquium conference on Grammatical inference: theoretical results and applications
Two-variable logic on data words

ACM Transactions on Computational Logic (TOCL)
Recognizing shuffled languages

LATA'11 Proceedings of the 5th international conference on Language and automata theory and applications
Feasible automata for two-variable logic with successor on data words

LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
Algorithmic analysis of array-accessing programs

ACM Transactions on Computational Logic (TOCL)
Associativity of Infinite Synchronized Shuffles and Team Automata

Fundamenta Informaticae
On a hierarchy of languages with catenation and shuffle

DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
Synchronized Shuffle on Backbones

Fundamenta Informaticae - SPECIAL ISSUE ON TRAJECTORIES OF LANGUAGE THEORY Dedicated to the memory of Alexandru Mateescu
Shuffle expressions and words with nested data

MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
Unshuffling a square is NP-hard

Journal of Computer and System Sciences
A Hierarchy of Languages with Catenation and Shuffle

Fundamenta Informaticae - Concurrency, Specification and Programming
Properties of Languages with Catenation and Shuffle

Fundamenta Informaticae - Dedicated to the Memory of Professor Manfred Kudlek

Quantified Score

Hi-index	48.22

Visualization

Abstract

Flow expressions have been proposed as an extension of the regular expressions designed to model concurrency. We examine a simplification of these flow expressions which we call shuffle expressions. We introduce two types of machines to aid in recognizing shuffle languages and show that one such machine may be equivalent to a Petri Net. In addition, closure and containment properties of the related language classes are investigated, and we show that one machine type recognizes at least a restricted class of shuffle languages. Finally, grammars for all shuffle languages are generated, and the shuffle languages are shown to be context-sensitive.