Enumerated BSP Automata
From MaRDI portal
Publication:4686652
DOI10.1007/978-3-319-46376-6_10zbMath1396.68066OpenAlexW2546882212MaRDI QIDQ4686652
Publication date: 4 October 2018
Published in: Emergent Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-46376-6_10
Formal languages and automata (68Q45) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)
Uses Software
Cites Work
- A bulk-synchronous parallel process algebra
- The passing of a rational expression to a nondeterministic finite automaton
- Regular expressions into finite automata
- A calculus of functional BSP programs
- Computer science today. Recent trends and developments
- Minimization of symbolic automata
- Derivatives of Regular Expressions
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Enumerated BSP Automata