On Properties and State Complexity of Deterministic State-Partition Automata
Authors:
Open Access
- 1 January 2012
- book chapter
- Published by Springer Nature
- p. 164-178
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- On a structural property in the state complexity of projected regular languagesTheoretical Computer Science, 2012
- Supervisory control synthesis of discrete-event systems using a coordination schemeAutomatica, 2012
- Hierarchical control with partial observations: Sufficient conditions2011
- Synthesis of controllable and normal sublanguages for discrete-event systems using a coordinatorSystems & Control Letters, 2011
- State complexity of cyclic shiftRAIRO - Theoretical Informatics and Applications, 2007
- A construction on finite automata that has remained hiddenTheoretical Computer Science, 1998
- Regular Languages1997
- Hierarchical control of discrete-event systemsDiscrete Event Dynamic Systems, 1996
- On the consistency of hierarchical supervision in discrete-event systemsIEEE Transactions on Automatic Control, 1990
- On supremal languages of classes of sublanguages that arise in supervisor synthesis problems with partial observationMathematics of Control, Signals, and Systems, 1989