Kleene Theorems for Product Systems
From MaRDI portal
Publication:5200095
DOI10.1007/978-3-642-22600-7_19zbMath1341.68132OpenAlexW1525435304MaRDI QIDQ5200095
Kamal Lodaya, Ramchandra Phawade, Madhavan Mukund
Publication date: 29 July 2011
Published in: Descriptional Complexity of Formal Systems (Search for Journal in Brave)
Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.369.8491
Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items
Derivatives and partial derivatives for regular shuffle expressions ⋮ Derivatives for Regular Shuffle Expressions ⋮ Kleene Theorems for Synchronous Products with Matching
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- From regular expressions to deterministic automata
- Partial derivatives of regular expressions and finite automaton constructions
- A note on the space complexity of some decision problems for finite automata
- Concurrent regular expressions and their relationship to Petri nets
- Complexity measures for regular expressions
- Series-parallel languages and the bounded-width property
- Distributed automata in an assumption-commitment framework
- Marked directed graphs
- Synchronisationsgraphen
- Finite Automata, Digraph Connectivity, and Regular Expression Size
- A fresh look at free choice nets
- Notes on finite asynchronous automata
- Free Choice Petri Nets
- Logic Meets Algebra: the Case of Regular Languages
- Mathematical Foundations of Computer Science 2004
- Boolean Matrices and the Stability of Neural Nets
- Advances in Computing Science – ASIAN 2003. Progamming Languages and Distributed Computation Programming Languages and Distributed Computation
