scientific article; zbMATH DE number 3358370
From MaRDI portal
Publication:5632473
zbMath0225.94035MaRDI QIDQ5632473
Publication date: 1972
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Formal languages and automata (68Q45) Research exposition (monographs, survey articles) pertaining to computer science (68-02)
Related Items
On the complexity of existence of homing sequences for nondeterministic finite state machines ⋮ Deriving Homing Sequences for Finite State Machines with Timed Guards ⋮ Unnamed Item ⋮ Behaviour, reduction and minimization of finite \({\mathbb{L}}\)-automata ⋮ On the output function in a Ginsburg's machine ⋮ Defining and measuring trophic role similarity in food webs using regular equivalence ⋮ On the geometric concomitants ⋮ On the geometric concomitant equation ⋮ Describing Homing and Distinguishing Sequences for Nondeterministic Finite State Machines via Synchronizing Automata ⋮ Computation of distances for regular and context-free probabilistic languages ⋮ Equivalence, reduction and minimization of finite automata over semirings ⋮ Unnamed Item ⋮ Complete model-based equivalence class testing for nondeterministic systems ⋮ Synthesis of distinguishing test cases for timed finite state machines ⋮ On deriving test suites for nondeterministic finite state machines with time-outs ⋮ FSM-based testing from user defined faults adapted to incremental and mutation testing ⋮ Various kinds of automata with weights ⋮ REPRESENTATION OF SEMIAUTOMATA BY CANONICAL WORDS AND EQUIVALENCES, PART II: SPECIFICATION OF SOFTWARE MODULES ⋮ Fuzzy acceptors for syntactic pattern recognition
