Pages that link to "Item:Q3142004"
From MaRDI portal
The following pages link to Concise representations of regular languages by degree and probabilistic finite automata (Q3142004):
Displaying 4 items.
- Transforming a single-valued transducer into a Mealy machine (Q1267709) (← links)
- On the descriptional complexity of finite automata with modified acceptance conditions (Q1763715) (← links)
- IN MEMORIAM CHANDRA KINTALA (Q2909177) (← links)
- Branching Measures and Nearly Acyclic NFAs (Q5205046) (← links)
