On Commutative Directable Nondeterministic Automata
Authors:
- Magnus SteinbyMSMagnus Steinby
- Balázs ImrehBIBalázs Imreh
- Masami ItoMIMasami Ito
- 16 January 2003
- book chapter
- Published by Taylor & Francis
- p. 141-150
Abstract
No abstract availableThis publication has 3 references indexed in Scilit:
- Reset words for commutative and solvable automataTheoretical Computer Science, 1997
- A game of composing binary relationsRAIRO. Informatique théorique, 1982
- On free monoids partially ordered by embeddingJournal of Combinatorial Theory, 1969