automata   1702

« earlier    

[1006.1265] Symbolic dynamics
This chapter presents some of the links between automata theory and symbolic dynamics. The emphasis is on two particular points. The first one is the interplay between some particular classes of automata, such as local automata and results on embeddings of shifts of finite type. The second one is the connection between syntactic semigroups and the classification of sofic shifts up to conjugacy.
handbook  review  dynamical_systems  automata 
9 hours ago by rvenkat
[1906.01615] Sequential Neural Networks as Automata
This work attempts to explain the types of computation that neural networks can perform by relating them to automata. We first define what it means for a real-time network with bounded precision to accept a language. A measure of network memory follows from this definition. We then characterize the classes of languages acceptable by various recurrent networks, attention, and convolutional networks. We find that LSTMs function like counter machines and relate convolutional networks to the subregular hierarchy. Overall, this work attempts to increase our understanding and ability to interpret neural networks through the lens of theory. These theoretical insights help explain neural computation, as well as the relationship between neural networks and natural language grammar.
automata  neural_networks  computation  via:cshalizi 
2 days ago by rvenkat
[1904.02931] Weighted Automata Extraction from Recurrent Neural Networks via Regression on State Spaces
We present a method to extract a weighted finite automaton (WFA) from a recurrent neural network (RNN). Our algorithm is based on the WFA learning algorithm by Balle and Mohri, which is in turn an extension of Angluin's classic \lstar algorithm. Our technical novelty is in the use of \emph{regression} methods for the so-called equivalence queries, thus exploiting the internal state space of an RNN.
This way we achieve a quantitative extension of the recent work by Weiss, Goldberg and Yahav that extracts DFAs. Experiments demonstrate that our algorithm's practicality.
grammar_induction  neural_networks  automata  via:cshalizi 
2 days ago by rvenkat
Discrete Event Systems: Modeling, Observation, and Control | Annual Review of Control, Robotics, and Autonomous Systems
"This article begins with an introduction to the modeling of discrete event systems, a class of dynamical systems with discrete states and event-driven dynamics. It then focuses on logical discrete event models, primarily automata, and reviews observation and control problems and their solution methodologies. Specifically, it discusses diagnosability and opacity in the context of partially observed discrete event systems. It then discusses supervisory control for both fully and partially observed systems. The emphasis is on presenting fundamental results first, followed by a discussion of current research directions."
control_theory  stochastic_processes  automata  via:cshalizi 
20 days ago by rvenkat
What makes Java easier to parse than C? - Stack Overflow
Parsing C++ is getting hard. Parsing Java is getting to be just as hard
q-n-a  stackex  compilers  pls  plt  jvm  c(pp)  automata  intricacy  syntax 
5 weeks ago by nhaliday
Generating Sequences with Elixir Streams
Post describing multiple Stream functions, with Wolfram automata to
demonstrate Stream.resource
elixir  stream  automata  lazy 
5 weeks ago by standupdev
John Conway's Game of Life
The Game of Life is not your typical computer game. It is a cellular automaton, and was invented by Cambridge mathematician John Conway.

This game became widely known when it was mentioned in an article published by Scientific American in 1970. It consists of a collection of cells which, based on a few mathematical rules, can live, die or multiply. Depending on the initial conditions, the cells form various patterns throughout the course of the game.
automata  algorithm  game 
6 weeks ago by maltodextrin
The Fight for the Right to Drive (New Yorker)
At Radwood, he said, he had become a member of the Human Driving Association, an organization aiming to protect people’s freedom of movement and right to drive their own cars. The H.D.A. imagines a future in which, for safety reasons, human driving is made illegal. To prevent this scenario from coming to pass, it advocates laws requiring carmakers to include a steering wheel in every vehicle; it also argues that every future car should be fully drivable under hundred-per-cent human control. For members of the H.D.A., events like Radwood aren’t purely nostalgic. They’re an expression of resistance. They believe that, in a world of level-five autonomous vehicles, driving a 1991 Volvo GL could become a radical political act. It might make you an outlaw.

[...]

In his view, this has led to a widespread sense that autonomous-driving technology is further advanced than it really is—a dangerous misperception, because people may overestimate the self-driving capabilities of the cars they buy. Given today’s technology, he writes, “The bar for use of the words ‘autonomous’ and ‘self-driving’ needs to be set so high that no media outlet can exploit them for traffic, no car company can use them in a press release to boost their stock price, and most importantly, no driver thinks they can take their hands off the wheel, even temporarily.”

Roy also questions the widespread assertion that driverless cars are safer than those driven by humans. Car companies, he argues, have chosen the metrics by which autonomous safety is judged; some focus on the number of miles driven, others on how often hands-free systems must be disengaged, and so on. This data is selectively published; there is no common standard. He argues that no autonomous car has been proved to be safer than one with a human being behind the wheel.

Finally, Roy points out that many of the problems autonomous cars promise to solve also have simpler, non-technological solutions. (This is true, of course, only if one assumes that driving isn’t a problem in itself.) To reduce traffic, governments can invest in mass-transit and road infrastructure. To diminish pollution, they can build bike lanes and encourage the adoption of electric cars. In Roy’s opinion, the best way to make driving safer has nothing to do with technology: it’s to raise licensing standards and improve driver education.

[...]

Broussard has a term for the insistence that computers can do everything better than humans can: technochauvinism. “Most of the autonomous-vehicle manufacturers are technochauvinists,” she said. “The big spike in distracted-driving traffic accidents and fatalities in the past several years has been from people texting and driving. The argument that the cars themselves are the problem is not really looking at the correct issue. We would be substantially safer if we put cell-phone-jamming devices in cars. And we already have that technology.” Like Roy, she strongly disputes both the imminence and the safety of driverless technology. “There comes a point at which you have to divorce fantasy from reality, and the reality is that autonomous vehicles are two-ton killing machines. They do not work as well as advocates would have you believe.”
automata  technology  journalism  technochauvinism 
7 weeks ago by rhgibson
Microsimulation of Traffic Flow
In traffic flow modeling, the intelligent driver model (IDM) is a time-continuous car-following model for the simulation of freeway and urban traffic. It was developed by Treiber, Hennecke and Helbing in 2000 to improve upon results provided with other "intelligent" driver models such as Gipps' model, which lose realistic properties in the deterministic limit.
traffic  automata  cars  simulation 
10 weeks ago by schleemilch
Math-Frolic!: Everybody Loves Raymond...
I regularly re-run my favorite old Raymond Smullyan puzzle (that actually goes back to "Annals of the New York Academy of Sciences," 1979, Vol. 321, although my version is an adaptation from Martin Gardner's presentation in his Colossal Book of Mathematics), and recently realized I failed to do so in 2018, so may as well remedy that now. Skip over if you've seen it before, but down below I have newly-tacked on a video tribute to Raymond from a prior 'Gathering For Gardner' Celebration:
dynamical-systems  mathematical-recreations  anecdote  puzzles  watch-the-video  automata 
march 2019 by Vaguery

« earlier    

related tags

1920  1952  1976  2002  2015  2018  2b  4*  a  a2  ai  algorithm  algorithms  analogy  analyser  analysis  analyzer  anecdote  animate  animation  architecture  armatures  art  article  artificial-life  artificialintelligence  audio  automation  automaton  awareness  awesome  awk  b  being  bibliography  bicameralmind  bio-chemistry  bio-physics  biology  blanche  blog  blog:  blogpost  blogs  book  books  breath  bronze  brunolatour  byzantine  c(pp)  cars  cellular-automata  cellular  celullar  cheatsheet  christopherswift  clock  clojure  code  coding  cognition  comparison  compiler  compilers  complexity  compression  compsci  computation  computer  computerscience  computing  consciousness  control_theory  conway  cool  cosma-shalizi  crafts  crankycontraptions  creativecode  crosstab  cs  decision  depersonalization  design  device  dfa  digestingduck  dissociative  distance  documentation  dynamical-systems  dynamical_systems  editdistance  editors  electricity  elephant  elixir  even  evolution  example  examples  expression  expressions  external  fast  fiction  finite.automata  finite  flex  floss  flow  formal-methods  foundational-work  fragmentation  fran  francine  frankenstein  frantone  friar  fromthearchives  fsa  fsm  fst  fun  fuzzy  game  gameoflife  generative  generativeart  generator  god  gotchas  grammar_induction  graphics  greek  grep  hallucination  handbook  hash  hephaestus  hero  historiography  history  homer  howto  hugo  ifttt  iliad  imagine  inanimacy  inanimate  indifference  inside  inspiration  intelligence  interactive  interesting  intricacy  ion_channels  java  javascript  jflex  jlex  journalism  js  julianjaynes  jvm  karelcapek  kurtvonnegut  language  latency  latex  lazy  learning  lemma  levenshtein  lex  lexer  lexical  library  life  literature  logic  london  lua  machine  maillardet  maker  makered  making  manufacture  markov_models  maryshelley  material  math  mathematical-recreations  mathematics  mechanical  mechanicalturk  mechanism  medieval  metaphor  milling  mind  miniatures  monsters  movie  n  network  neural-computation  neural-net  neural-networks  neural  neural_networks  neuroscience  nfa  nier  nierautomata  nn  number  numerical-methods  object  objektbuch  odd  ooo  opensource  optimization  outside  papercraft  papertoy  parser  parsing  physics  pinterest  pixel  pixels  plato  playerpiano  pls  plt  postwar  preternature  probability  programming  prometheus  pumping  puppet  purposelessness  pushdown  puzzles  python  q-n-a  qualia  racket  rather-interesting  react  recurrent-networks  reference  regex  regexp  regular.expessions  regular  regularexpressions  reinforcement  religion  renedescartes  representation  req  review  rnn  robot  rogerbacon  rust  scanner  scifi  sculpting  search  shop  simulation  sound  stackex  state-machines  state  statemachine  stochastic_processes  strange  strangest  stream  string_matching  strings  subject  syntax  teaching  technochauvinism  technology  techtariat  temporal  testing  text  textile  the  theory  tip-of-tongue  to-cite  to-write-about  toc  tools  traffic  unix  vector  visual  voice  watch-the-video  we  wfsa  wikipedia  wireworld  wolfram  worldcup  yak-shaving  ztellman 

Copy this bookmark:



description:


tags: