Open AccessBounded repairability for regular tree languages
Author(s) -
Gabriele Puppis,
Cristian Riveros,
Sławek Staworko
Publication year - 2012
Publication title -
hal (le centre pour la communication scientifique directe)
Language(s) - Uncategorized
Resource type - Conference proceedings
DOI - 10.1145/2274576.2274593
Subject(s) - regular language , bounded function , automaton , tree automaton , tree (set theory) , discrete mathematics , regular expression , mathematics , computer science , combinatorics , xml , deterministic finite automaton , focus (optics) , theoretical computer science , programming language , mathematical analysis , physics , optics , operating system
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom