Notes on finite asynchronous automata
Wieslaw Zielonka (1987)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Displaying similar documents to “Complete subgraphs of bipartite graphs and applications to trace languages”
Notes on finite asynchronous automata
The strong independence of substitution and homomorphic replication
S. A. Greibach (1978)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
On the hierarchy of Petri net languages
Matthias Jantzen (1979)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Comparison of basic language generating devices (non-deterministic systems)
Manfred Kudlek (1990)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
On languages satisfying “interchange Lemma”
Victor Mitrana (1993)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
One counter languages and the chevron operation
S. A. Greibach (1979)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Hierarchies of aperiodic languages
Janusz A. Brzozowski (1976)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity: