The following pages link to (Q2754074):
Displayed 23 items.
- Quantifying communication in synchronized languages (Q344766) (← links)
- Similarity in languages and programs (Q391201) (← links)
- Linear reachability problems and minimal solutions to linear Diophantine equation systems (Q703515) (← links)
- Execution information rate for some classes of automata (Q899317) (← links)
- Verification in loosely synchronous queue-connected discrete timed automata. (Q1401187) (← links)
- Generalized discrete timed automata: Decidable approximations for safety verification. (Q1401259) (← links)
- Pushdown timed automata: A binary reachability characterization and safety verification. (Q1401320) (← links)
- Past pushdown timed automata and safety verification. (Q1426159) (← links)
- Grammatical characterizations of NPDAs and VPDAs with counters (Q1784750) (← links)
- Counter machines and verification problems. (Q1853523) (← links)
- Augmenting the discrete timed automaton with other data structures. (Q1853524) (← links)
- Presburger liveness verification of discrete timed automata. (Q1874402) (← links)
- Eliminating the storage tape in reachability constructions. (Q1874416) (← links)
- Reachability relations of timed pushdown automata (Q2221811) (← links)
- Sampling automata and programs (Q2339473) (← links)
- Information rate of some classes of non-regular languages: an automata-theoretic approach (Q2407088) (← links)
- On store languages and applications (Q2417850) (← links)
- On composition and lookahead delegation of \(e\)-services modeled by automata (Q2566017) (← links)
- Quantifying Communication in Synchronized Languages (Q3196422) (← links)
- Revisiting Underapproximate Reachability for Multipushdown Systems (Q5039520) (← links)
- Reachability in Timed Counter Systems (Q5179060) (← links)
- Lossiness of communication channels modeled by transducers1 (Q5283445) (← links)
- Semilinearity of Families of Languages (Q5859668) (← links)