Bounded sequence testing from deterministic finite state machines
From MaRDI portal
Publication:964395
DOI10.1016/j.tcs.2010.01.030zbMath1192.68414MaRDI QIDQ964395
Publication date: 15 April 2010
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2010.01.030
68Q45: Formal languages and automata
Related Items
RESEARCH FRONTIERS OF MEMBRANE COMPUTING: OPEN PROBLEMS AND RESEARCH TOPICS, A model learning based testing approach for kernel P systems, Learning finite cover automata from queries, Testing based on identifiable P systems using cover automata and X-machines, Kernel P systems: from modelling to verification and testing, A model learning based testing approach for spiking neural P systems, Kernel P Systems Modelling, Testing and Verification - Sorting Case Study
Cites Work
- Complete deterministic stream X-machine testing
- Testing against a non-controllable stream X-machine using state counting
- Testing Software Design Modeled by Finite-State Machines
- An integration testing method that is proved to find all faults
- Minimal cover-automata for finite languages
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item