The generalization of generalized automata: Expression automata
From MaRDI portal
Recommendations
Cited in
(11)- Variants of codes and indecomposable languages
- Deterministic generalized automata
- Corrigendum to our paper: How Expressions Can Code for Automata
- Length Codes, Products of Languages and Primality
- scientific article; zbMATH DE number 3930367 (Why is no real title available?)
- Deterministic generalized automata
- THE GENERALIZATION OF GENERALIZED AUTOMATA: EXPRESSION AUTOMATA
- Small balanced vertex separators in NFA to regular expression conversion
- Deterministic suffix-reading automata
- Deterministic suffix-reading automata
- On the existence of prime decompositions
This page was built for publication: The generalization of generalized automata: Expression automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5463975)