Security of Numerical Sensors in Automata
From MaRDI portal
Publication:2947411
DOI10.1007/978-3-319-22360-5_7zbMath1465.68139OpenAlexW1469711373MaRDI QIDQ2947411
Zhe Dang, Thomas R. Fischer, Dmitry Dementyev, William J. III Hutton
Publication date: 23 September 2015
Published in: Implementation and Application of Automata (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-22360-5_7
Formal languages and automata (68Q45) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the plurigenera of minimal algebraic 3-folds with \(K\equiv 0\)
- Vector bundles of rank 2 and linear systems on algebraic surfaces
- A theory of timed automata
- Pushdown timed automata: A binary reachability characterization and safety verification.
- Sampling automata and programs
- Information Rate of Some Classes of Non-regular Languages: An Automata-Theoretic Approach
- Quantifying Communication in Synchronized Languages
- On the Foundations of Quantitative Information Flow
- Expected Length of the Longest Probe Sequence in Hash Code Searching
- Reversal-Bounded Multicounter Machines and Their Decision Problems
- Execution Information Rate for Some Classes of Automata
- Mathematical Foundations of Computer Science 2003
- Elements of Information Theory
- On the entropy of context-free languages
- The noncomputability of the channel capacity of context-sensitive languages
