On Properties and State Complexity of Deterministic State-Partition Automata

DOI10.1007/978-3-642-33475-7_12zbMath1362.68142OpenAlexW1953348647MaRDI QIDQ2915168

Tomáš Masopust, Galina Jirásková

Publication date: 21 September 2012

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-33475-7_12

zbMATH Keywords

projectionsfinite automataregular languagesdescriptional complexitystate-partition automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (3)

State complexity of projection on languages recognized by permutation automata and commuting letters ⋮ Minimal sensor activation and minimal communication in discrete-event systems ⋮ Using subobservers to synthesize opacity-enforcing supervisors

This page was built for publication: On Properties and State Complexity of Deterministic State-Partition Automata