BibSLEIGH — automaton tag

automaton

automaton

Tag #automaton

1648 papers:

ASPLOS-2020-AngstadtJW #bound #kernel #learning #legacy #string: Accelerating Legacy String Kernels via Bounded Automata Learning (KA, JBJ, WW), pp. 235–249.
ASPLOS-2020-SadrediniRLSS #adaptation #named #performance: FlexAmata: A Universal and Efficient Adaption of Applications to Spatial Automata Processing Accelerators (ES, RR, ML, MS, KS), pp. 219–234.
CSL-2020-AngluinAF #ambiguity #predict #query: Strongly Unambiguous Büchi Automata Are Polynomially Predictable With Membership Queries (DA, TA, DF), p. 17.
CSL-2020-LodingT #reduction: State Space Reduction For Parity Automata (CL, AT), p. 16.
CIAA-2019-BakaricKR #implementation #string: Enumerated Automata Implementation of String Dictionaries (RB, DK, SR), pp. 33–44.
CIAA-2019-Beier0 #finite #linear: Semi-linear Lattices and Right One-Way Jumping Finite Automata (Extended Abstract) (SB, MH0), pp. 70–82.
CIAA-2019-FujiyoshiP #finite #graph #set: A Simple Extension to Finite Tree Automata for Defining Sets of Labeled, Connected Graphs (AF, DP), pp. 121–132.
CIAA-2019-HanKMS #architecture #finite #simulation: A General Architecture of Oritatami Systems for Simulating Arbitrary Finite Automata (YSH, HK, YM, SS), pp. 146–157.
CIAA-2019-KutribMW #multi: Input-Driven Multi-counter Automata (MK, AM, MW), pp. 197–208.
CIAA-2019-Okhotin #bound: Graph-Walking Automata: From Whence They Come, and Whither They are Bound (AO), pp. 10–29.
CIAA-2019-SmithS #2d #problem #strict: Decision Problems for Restricted Variants of Two-Dimensional Automata (TJS, KS), pp. 222–234.
DLT-2019-Boker: Inherent Size Blowup in ω-Automata (UB), pp. 3–17.
DLT-2019-DobronravovDO #finite #on the #string: On the Length of Shortest Strings Accepted by Two-Way Finite Automata (ED, ND, AO), pp. 88–99.
DLT-2019-GeffertBS #distance #edit distance: Input-Driven Pushdown Automata for Edit Distance Neighborhood (VG, ZB, AS), pp. 113–126.
DLT-2019-KariRV #finite #rank #word: Words of Minimum Rank in Deterministic Finite Automata (JK, AR, AV), pp. 74–87.
DLT-2019-KuperbergPP #algorithm #induction: Coinductive Algorithms for Büchi Automata (DK, LP, DP), pp. 206–220.
DLT-2019-MrazO #on the: On Shrinking Restarting Automata of Window Size One and Two (FM, FO), pp. 140–153.
FM-2019-DeifelMSW #refinement: Generic Partition Refinement and Weighted Tree Automata (HPD, SM, LS, TW), pp. 280–297.
FM-2019-Jantsch0B0 #ambiguity #ltl: From LTL to Unambiguous Büchi Automata via Disambiguation of Alternating Automata (SJ, DM0, CB, JK0), pp. 262–279.
FM-2019-Sheinvald #infinity #learning: Learning Deterministic Variable Automata over Infinite Alphabets (SS), pp. 633–650.
FSCD-2019-BiernackaC #call-by: Deriving an Abstract Machine for Strong Call by Need (MB, WC), p. 20.
IFM-2019-HsiehM #named #protocol #verification: Dione: A Protocol Verification System Built with Dafny for I/O Automata (CH, SM), pp. 227–245.
IFM-2019-LanotteT #metric #probability #similarity: Computing Bisimilarity Metrics for Probabilistic Timed Automata (RL, ST), pp. 303–321.
SEFM-2019-AvellanedaP #approach #learning #satisfiability: Learning Minimal DFA: Taking Inspiration from RPNI to Improve SAT Approach (FA, AP), pp. 243–256.
CoG-2019-KreitzerAP #automation #generative: Automatic Generation of Diverse Cavern Maps with Morphing Cellular Automata (MK, DA, RP), pp. 1–8.
MoDELS-2019-BesnardTJ0D19a #approach #modelling #monitoring #uml #verification: Verifying and Monitoring UML Models with Observer Automata: A Transformation-Free Approach (VB, CT, FJ, MB0, PD), pp. 161–171.
POPL-2019-SpathAB #analysis #data flow #using: Context-, flow-, and field-sensitive data-flow analysis using synchronized Pushdown systems (JS, KA0, EB), p. 29.
PPDP-2019-AccattoliCGC: Crumbling Abstract Machines (BA, AC, GG, CSC), p. 15.
ASE-2019-ShermanH #constraints #string: Accurate String Constraints Solution Counting with Weighted Automata (ES, AH), pp. 440–452.
CASE-2019-ThuijsmanHTRS #finite #synthesis: Computational Effort of BDD-based Supervisor Synthesis of Extended Finite Automata (ST, DH, RJMT, MAR, RRHS), pp. 486–493.
CADE-2019-HavlenaHLV #lazy evaluation: Automata Terms in a Lazy WSkS Decision Procedure (VH, LH, OL, TV), pp. 300–318.
CAV-2019-BansalV #safety: Safety and Co-safety Comparator Automata for Discounted-Sum Inclusion (SB, MYV), pp. 60–78.
CAV-2019-Busatto-GastonM #approach #robust #synthesis: Robust Controller Synthesis in Timed Büchi Automata: A Symbolic Approach (DBG, BM, PAR, OS), pp. 572–590.
CAV-2019-DAntoniFS0: Symbolic Register Automata (LD, TF, MS, AS0), pp. 3–21.
CAV-2019-Gastin0S #algorithm #constraints #performance: Fast Algorithms for Handling Diagonal Constraints in Timed Automata (PG, SM0, BS), pp. 41–59.
CAV-2019-LangeY #communication #interactive #verification: Verifying Asynchronous Interactions via Communicating Session Automata (JL, NY), pp. 97–117.
CAV-2019-RoussanalySM #abstraction #algorithm #refinement: Abstraction Refinement Algorithms for Timed Automata (VR, OS, NM), pp. 22–40.
CAV-2019-SotoHSZ #hybrid #linear #synthesis: Membership-Based Synthesis of Linear Hybrid Automata (MGS, TAH, CS0, LZ), pp. 297–314.
CAV-2019-IosifX #first-order: Alternating Automata Modulo First Order Theories (RI, XX), pp. 43–63.
TAP-2019-AndreAGR #abstraction #testing: Repairing Timed Automata Clock Guards through Abstraction and Testing (ÉA, PA, AG, MR), pp. 129–146.
VMCAI-2019-GermaneM #analysis #continuation: Relatively Complete Pushdown Analysis of Escape Continuations (KG, MM), pp. 205–225.
CIAA-2018-AllauzenR #algorithm #finite: Algorithms for Weighted Finite Automata with Failure Transitions (CA, MDR), pp. 46–58.
CIAA-2018-AttouMZ #bottom-up: The Bottom-Up Position Tree Automaton and Its Compact Version (SA, LM, DZ), pp. 59–70.
CIAA-2018-BartholdiGKP: A New Hierarchy for Automaton Semigroups (LB, TG, IK, MP), pp. 71–83.
CIAA-2018-BerlinkovN #random: Synchronizing Random Almost-Group Automata (MVB, CN), pp. 84–96.
CIAA-2018-BjorklundDJ #comparison: A Comparison of Two N-Best Extraction Methods for Weighted Tree Automata (JB, FD, AJ), pp. 97–108.
CIAA-2018-Davies #complexity #finite: State Complexity of Reversals of Deterministic Finite Automata with Output (SD), pp. 133–145.
CIAA-2018-DeBenedettoC #algorithm #multi #regular expression: Algorithms and Training for Weighted Multiset Automata and Regular Expressions (JD, DC0), pp. 146–158.
CIAA-2018-GuillonPP #self: Non-self-embedding Grammars, Constant-Height Pushdown Automata, and Limited Automata (BG, GP, LP), pp. 186–197.
CIAA-2018-KutribMW #preprocessor #queue: Boosting Pushdown and Queue Machines by Preprocessing (MK, AM, MW), pp. 28–40.
CIAA-2018-LombardyS: The Validity of Weighted Automata (SL, JS), pp. 41–45.
CIAA-2018-LombardyS18a: Two Routes to Automata Minimization and the Ways to Reach It Efficiently (SL, JS), pp. 248–260.
CIAA-2018-NozakiHYS #finite #using: Enumeration of Cryptarithms Using Deterministic Finite Automata (YN, DH, RY, AS), pp. 286–298.
CIAA-2018-Sakharov #approximate #parsing: One-Counter Automata for Parsing and Language Approximation (AS), pp. 299–311.
CIAA-2018-SinghK #complexity #on the: On Syntactic Complexity of Circular Semi-flower Automata (SNS, KVK), pp. 312–323.
DLT-2018-0001JJ #complexity #finite #problem #self #verification: Computational Complexity of Decision Problems on Self-verifying Finite Automata (MH0, SJ, JJJ), pp. 404–415.
DLT-2018-AlmagorCMP: Weak Cost Register Automata Are Still Powerful (SA, MC, FM, GAP), pp. 83–95.
DLT-2018-Beier0 #decidability #finite: Decidability of Right One-Way Jumping Finite Automata (SB, MH0), pp. 109–120.
DLT-2018-BondarV: A Characterization of Completely Reachable Automata (EAB, MVV), pp. 145–155.
DLT-2018-CaucalR: Recognizability for Automata (DC, CR), pp. 206–218.
DLT-2018-Crespi-Reghizzi #graph: Deque Languages, Automata and Planar Graphs (SCR, PSP), pp. 243–255.
DLT-2018-FiliotMR #logic: A Pattern Logic for Automata with Outputs (EF, NM, JFR), pp. 304–317.
DLT-2018-GonzeJ #on the #reachability #set: On Completely Reachable Automata and Subset Reachability (FG, RMJ), pp. 330–341.
DLT-2018-GuillonKMP #transducer: Reversible Pushdown Transducers (BG, MK, AM, LP), pp. 354–365.
DLT-2018-GuillonPPP #linear: Two-Way Automata and One-Tape Machines - Read Only Versus Linear Time (BG, GP, LP, DP), pp. 366–378.
DLT-2018-GusevJP #independence: Dynamics of the Independence Number and Automata Synchronization (VVG, RMJ, DP), pp. 379–391.
DLT-2018-IbarraM #stack: Generalizations of Checking Stack Automata: Characterizations and Hierarchies (OHI, IM), pp. 416–428.
DLT-2018-JiraskovaO #bound #complexity #towards: Towards Exact State Complexity Bounds for Input-Driven Pushdown Automata (GJ, AO), pp. 441–452.
DLT-2018-LandwehrL #constraints: Projection for Büchi Tree Automata with Constraints Between Siblings (PL, CL), pp. 478–490.
DLT-2018-LodingP #ambiguity #on the: On Finitely Ambiguous Büchi Automata (CL, AP), pp. 503–515.
DLT-2018-Otto #on the #order: On Deterministic Ordered Restart-Delete Automata (FO), pp. 529–540.
DLT-2018-Rabinovich #ambiguity: Complementation of Finitely Ambiguous Büchi Automata (AR), pp. 541–552.
FM-2018-0001BFLMR #energy #nondeterminism #robust #synthesis #using: Optimal and Robust Controller Synthesis - Using Energy Timed Automata with Uncertainty (GB0, PB, UF, KGL, NM, PAR), pp. 203–221.
FM-2018-AvellanedaP: FSM Inference from Long Traces (FA, AP), pp. 93–109.
FSCD-2018-Genet: Completeness of Tree Automata Completion (TG), p. 20.
IFM-2018-NguyenT #branch #logic: Branching Temporal Logic of Calls and Returns for Pushdown Systems (HVN, TT), pp. 326–345.
ICFP-2018-WeiDR #functional: Refunctionalization of abstract abstract machines: bridging the gap between abstract abstract machines and abstract definitional interpreters (functional pearl) (GW, JMD, TR), p. 28.
ICML-2018-WeissGY #network #query #using: Extracting Automata from Recurrent Neural Networks Using Queries and Counterexamples (GW, YG, EY), pp. 5244–5253.
SAS-2018-Kincaid #invariant: Numerical Invariants via Abstract Machines (ZK), pp. 24–42.
CAV-2018-ArgyrosD: The Learnability of Symbolic Automata (GA, LD), pp. 427–445.
CAV-2018-FengKLXZ #monitoring #multi: Monitoring CTMCs by Multi-clock Timed Automata (YF, JPK, HL, BX, NZ), pp. 507–526.
CAV-2018-KretinskyMSZ #ltl: Rabinizer 4: From LTL to Your Favourite Deterministic Automaton (JK, TM, SS, CZ), pp. 567–577.
CAV-2018-BansalCV: Automata vs Linear-Programming Discounted-Sum Inclusion (SB, SC, MYV), pp. 99–116.
CSL-2018-ChadhaS0 #approximate #probability #regular expression: Approximating Probabilistic Automata by Regular Languages (RC, APS, MV0), p. 23.
VMCAI-2018-LiTZS #learning: Learning to Complement Büchi Automata (YL0, AT, LZ0, SS), pp. 313–335.
ICSME-2017-VerwerH #learning #named: flexfringe: A Passive Automaton Learning Package (SV, CAH), pp. 638–642.
SCAM-2017-LivaKP #java: Extracting Timed Automata from Java Methods (GL, MTK0, MP0), pp. 91–100.
AFL-2017-DrosteEK: The Triple-Pair Construction for Weighted ω-Pushdown Automata (MD, ZÉ, WK), pp. 101–113.
AFL-2017-GelleI: Reversible languages having finitely many reduced automata (KG, SI), pp. 114–127.
AFL-2017-HolzerKMW: Input-Driven Double-Head Pushdown Automata (MH, MK, AM, MW), pp. 128–142.
AFL-2017-MaraisZ #complexity #difference #self #symmetry #verification: Descriptional Complexity of Non-Unary Self-Verifying Symmetric Difference Automata (LM, LvZ), pp. 157–169.
AFL-2017-NagyPS #concept: A New Sensing 5'->3' Watson-Crick Automata Concept (BN, SP, HMMS), pp. 195–204.
AFL-2017-NakanishiY: Affine counter automata (MN, AY), pp. 205–218.
AFL-2017-PlatekO #on the: On h-Lexicalized Restarting Automata (MP, FO), pp. 219–233.
CIAA-2017-Bordihn0 #finite #nondeterminism #on the: On the Number of Active States in Deterministic and Nondeterministic Finite Automata (HB, MH0), pp. 40–51.
CIAA-2017-DandoL: From Hadamard Expressions to Weighted Rotating Automata and Back (LMD, SL), pp. 163–174.
CIAA-2017-FijalkowGKK #monad #named: Stamina: Stabilisation Monoids in Automata Theory (NF, HG, EK, DK), pp. 101–112.
CIAA-2017-Pous #algorithm #induction: CoInductive Automata Algorithms (DP), p. xvii-xviii.
CIAA-2017-Ryzhikov #problem: Synchronization Problems in Automata Without Non-trivial Cycles (AR), pp. 188–200.
DLT-2017-Beier0K #complexity #decidability #finite: Operational State Complexity and Decidability of Jumping Finite Automata (SB, MH0, MK), pp. 96–108.
DLT-2017-Broda0MMR #on the: On the Mother of All Automata: The Position Automaton (SB, MH0, EM, NM, RR), pp. 134–146.
DLT-2017-CartonES: Two-Way Two-Tape Automata (OC, LE, OS), pp. 147–159.
DLT-2017-EndrullisSS #finite: Undecidability and Finite Automata (JE, JOS, TS), pp. 160–172.
DLT-2017-IbarraM #decidability #stack: Variations of Checking Stack Automata: Obtaining Unexpected Decidability Properties (OHI, IM), pp. 235–246.
DLT-2017-MrazO: Deleting Deterministic Restarting Automata with Two Windows (FM, FO), pp. 272–283.
DLT-2017-PighizziniP: Limited Automata and Unary Languages (GP, LP), pp. 308–319.
DLT-2017-RubtsovV #complexity #on the #set: On Computational Complexity of Set Automata (AAR, MNV), pp. 332–344.
DLT-2017-Yamakami #bound #complexity #probability: One-Way Bounded-Error Probabilistic Pushdown Automata and Kolmogorov Complexity - (Preliminary Report) (TY), pp. 353–364.
FSCD-2017-BiernackaCZ #hybrid: Generalized Refocusing: From Hybrid Strategies to Abstract Machines (MB, WC, KZ), p. 17.
FSCD-2017-SuzukiF0T #higher-order #model checking #recursion: Streett Automata Model Checking of Higher-Order Recursion Schemes (RS0, KF, NK0, TT), p. 18.
CIG-2017-AckerLB #network #simulation: Cellular automata simulation on FPGA for training neural networks with virtual world imagery (OVA, OL, GB), pp. 304–305.
OOPSLA-2017-AdamsM #strict: Restricting grammars with tree automata (MDA, MM), p. 25.
OOPSLA-2017-WangDS #finite #synthesis #using: Synthesis of data completion scripts using finite tree automata (XW0, ID, RS), p. 26.
PLDI-2017-TanLX #analysis #modelling #performance #points-to #precise: Efficient and precise points-to analysis: modeling the heap by merging equivalent automata (TT0, YL0, JX), pp. 278–291.
POPL-2017-GermaneM #analysis: A posteriori environment analysis with Pushdown Delta CFA (KG, MM), pp. 19–31.
POPL-2017-MoermanS0KS #learning: Learning nominal automata (JM, MS, AS0, BK, MS), pp. 613–625.
PPDP-2017-AccattoliB #complexity: Environments and the complexity of abstract machines (BA, BB), pp. 4–16.
CAV-2017-BrihayeGHM #composition #named: MightyL: A Compositional Translation from MITL to Timed Automata (TB, GG, HMH, BM), pp. 421–440.
CAV-2017-DAntoniV #power of #transducer: The Power of Symbolic Automata and Transducers (LD, MV), pp. 47–67.
CAV-2017-QuatmannJK #markov #multi: Markov Automata with Multiple Objectives (TQ, SJ, JPK), pp. 140–159.
CAV-2017-FortinMW #linear #model checking: Model-Checking Linear-Time Properties of Parametrized Asynchronous Shared-Memory Pushdown Systems (MF, AM, IW), pp. 155–175.
CSL-2017-Boker #on the: On the (In)Succinctness of Muller Automata (UB), p. 16.
CSL-2017-CartonFL: Polishness of Some Topologies Related to Automata (OC, OF, DL), p. 16.
CSL-2017-HeerdtS0 #category theory #framework #learning #named: CALF: Categorical Automata Learning Framework (GvH, MS, AS0), p. 24.
CSL-2017-Veanes: Symbolic Automata Theory with Applications (Invited Talk) (MV), p. 3.
ICST-2017-DevroeyPPLSH #empirical #equivalence #evaluation #modelling #simulation: Automata Language Equivalence vs. Simulations for Model-Based Mutant Equivalence: An Empirical Evaluation (XD, GP, MP, AL, PYS, PH), pp. 424–429.
ICST-2017-PastoreMM #automation: Timed k-Tail: Automatic Inference of Timed Automata (FP, DM, LM), pp. 401–411.
ICST-2017-TapplerAB #communication #learning #modelling #testing: Model-Based Testing IoT Communication via Active Automata Learning (MT, BKA, RB), pp. 276–287.
ICST-2017-WangPB #case study #requirements #testing: System Testing of Timing Requirements Based on Use Cases and Timed Automata (CW, FP, LCB), pp. 299–309.
ICTSS-2017-PetrenkoAGO #sequence: From Passive to Active FSM Inference via Checking Sequence Construction (AP, FA, RG, CO), pp. 126–141.
ICTSS-2017-Tvardovskii #reduction #specification #testing: Refining the Specification FSM When Deriving Test Suites w.r.t. the Reduction Relation (AT), pp. 333–339.
VMCAI-2017-HolikHLRV #refinement #validation: Counterexample Validation and Interpolation-Based Refinement for Forest Automata (LH, MH, OL, AR, TV), pp. 288–309.
CIAA-2016-Axelsen0K #finite: The Degree of Irreversibility in Deterministic Finite Automata (HBA, MH0, MK), pp. 15–26.
CIAA-2016-Demaille #multi: Derived-Term Automata of Multitape Rational Expressions (AD), pp. 51–63.
CIAA-2016-FernauK #exponential #finite #problem: Problems on Finite Automata and the Exponential Time Hypothesis (HF, AK), pp. 89–100.
CIAA-2016-Fujiyoshi #algorithm #multi #problem: A Practical Algorithm for the Uniform Membership Problem of Labeled Multidigraphs of Tree-Width 2 for Spanning Tree Automata (AF), pp. 101–112.
CIAA-2016-Gluck #simulation: A Practical Simulation Result for Two-Way Pushdown Automata (RG), pp. 113–124.
CIAA-2016-KhoussainovL #algebra #finite #infinity #problem: Decision Problems for Finite Automata over Infinite Algebraic Structures (BK, JL), pp. 3–11.
CIAA-2016-KisielewiczKS: Experiments with Synchronizing Automata (AK, JK, MS), pp. 176–188.
CIAA-2016-Lerner #on the: On Synchronizing Automata and Uniform Distribution (EL), pp. 202–212.
CIAA-2016-WangO: Weighted Restarting Automata as Language Acceptors (QW, FO), pp. 298–309.
CIAA-2016-WeidemanMBW #ambiguity #backtracking #behaviour #nondeterminism #regular expression #using: Analyzing Matching Time Behavior of Backtracking Regular Expression Matchers by Using Ambiguity of NFA (NW, BvdM, MB, BWW), pp. 322–334.
DLT-2016-Basten #ambiguity #detection #multi #using: Context-Free Ambiguity Detection Using Multi-stack Pushdown Automata (HJSB), pp. 1–12.
DLT-2016-Bedon #branch: Complementation of Branching Automata for Scattered and Countable Series-Parallel Posets (NB), pp. 13–25.
DLT-2016-BrodaMMR #regular expression: Position Automaton Construction for Regular Expressions with Intersection (SB, AM, NM, RR), pp. 51–63.
DLT-2016-Denkinger #context-free grammar #multi: An Automata Characterisation for Multiple Context-Free Languages (TD), pp. 138–150.
DLT-2016-Duck #graph #infinity #logic: Weighted Automata and Logics on Infinite Graphs (SD), pp. 151–163.
DLT-2016-HerrmannV: Weighted Symbolic Automata with Data Storage (LH, HV), pp. 203–215.
DLT-2016-JirasekJS #ambiguity #finite: Operations on Unambiguous Finite Automata (JJJ, GJ, JS), pp. 243–255.
DLT-2016-MichalewskiS #ambiguity: Unambiguous Büchi Is Weak (HM, MS), pp. 319–331.
DLT-2016-Paul #ambiguity #finite #on the #polynomial: On Finite and Polynomial Ambiguity of Weighted Tree Automata (EP), pp. 368–379.
DLT-2016-SzykulaV: An Extremal Series of Eulerian Synchronizing Automata (MS, VV), pp. 380–392.
DLT-2016-UezatoM #approach #problem: Monoid-Based Approach to the Inclusion Problem on Superdeterministic Pushdown Automata (YU, YM), pp. 393–405.
FM-2016-CimattiMS #hybrid #network: From Electrical Switched Networks to Hybrid Automata (AC, SM, MS), pp. 164–181.
FSCD-2016-GimenezO #2d #interactive #interpreter: Interaction Automata and the ia2d Interpreter (SG, DO), p. 11.
FSCD-2016-SternagelS #confluence #orthogonal: Certifying Confluence of Almost Orthogonal CTRSs via Exact Tree Automata Completion (CS, TS), p. 16.
IFM-2016-BosSV #learning #metric: Enhancing Automata Learning by Log-Based Metrics (PvdB, RS, FWV), pp. 295–310.
IFM-2016-DArgenioHLS #approximate #probability #statistics: Statistical Approximation of Optimal Schedulers for Probabilistic Timed Automata (PRD, AH, AL, SS), pp. 99–114.
IFM-2016-FendrichL #component #fault #interface: A Generalised Theory of Interface Automata, Component Compatibility and Error (SF, GL), pp. 160–175.
SEFM-2016-BezdekBBC #ltl #parametricity #synthesis: LTL Parameter Synthesis of Parametric Timed Automata (PB, NB, JB, IC), pp. 172–187.
ICML-2016-GlaudeP #learning #probability: PAC learning of Probabilistic Automaton based on the Method of Moments (HG, OP), pp. 820–829.
LOPSTR-2016-ZielenkiewiczS #approach #logic: Automata Theory Approach to Predicate Intuitionistic Logic (MZ, AS), pp. 345–360.
POPL-2016-GilrayL0MH #analysis #control flow #for free: Pushdown control-flow analysis for free (TG, SL, MDA0, MM, DVH), pp. 691–704.
POPL-2016-HagueKO #bound #higher-order: Unboundedness and downward closures of higher-order pushdown automata (MH, JK, CHLO), pp. 151–163.
SAS-2016-ChatterjeeHO #monitoring: Quantitative Monitor Automata (KC, TAH, JO), pp. 23–38.
ASE-2016-YangJGS #approach #verification: Verifying simulink stateflow model: timed automata approach (YY, YJ, MG, JGS), pp. 852–857.
GPCE-2016-LeeSO #regular expression: Synthesizing regular expressions from examples for introductory automata assignments (ML, SS, HO), pp. 70–80.
FASE-2016-PutterW #correctness #lts #verification: Verifying a Verifier: On the Formal Correctness of an LTS Transformation Verification Technique (SdP, AW), pp. 383–400.
CAV-2016-BaierK0K0W #ambiguity #markov: Markov Chains and Unambiguous Büchi Automata (CB, SK, JK0, SK, DM0, JW0), pp. 23–42.
CAV-2016-BouyerCM #reachability: Symbolic Optimal Reachability in Weighted Timed Automata (PB, MC, NM), pp. 513–530.
CAV-2016-KafleGM #abstract interpretation #finite #horn clause #named #using #verification: Rahft: A Tool for Verifying Horn Clauses Using Abstract Interpretation and Finite Tree Automata (BK, JPG, JFM), pp. 261–268.
CAV-2016-WangTLYJ #analysis #logic #representation #string: String Analysis via Automata Manipulation with Logic Circuit Representation (HEW, TLT, CHL, FY, JHRJ), pp. 241–260.
CAV-2016-SickertEJK #linear #logic: Limit-Deterministic Büchi Automata for Linear Temporal Logic (SS, JE, SJ, JK), pp. 312–332.
CSL-2016-KolodziejczykMP #decidability #logic #theorem: The Logical Strength of Büchi's Decidability Theorem (LAK, HM, PP, MS), p. 16.
ICTSS-2016-PetrenkoNR #constraints #generative #testing #theorem proving: Test Generation by Constraint Solving and FSM Mutant Killing (AP, ONT, SR), pp. 36–51.
VMCAI-2016-CrescenzoT #composition #problem #synthesis: A General Modular Synthesis Problem for Pushdown Systems (IDC, SLT), pp. 495–513.
CIAA-J-2013-CaralpRT15: Trimming visibly pushdown automata (MC, PAR, JMT), pp. 13–29.
CIAA-J-2013-DebarbieuxGNSZ15 #query #word #xml #xpath: Early nested word automata for XPath query answering on XML streams (DD, OG, JN, TS, MZ), pp. 100–125.
CIAA-J-2013-INIBT15 #taxonomy: Compressed automata for dictionary matching (TI, TN, SI, HB, MT), pp. 30–41.
CIAA-J-2013-Konstantinidis15 #implementation: Implementation and Application of Automata (CIAA 2013) (SK), p. 1.
CIAA-J-2013-KutribMMPW15 #decidability #finite #queue: Deterministic input-driven queue automata: Finite turns, decidability, and closure properties (MK, AM, CM, BP, MW), pp. 58–71.
CIAA-J-2013-Maletti15: Hyper-optimization for deterministic tree automata (AM), pp. 72–87.
CIAA-2015-Bollig #concurrent #logic #modelling: Automata and Logics for Concurrent Systems: Five Models in Five Pages (BB), pp. 3–12.
CIAA-2015-BorsottiBCM #ambiguity #parsing #regular expression: From Ambiguous Regular Expressions to Deterministic Parsing Automata (AB, LB, SCR, AM), pp. 35–48.
CIAA-2015-DangDFH #security: Security of Numerical Sensors in Automata (ZD, DD, TRF, WJHI), pp. 76–88.
CIAA-2015-FernauPS #complexity #finite: Jumping Finite Automata: Characterizations and Complexity (HF, MP, MLS), pp. 89–101.
CIAA-2015-Giaquinta #nondeterminism: Run-Length Encoded Nondeterministic KMP and Suffix Automata (EG), pp. 102–113.
CIAA-2015-GruberHJ #finite #nondeterminism: More on Deterministic and Nondeterministic Finite Cover Automata — Extended Abstract (HG, MH, SJ), pp. 114–126.
CIAA-2015-HeamJ #generative #morphism #on the #random: On the Uniform Random Generation of Non Deterministic Automata Up to Isomorphism (PCH, JLJ), pp. 140–152.
CIAA-2015-HeamJ15a #generative #random #realtime: Random Generation and Enumeration of Accessible Deterministic Real-Time Pushdown Automata (PCH, JLJ), pp. 153–164.
CIAA-2015-Hulden #finite #regular expression: From Two-Way to One-Way Finite Automata — Three Regular Expression-Based Methods (MH), pp. 176–187.
CIAA-2015-KushikY #finite #nondeterminism #sequence #state machine: Describing Homing and Distinguishing Sequences for Nondeterministic Finite State Machines via Synchronizing Automata (NK, NY), pp. 188–198.
CIAA-2015-MohriR #ambiguity #on the: On the Disambiguation of Weighted Automata (MM, MDR), pp. 263–278.
CIAA-2015-NakanishiY #problem #quantum: Classical and Quantum Counter Automata on Promise Problems (MN, AY), pp. 224–237.
CIAA-2015-Szykula: Checking Whether an Automaton Is Monotonic Is NP-complete (MS), pp. 279–291.
CIAA-2015-Watson #finite #hardware #implementation #regular expression: Hardware Implementations of Finite Automata and Regular Expressions — Extended Abstract (BWW), pp. 13–17.
DLT-2015-BianchiHK #liveness #on the #problem: On the Size of Two-Way Reasonable Automata for the Liveness Problem (MPB, JH, IK), pp. 120–131.
DLT-2015-BrandlS #analysis #complexity #finite #monad: Complexity Analysis: Transformation Monoids of Finite Automata (CB, HUS), pp. 143–154.
DLT-2015-CzybaST #finite #infinity #modelling: Finite Automata Over Infinite Alphabets: Two Models with Transitions for Local Change (CC, CS, WT), pp. 203–214.
DLT-2015-GainutdinovaY #probability #problem #quantum: Unary Probabilistic and Quantum Automata on Promise Problems (AG, AY), pp. 252–263.
DLT-2015-HolzerJK #finite: Minimal Reversible Deterministic Finite Automata (MH, SJ, MK), pp. 276–287.
DLT-2015-KlimannPS #infinity: A Connected 3-State Reversible Mealy Automaton Cannot Generate an Infinite Burnside Group (IK, MP, DS), pp. 313–325.
DLT-2015-Marsault: Surminimisation of Automata (VM), pp. 352–363.
DLT-2015-MasopustT #complexity #on the #testing: On the Complexity of k-Piecewise Testability and the Depth of Automata (TM, MT), pp. 364–376.
DLT-2015-OttoK #order: Deterministic Ordered Restarting Automata that Compute Functions (FO, KK), pp. 401–412.
ICALP-v2-2015-BenesBLS #parametricity: Language Emptiness of Continuous-Time Parametric Timed Automata (NB, PB, KGL, JS), pp. 69–81.
ICALP-v2-2015-ChatterjeeHIO #distance #edit distance: Edit Distance for Pushdown Automata (KC, TAH, RIJ, JO), pp. 121–133.
ICALP-v2-2015-Finkel #infinity #scalability #theorem #word: Incompleteness Theorems, Large Cardinals, and Automata over Infinite Words (OF), pp. 222–233.
ICALP-v2-2015-KuperbergS #nondeterminism #on the: On Determinisation of Good-for-Games Automata (DK, MS), pp. 299–310.
ICALP-v2-2015-LerouxST #on the #problem: On the Coverability Problem for Pushdown Vector Addition Systems in One Dimension (JL, GS, PT), pp. 324–336.
LATA-2015-BabariD #logic #theorem: A Nivat Theorem for Weighted Picture Automata and Weighted MSO Logic (PB, MD), pp. 703–715.
LATA-2015-BachmeierLS #complexity #finite: Finite Automata for the Sub- and Superword Closure of CFLs: Descriptional and Computational Complexity (GB, ML, MS), pp. 473–485.
LATA-2015-BjorklundDZ #algorithm #performance: An Efficient Best-Trees Algorithm for Weighted Tree Automata over the Tropical Semiring (JB, FD, NZ), pp. 97–108.
LATA-2015-Cotton-BarrattMO #memory management: Weak and Nested Class Memory Automata (CCB, ASM, CHLO), pp. 188–199.
LATA-2015-GodinKP #on the: On Torsion-Free Semigroups Generated by Invertible Reversible Mealy Automata (TG, IK, MP), pp. 328–339.
LATA-2015-KrishnaMT #bound #decidability #problem #reachability #recursion: Time-Bounded Reachability Problem for Recursive Timed Automata is Undecidable (SNK, LM, AT), pp. 237–248.
LATA-2015-LiH #algebra #network #on the: On Observability of Automata Networks via Computational Algebra (RL, YH), pp. 249–262.
LATA-2015-Salem #ltl #model checking #testing: Single-Pass Testing Automata for LTL Model Checking (AEBS), pp. 563–576.
LATA-2015-ThiemannS #regular expression: From ω-Regular Expressions to Büchi Automata via Partial Derivatives (PT, MS), pp. 287–298.
LATA-2015-UlyantsevZS #identification #symmetry: BFS-Based Symmetry Breaking Predicates for DFA Identification (VU, IZ, AS), pp. 611–622.
FM-2015-KroeningLW #bound #model checking #proving #safety: Proving Safety with Trace Automata and Bounded Model Checking (DK, ML, GW), pp. 325–341.
RTA-2015-EndrullisZ #finite #proving: Proving non-termination by finite automata (JE, HZ), pp. 160–176.
TLCA-2015-Riba: Fibrations of Tree Automata (CR), pp. 302–316.
CIG-2015-Ashlock15a #evolution #generative: Evolvable fashion-based cellular automata for generating cavern systems (DA), pp. 306–313.
ICEIS-v2-2015-CeredaN #adaptation #recommendation: A Recommendation Engine based on Adaptive Automata (PRMC, JJN), pp. 594–601.
SEKE-2015-AssuncaoFLSV #generative #markov #modelling #named #network #predict #probability: SANGE — Stochastic Automata Networks Generator. A tool to efficiently predict events through structured Markovian models (JA, PF, LL, AS, JMV), pp. 581–584.
LOPSTR-2015-MantelMPW #analysis #composition #data flow #network #using: Using Dynamic Pushdown Networks to Automate a Modular Information-Flow Analysis (HM, MMO, MP, AW), pp. 201–217.
POPL-2015-HeGWZ #composition #concurrent #probability #reasoning: Leveraging Weighted Automata in Compositional Reasoning about Concurrent Probabilistic Systems (FH, XG, BYW, LZ), pp. 503–514.
POPL-2015-PredaGLM #analysis #bytecode #semantics #similarity: Abstract Symbolic Automata: Mixed syntactic/semantic similarity analysis of executables (MDP, RG, AL, IM), pp. 329–341.
QAPL-2015-AldiniB #markov #similarity: Expected-Delay-Summing Weak Bisimilarity for Markov Automata (AA, MB), pp. 1–15.
ASPLOS-2015-ChisnallRWWVMRD #architecture #c: Beyond the PDP-11: Architectural Support for a Memory-Safe C Abstract Machine (DC, CR, RNMW, JW, MV, SWM, MR, BD, PGN), pp. 117–130.
ASPLOS-2015-ZhaoS #on the fly #parallel: On-the-Fly Principled Speculation for FSM Parallelization (ZZ, XS), pp. 619–630.
CASE-2015-Schwung #cyber-physical #hybrid #modelling #using: Cyber-physical modeling of compression systems using hybrid automata (AS), pp. 1125–1130.
CASE-2015-ZhangWZZ #learning #optimisation #performance: Incorporation of ordinal optimization into learning automata for high learning efficiency (JZ, CW, DZ, MZ), pp. 1206–1211.
FASE-2015-AndriescuMI #data type #using: Composing Message Translators and Inferring Their Data Types Using Tree Automata (EA, TM, VI), pp. 35–50.
FoSSaCS-2015-ChadhaSVB #decidability #probability: Decidable and Expressive Classes of Probabilistic Automata (RC, APS, MV, YB), pp. 200–214.
FoSSaCS-2015-Cotton-BarrattH #decidability #memory management #ml: Fragments of ML Decidable by Nested Data Class Memory Automata (CCB, DH, ASM, CHLO), pp. 249–263.
FoSSaCS-2015-KieferMW #multi: Minimisation of Multiplicity Tree Automata (SK, IM, JW), pp. 297–311.
TACAS-2015-HolikHLRSV #analysis #contest #named #using: Forester: Shape Analysis Using Tree Automata — (Competition Contribution) (LH, MH, OL, AR, JS, TV), pp. 432–435.
TACAS-2015-KiniV #ltl #probability: Limit Deterministic and Probabilistic Automata for LTL ∖ GU (DK, MV), pp. 628–642.
TACAS-2015-RenaultDKP #model checking #parallel: Parallel Explicit Model Checking for Generalized Büchi Automata (ER, ADL, FK, DP), pp. 613–627.
TACAS-2015-Sankur #analysis #robust: Symbolic Quantitative Robustness Analysis of Timed Automata (OS), pp. 484–498.
CADE-2015-GransdenWR #named #proving #using: SEPIA: Search for Proofs Using Inferred Automata (TG, NW, RR), pp. 246–255.
CADE-2015-Paulson #finite #formal method #set #using: A Formalisation of Finite Automata Using Hereditarily Finite Sets (LCP), pp. 231–245.
CAV-2015-IsbernerHS #framework #learning #open source: The Open-Source LearnLib — A Framework for Active Automata Learning (MI, FH, BS), pp. 487–495.
CSL-2015-ClementeL #analysis #first-order #reachability: Reachability Analysis of First-order Definable Pushdown Systems (LC, SL), pp. 244–259.
CSL-2015-MazowieckiR #logic #towards: Maximal Partition Logic: Towards a Logical Characterization of Copyless Cost Register Automata (FM, CR), pp. 144–159.
CSL-2015-SchubertDB #proving: Automata Theoretic Account of Proof Search (AS, WD, HPB), pp. 128–143.
ICLP-2015-VolkerI #logic programming: Logic Programming for Cellular Automata (MV, KI), pp. 128–139.
LICS-2015-BallePP #approximate #canonical: A Canonical Form for Weighted Automata and Applications to Approximate Minimization (BB, PP, DP), pp. 701–712.
LICS-2015-BrunetP #petri net: Petri Automata for Kleene Allegories (PB, DP), pp. 68–79.
LICS-2015-ChatterjeeHO: Nested Weighted Automata (KC, TAH, JO), pp. 725–737.
LICS-2015-ClementeL #revisited: Timed Pushdown Automata Revisited (LC, SL), pp. 738–749.
LICS-2015-MurawskiRT #similarity: Bisimilarity in Fresh-Register Automata (ASM, SJR, NT), pp. 156–167.
LICS-2015-Reiter #distributed #graph: Distributed Graph Automata (FR), pp. 192–201.
VMCAI-2015-BraitlingFHWBH #markov #metric: Abstraction-Based Computation of Reward Measures for Markov Automata (BB, LMFF, HH, RW, BB, HH), pp. 172–189.
TFPIE-2014-MorazanA #formal method #functional #student: Functional Automata — Formal Languages for Computer Science Students (MTM, RA), pp. 19–32.
SCAM-2014-LiangSMKH #analysis #exception: Pruning, Pushdown Exception-Flow Analysis (SL, WS, MM, AWK, DVH), pp. 265–274.
DLT-J-2013-BertoniCD14 #context-free grammar #decidability #on the #problem #quantum: On the Decidability of the Intersection Problem for Quantum Automata and Context-Free Languages (AB, CC, FD), pp. 1065–1082.
DLT-J-2013-CarninoL14: Factorizations and Universal Automaton of ω-Languages (VC, SL), pp. 1111–1126.
DLT-J-2013-KucukSY14 #finite: Finite Automata with Advice Tapes (UK, ACCS, AY), pp. 987–1000.
DLT-J-2013-KutribMW14a #finite #multi: Stateless One-Way Multi-Head Finite Automata with Pebbles (MK, AM, MW), pp. 1141–1160.
AFL-2014-BordihnKM #communication #finite #parallel: Measuring Communication in Parallel Communicating Finite Automata (HB, MK, AM), pp. 124–138.
AFL-2014-Campeanu #finite #nondeterminism: Simplifying Nondeterministic Finite Cover Automata (CC), pp. 162–173.
AFL-2014-CarayolH #algorithm #model checking: Saturation algorithms for model-checking pushdown systems (AC, MH), pp. 1–24.
AFL-2014-CarninoL #ambiguity #on the: On Determinism and Unambiguity of Weighted Two-way Automata (VC, SL), pp. 188–200.
AFL-2014-CevorovaJMPS: Operations on Automata with All States Final (KC, GJ, PM, MP, JS), pp. 201–215.
AFL-2014-GruberH #complexity #finite #regular expression #summary: From Finite Automata to Regular Expressions and Back — A Summary on Descriptional Complexity (HG, MH), pp. 25–48.
AFL-2014-HolzerJ #product line #regular expression: More Structural Characterizations of Some Subregular Language Families by Biautomata (MH, SJ), pp. 271–285.
AFL-2014-HutagalungLL #game studies #simulation: Buffered Simulation Games for Büchi Automata (MH, ML, ÉL), pp. 286–300.
AFL-2014-Ivan: Synchronizing weighted automata (SI), pp. 301–313.
AFL-2014-Klima #algebra #on the: On Varieties of Automata Enriched with an Algebraic Structure (OK), pp. 49–54.
AFL-2014-Loding #infinity #problem #word: Decision Problems for Deterministic Pushdown Automata on Infinite Words (CL), pp. 55–73.
AFL-2014-MalettiQ: Hyper-Minimization for Deterministic Weighted Tree Automata (AM, DQ), pp. 314–326.
AFL-2014-MignotSZ14a #equation: $k$-Position, Follow, Equation and $k$-C-Continuation Tree Automata Constructions (LM, NOS, DZ), pp. 327–341.
AFL-2014-Vorel #set #transitive: Subset Synchronization of Transitive Automata (VV), pp. 370–381.
CIAA-2014-BianchiMP #on the #power of #quantum: On the Power of One-Way Automata with Quantum and Classical States (MPB, CM, BP), pp. 84–97.
CIAA-2014-BiasiY: Unary Languages Recognized by Two-Way One-Counter Automata (MDB, AY), pp. 148–161.
CIAA-2014-BieglerM #finite #on the #word: On Comparing Deterministic Finite Automata and the Shuffle of Words (FB, IM), pp. 98–109.
CIAA-2014-Blanchet-SadriGS: Minimal Partial Languages and Automata (FBS, KG, AS), pp. 110–123.
CIAA-2014-DemailleDLSS #type system: A Type System for Weighted Automata and Rational Expressions (AD, ADL, SL, LS, JS), pp. 162–175.
CIAA-2014-Fujiyoshi #multi #recognition: Recognition of Labeled Multidigraphs by Spanning Tree Automata (AF), pp. 188–199.
CIAA-2014-GusevP: Reset Thresholds of Automata with Two Cycle Lengths (VVG, EVP), pp. 200–210.
CIAA-2014-MaiaMR #similarity: Partial Derivative and Position Bisimilarity Automata (EM, NM, RR), pp. 264–277.
CIAA-2014-Osterholzer #context-free grammar: Pushdown Machines for Weighted Context-Free Tree Translation (JO), pp. 290–303.
CIAA-2014-Otto #overview: Restarting Automata for Picture Languages: A Survey on Recent Developments (FO), pp. 16–41.
CIAA-2014-Pighizzini: Investigations on Automata and Languages over a Unary Alphabet (GP), pp. 42–57.
CIAA-2014-PittouR #infinity: Weighted Variable Automata over Infinite Alphabets (MP, GR), pp. 304–317.
CIAA-2014-RashidY #quantum: Implications of Quantum Automata for Contextuality (JR, AY), pp. 318–331.
CIAA-2014-Roche-LimaDF #kernel: Pairwise Rational Kernels Obtained by Automaton Operations (ARL, MD, BF), pp. 332–345.
CIAA-2014-Sirakoulis: Cellular Automata for Crowd Dynamics (GCS), pp. 58–69.
DLT-2014-AlmeidaR: Semisimple Synchronizing Automata and the Wedderburn-Artin Theory (JA, ER), pp. 49–60.
DLT-2014-Berlinkov #algorithm #on the #problem: On Two Algorithmic Problems about Synchronizing Automata — (MVB), pp. 61–67.
DLT-2014-FeliceN #algorithm #complexity #on the: On the Average Complexity of Brzozowski’s Algorithm for Deterministic Automata with a Small Number of Final States (SDF, CN), pp. 25–36.
DLT-2014-Gusev #random: Synchronizing Automata with Random Inputs — (VVG), pp. 68–75.
DLT-2014-HolzerJ: Minimal and Hyper-Minimal Biautomata — (MH, SJ), pp. 291–302.
DLT-2014-KutribM #communication: Measuring Communication in Automata Systems — (MK, AM), pp. 260–274.
DLT-2014-KutribMW #set: Deterministic Set Automata (MK, AM, MW), pp. 303–314.
DLT-2014-OkhotinS #nondeterminism: Input-Driven Pushdown Automata with Limited Nondeterminism — (AO, KS), pp. 84–102.
DLT-2014-ReynierT #transducer: Visibly Pushdown Transducers with Well-Nested Outputs (PAR, JMT), pp. 129–141.
DLT-2014-Sinya #finite #graph: Graph Spectral Properties of Deterministic Finite Automata — (RS), pp. 76–83.
DLT-2014-TorreNP #bound: Scope-Bounded Pushdown Languages (SLT, MN, GP), pp. 116–128.
ICALP-v2-2014-BorelloCV #set: Turing Degrees of Limit Sets of Cellular Automata (AB, JC, PV), pp. 74–85.
ICALP-v2-2014-ChistikovM #source code: Unary Pushdown Automata and Straight-Line Programs (DVC, RM), pp. 146–157.
ICALP-v2-2014-DrosteP #distance #logic #theorem: A Nivat Theorem for Weighted Timed Automata and Weighted Relative Distance Logic (MD, VP), pp. 171–182.
ICALP-v2-2014-KieferW #complexity #probability: Stability and Complexity of Minimising Probabilistic Automata (SK, BW), pp. 268–279.
LATA-2014-AbdullaAS #reachability: Computing Optimal Reachability Costs in Priced Dense-Timed Pushdown Automata (PAA, MFA, JS), pp. 62–75.
LATA-2014-BednarovaG: Two Double-Exponential Gaps for Automata with a Limited Pushdown (ZB, VG), pp. 113–125.
LATA-2014-DrosteD #infinity #logic #word: Weighted Automata and Logics for Infinite Nested Words (MD, SD), pp. 323–334.
LATA-2014-FelgenhauerT #analysis #reachability: Reachability Analysis with State-Compatible Automata (BF, RT), pp. 347–359.
LATA-2014-KleinMBK #model checking #probability #question: Are Good-for-Games Automata Good for Probabilistic Model Checking? (JK, DM, CB, SK), pp. 453–465.
LATA-2014-KonitzerS #bound #process: DFA with a Bounded Activity Level (MK, HUS), pp. 478–489.
LATA-2014-OttoM #order: Extended Two-Way Ordered Restarting Automata for Picture Languages (FO, FM), pp. 541–552.
LATA-2014-Vorel #complexity #problem #word: Complexity of a Problem Concerning Reset Words for Eulerian Binary Automata (VV), pp. 576–587.
LATA-2014-ZhengGQ #complexity #finite #on the: On the State Complexity of Semi-quantum Finite Automata (SZ, JG, DQ), pp. 601–612.
FM-2014-FengZ #bisimulation #equivalence #probability: When Equivalence and Bisimulation Join Forces in Probabilistic Automata (YF, LZ), pp. 247–262.
FM-2014-KordyLMP #algorithm #analysis #robust: A Symbolic Algorithm for the Analysis of Robust Timed Automata (PK, RL, SM, JWP), pp. 351–366.
RTA-TLCA-2014-CreusG14a #constraints: Tree Automata with Height Constraints between Brothers (CC, GG), pp. 149–163.
FLOPS-2014-CaiO: Well-Structured Pushdown System: Case of Dense Timed Pushdown Automata (XC, MO), pp. 336–352.
ICFP-2014-AccattoliBM: Distilling abstract machines (BA, PB, DM), pp. 363–376.
CIG-2014-AshlockA: Shaped prisoner's dilemma automata (WA, DA), pp. 1–8.
OOPSLA-2014-ZhaoWZDSSW #predict #probability #sequence: Call sequence prediction through probabilistic calling automata (ZZ, BW, MZ, YD, JS, XS, YW), pp. 745–762.
PEPM-J-2013-Garcia-PerezN14 #functional #hybrid #on the: On the syntactic and functional correspondence between hybrid (or layered) normalisers and abstract machines (ÁGP, PN), pp. 176–199.
POPL-2014-DAntoniV: Minimization of symbolic automata (LD, MV), pp. 541–554.
QAPL-2014-BraitlingFHWBH #abstraction #game studies #markov #named #refinement: MeGARA: Menu-based Game Abstraction and Abstraction Refinement of Markov Automata (BB, LMFF, HH, RW, BB, HH), pp. 48–63.
SAC-2014-ShinJLY #design: Design of a cellular automata cell with rule 30 on quantum-dot cellular automata (SHS, JCJ, GJL, KYY), pp. 1749–1750.
PDP-2014-Topa #gpu #memory management #performance: Cellular Automata Model Tuned for Efficient Computation on GPU with Global Memory Cache (PT), pp. 380–383.
FoSSaCS-2014-Jancar: Equivalences of Pushdown Systems Are Hard (PJ), pp. 1–28.
FoSSaCS-2014-Lang #game studies #graph #reachability: Resource Reachability Games on Pushdown Graphs (ML0), pp. 195–209.
TACAS-2014-SalemDKT #invariant #model checking #testing #using: Symbolic Model Checking of Stutter-Invariant Properties Using Generalized Testing Automata (AEBS, ADL, FK, YTM), pp. 440–454.
TACAS-2014-Wang0LWL #specification: Are Timed Automata Bad for a Specification Language? Language Inclusion Checking for Timed Automata (TW, JS, YL, XW, SL), pp. 310–325.
WRLA-2014-Genet #functional #source code #static analysis #towards #using: Towards Static Analysis of Functional Programs Using Tree Automata Completion (TG), pp. 147–161.
CAV-2014-DAntoniA: Symbolic Visibly Pushdown Automata (LD, RA), pp. 209–225.
CAV-2014-EsparzaK #approach #composition #ltl: From LTL to Deterministic Automata: A Safraless Compositional Approach (JE, JK), pp. 192–208.
CAV-2014-HansenLLN0 #abstraction #partial order #reduction #women: Diamonds Are a Girl’s Best Friend: Partial Order Reduction for Timed Automata with Abstractions (HH, SWL, YL, TKN, JS), pp. 391–406.
CAV-2014-HuangFMMK #hybrid #invariant #network #verification: Invariant Verification of Nonlinear Hybrid Automata Networks of Cardiac Cells (ZH, CF, AM, SM, MZK), pp. 373–390.
ICTSS-2014-El-FakihSY #assessment #on the #test coverage #testing: On Code Coverage of Extended FSM Based Test Suites: An Initial Assessment (KEF, TS, NY), pp. 198–204.
LICS-CSL-2014-0001C #abstract interpretation: Abstract interpretation from Büchi automata (MH, WC), p. 10.
LICS-CSL-2014-BlumensathCKPB #infinity #logic: Two-way cost automata and cost logics over infinite trees (AB, TC, DK, PP, MVB), p. 9.
LICS-CSL-2014-Bollig #communication #logic: Logic for communicating automata with parameterized topology (BB), p. 10.
LICS-CSL-2014-BolligGMZ #logic: Logical characterization of weighted pebble walking automata (BB, PG, BM, MZ), p. 10.
LICS-CSL-2014-BrazdilKKNK #multi #probability: Zero-reachability in probabilistic multi-counter automata (TB, SK, AK, PN, JPK), p. 10.
LICS-CSL-2014-CarreiroFVZ #similarity: Weak MSO: automata and expressiveness modulo bisimilarity (FC, AF, YV, FZ), p. 27.
LICS-CSL-2014-LerouxPS #bound: Hyper-Ackermannian bounds for pushdown vector addition systems (JL, MP, GS), p. 10.
VMCAI-2014-KiniV #ltl #probability #safety #specification: Probabilistic Automata for Safety LTL Specifications (DK, MV), pp. 118–136.
VLDB-2013-OgdenTP #parallel #query #scalability #transducer #using #xml: Scalable XML Query Processing using Parallel Pushdown Transducers (PO, DBT, PP), pp. 1738–1749.
CIAA-J-2012-Berlinkov13 #clustering: Synchronizing quasi-Eulerian and quasi-One-Cluster Automata (MVB), pp. 729–746.
CIAA-J-2012-IbarraT13 #how #multi: How to synchronize the Heads of a Multitape Automaton (OHI, NQT), pp. 799–814.
CIAA-J-2012-JezM13: Hyper-Minimization for Deterministic Tree Automata (AJ, AM), pp. 815–830.
CIAA-J-2012-KutribO13 #complexity #on the: On the Descriptional Complexity of the Window Size for Deleting Restarting Automata (MK, FO), pp. 831–846.
CIAA-J-2012-Mohri13 #ambiguity #finite #functional #on the #transducer: On the Disambiguation of Finite Automata and Functional Transducers (MM), pp. 847–862.
CIAA-J-2012-Oliveira13 #algebra #category theory #matrix: Weighted Automata as Coalgebras in Categories of Matrices (JNO), pp. 709–728.
CIAA-J-2012-PrusaM13: Restarting Tiling Automata (DP, FM), pp. 863–878.
DLT-J-2012-CadilhacFM13 #ambiguity: Unambiguous constrained Automata (MC, AF, PM), pp. 1099–1116.
DLT-J-2012-Csuhaj-Varju13: P and DP Automata: Unconventional versus Classical Automata (ECV), pp. 995–1008.
DLT-J-2012-HolzerJ13 #equivalence #fault: From Equivalence to Almost-Equivalence, and beyond: Minimizing Automata with Errors (MH, SJ), pp. 1083–1098.
DLT-J-2012-HromkovicKKS13 #logic #nondeterminism #representation: Determinism vs. Nondeterminism for Two-Way Automata: Representing the Meaning of States by Logical Formulæ (JH, RK, RK, RS), pp. 955–978.
CIAA-2013-CaralpRT: Trimming Visibly Pushdown Automata (MC, PAR, JMT), pp. 84–96.
CIAA-2013-DebarbieuxGNSZ #query #word #xml #xpath: Early Nested Word Automata for XPath Query Answering on XML Streams (DD, OG, JN, TS, MZ), pp. 292–305.
CIAA-2013-GenetGLM #algorithm: A Completion Algorithm for Lattice Tree Automata (TG, TLG, AL, VM), pp. 134–145.
CIAA-2013-HanKS #approximate #context-free grammar #finite: Approximate Matching between a Context-Free Grammar and a Finite-State Automaton (YSH, SKK, KS), pp. 146–157.
CIAA-2013-HasanIRS #on the #sequence: On Palindromic Sequence Automata and Applications (MMH, ASMSI, MSR, AS), pp. 158–168.
CIAA-2013-INIBT #taxonomy: Compressed Automata for Dictionary Matching (TI, TN, SI, HB, MT), pp. 319–330.
CIAA-2013-Jurgensen: Automata for Codes (HJ), pp. 2–15.
CIAA-2013-KisielewiczS #generative: Generating Small Automata and the Černý Conjecture (AK, MS), pp. 340–348.
CIAA-2013-KutribMMPW #decidability #finite #queue: Input-Driven Queue Automata: Finite Turns, Decidability, and Closure Properties (MK, AM, CM, BP, MW), pp. 232–243.
CIAA-2013-Maletti: Hyper-optimization for Deterministic Tree Automata (AM), pp. 244–255.
CIAA-2013-MrazO #decidability: λ-Confluence Is Undecidable for Clearing Restarting Automata (FM, FO), pp. 256–267.
CIAA-2013-PrusaMO #2d: Comparing Two-Dimensional One-Marker Automata to Sgraffito Automata (DP, FM, FO), pp. 268–279.
CIAA-2013-Veanes #finite: Applications of Symbolic Finite Automata (MV), pp. 16–23.
DLT-2013-BertoniCD #context-free grammar #decidability #finite #linear #problem #quantum: Quantum Finite Automata and Linear Context-Free Languages: A Decidable Problem (AB, CC, FD), pp. 82–93.
DLT-2013-BolligHLM #approach #learning: A Fresh Approach to Learning Register Automata (BB, PH, ML, BM), pp. 118–130.
DLT-2013-CarninoL: Factorizations and Universal Automaton of ω Languages (VC, SL), pp. 338–349.
DLT-2013-FeliceN #algorithm: Brzozowski Algorithm Is Generically Super-Polynomial for Deterministic Automata (SDF, CN), pp. 179–190.
DLT-2013-Freivalds #finite #turing machine: Ultrametric Finite Automata and Turing Machines (RF), pp. 1–11.
DLT-2013-KlimaP: Alternative Automata Characterization of Piecewise Testable Languages (OK, LP), pp. 289–300.
DLT-2013-KucukSY #finite: Finite Automata with Advice Tapes (UK, ACCS, AY), pp. 301–312.
DLT-2013-KutribMW #finite #multi: One-Way Multi-Head Finite Automata with Pebbles But No States (MK, AM, MW), pp. 313–324.
DLT-2013-Loding #ambiguity #finite: Unambiguous Finite Automata (CL), pp. 29–30.
DLT-2013-PrusaMO: New Results on Deterministic Sgraffito Automata (DP, FM, FO), pp. 409–419.
DLT-2013-Regnault #probability #proving: Proof of a Phase Transition in Probabilistic Cellular Automata (DR), pp. 433–444.
ICALP-v2-2013-Basset #probability #process: A Maximal Entropy Stochastic Process for a Timed Automaton, (NB), pp. 61–73.
ICALP-v2-2013-ChretienCD #protocol #security: From Security Protocols to Pushdown Automata (RC, VC, SD), pp. 137–149.
ICALP-v2-2013-DenielouY #communication #multi #synthesis: Multiparty Compatibility in Communicating Automata: Characterisation and Synthesis of Global Session Types (PMD, NY), pp. 174–186.
ICALP-v2-2013-FearnleyJ #reachability: Reachability in Two-Clock Timed Automata Is PSPACE-Complete (JF, MJ), pp. 212–223.
ICALP-v2-2013-FriedmannKL: Ramsey Goes Visibly Pushdown (OF, FK, ML), pp. 224–237.
ICALP-v2-2013-Janin #algebra #logic: Algebras, Automata and Logic for Languages of Labeled Birooted Trees (DJ), pp. 312–323.
ICALP-v2-2013-Worrell #equivalence #finite #multi #problem: Revisiting the Equivalence Problem for Finite Multitape Automata (JW), pp. 422–433.
ICALP-v2-2013-Zetzsche: Silent Transitions in Automata with Storage (GZ), pp. 434–445.
LATA-2013-BabaaliK #on the #product line: On the Construction of a Family of Automata That Are Generically Non-minimal (PB, CK), pp. 80–91.
LATA-2013-BalaJ #nondeterminism: Limited Non-determinism Hierarchy of Counter Automata (SB, DJ), pp. 92–103.
LATA-2013-BalaK #ambiguity: Unambiguous Automata Denoting Finitely Sequential Functions (SB, AK), pp. 104–115.
LATA-2013-BjorklundFK #learning: MAT Learning of Universal Automata (JB, HF, AK), pp. 141–152.
LATA-2013-BolligCHKS #branch #communication: Dynamic Communicating Automata and Branching High-Level MSCs (BB, AC, LH, AK, TS), pp. 177–189.
LATA-2013-BruyereDG #anti: Visibly Pushdown Automata: Universality and Inclusion via Antichains (VB, MD, OG), pp. 190–201.
LATA-2013-CuiDFI #execution: Execution Information Rate for Some Classes of Automata (CC, ZD, TRF, OHI), pp. 226–237.
LATA-2013-FernauHV #analysis #multi #problem: A Multivariate Analysis of Some DFA Problems (HF, PH, YV), pp. 275–286.
LATA-2013-FreivaldsZP #complexity #on the: On the Size Complexity of Deterministic Frequency Automata (RF, TZ, GRP), pp. 287–298.
LATA-2013-HutagalungLL #game studies #simulation: Revealing vs. Concealing: More Simulation Games for Büchi Inclusion (MH, ML, ÉL), pp. 347–358.
LATA-2013-IbarraR #bound #on the: On Bounded Languages and Reversal-Bounded Automata (OHI, BR), pp. 359–370.
LATA-2013-JacquemardR #term rewriting: Rewrite Closure and CF Hedge Automata (FJ, MR), pp. 371–382.
LATA-2013-LaugerotteSZ: From Regular Tree Expression to Position Tree Automaton (ÉL, NOS, DZ), pp. 395–406.
LATA-2013-NakamuraI #linear #stack: Eliminating Stack Symbols in Push-Down Automata and Linear Indexed Grammars (KN, KI), pp. 444–455.
LATA-2013-Ong #higher-order #model checking #recursion: Recursion Schemes, Collapsible Pushdown Automata and Higher-Order Model Checking (LO), pp. 13–41.
LATA-2013-Otto: Asynchronous PC Systems of Pushdown Automata (FO), pp. 456–467.
LATA-2013-Quaas #logic #metric #model checking: Model Checking Metric Temporal Logic over Automata with One Counter (KQ), pp. 468–479.
LATA-2013-Schwentick #challenge #xml: XML Schema Management: A Challenge for Automata Theory (TS), p. 43.
IFM-2013-IshiiMN #calculus #hybrid #induction #verification: Inductive Verification of Hybrid Automata with Strongest Postcondition Calculus (DI, GM, SN), pp. 139–153.
IFM-2013-Larsen #model checking #statistics: Priced Timed Automata and Statistical Model Checking (KGL), pp. 154–161.
RTA-2013-Kari #generative: Pattern Generation by Cellular Automata (JK), pp. 1–3.
ICFP-2013-JohnsonLMH #optimisation: Optimizing abstract abstract machines (JIJ, NL, MM, DVH), pp. 443–454.
CIG-2013-AshlockM #generative: Landscape automata for search based procedural content generation (DA, CM), pp. 1–8.
GT-VMT-2013-ColomboP #programming: Monitor-Oriented Compensation Programming Through Compensating Automata (CC, GJP).
LOPSTR-2013-DanvyJ #reduction #semantics: From Outermost Reduction Semantics to Abstract Machine (OD, JJ), pp. 91–108.
POPL-2013-BonchiP #bisimulation #congruence #equivalence #nondeterminism: Checking NFA equivalence with bisimulations up to congruence (FB, DP), pp. 457–468.
POPL-2013-MayrC: Advanced automata minimization (RM, LC), pp. 63–74.
PPDP-2013-SimmonsZ #logic #semantics: A logical correspondence between natural semantics and abstract machines (RJS, IZ), pp. 109–119.
QAPL-2013-BertrandS #game studies #infinity #probability: Solving Stochastic Büchi Games on Infinite Decisive Arenas (NB, PS), pp. 116–131.
SAS-2013-0001MP #abstract domain #quantifier: Quantified Data Automata on Skinny Trees: An Abstract Domain for Lists (PG, PM, GP), pp. 172–193.
SAS-2013-LammichMSW #network: Contextual Locking for Dynamic Pushdown Networks (PL, MMO, HS, AW), pp. 477–498.
SAS-2013-PelegSYY #mining #specification: Symbolic Automata for Static Specification Mining (HP, SS, EY, HY), pp. 63–83.
ESEC-FSE-2013-SongT #detection #model checking #named: PoMMaDe: pushdown model-checking for malware detection (FS, TT), pp. 607–610.
ICSE-2013-LetierH #modelling #requirements #synthesis: Requirements modelling by synthesis of deontic input-output automata (EL, WH), pp. 592–601.
CASE-2013-MohajeraniMF #composition #finite #using #verification: Compositional nonblocking verification for extended finite-state automata using partial unfolding (SM, RM, MF), pp. 930–935.
PPoPP-2013-YuB #performance #regular expression: Exploring different automata representations for efficient regular expression matching on GPUs (XY, MB), pp. 287–288.
FoSSaCS-2013-TzevelekosG: History-Register Automata (NT, RG), pp. 17–33.
STOC-2013-BohmGJ #equivalence: Equivalence of deterministic one-counter automata is NL-complete (SB, SG, PJ), pp. 131–140.
TACAS-2013-EisentrautHST0 #probability: The Quest for Minimal Quotients for Probabilistic Automata (CE, HH, JS, AT, LZ), pp. 16–31.
TACAS-2013-GrigoreDPT #runtime #verification: Runtime Verification Based on Register Automata (RG, DD, RLP, NT), pp. 260–276.
TACAS-2013-JovanovicLR #integer #parametricity #synthesis: Integer Parameter Synthesis for Timed Automata (AJ, DL, OHR), pp. 401–415.
TACAS-2013-Minamide: Weighted Pushdown Systems with Indexed Weight Domains (YM), pp. 230–244.
TACAS-2013-RenaultDKP #composition #model checking #performance: Strength-Based Decomposition of the Property Büchi Automaton for Faster Model Checking (ER, ADL, FK, DP), pp. 580–593.
CAV-2013-ChatterjeeGK #ltl #model checking #probability #synthesis: Automata with Generalized Rabin Pairs for Probabilistic Model Checking and LTL Synthesis (KC, AG, JK), pp. 559–575.
CAV-2013-HeizmannHP #model checking #people: Software Model Checking for People Who Love Automata (MH, JH, AP), pp. 36–52.
CAV-2013-HerbreteauSW #abstraction #lazy evaluation: Lazy Abstractions for Timed Automata (FH, BS, IW), pp. 990–1005.
CAV-2013-HolikLRSV #analysis #automation: Fully Automated Shape Analysis Based on Forest Automata (LH, OL, AR, JS, TV), pp. 740–755.
CAV-2013-LaarmanODLP #abstraction #manycore #using: Multi-core Emptiness Checking of Timed Büchi Automata Using Inclusion Abstraction (AL, MCO, AED, KGL, JvdP), pp. 968–983.
CAV-2013-PauleveAK #approximate #network #reachability #scalability #set: Under-Approximating Cut Sets for Reachability in Large Scale Automata Networks (LP, GA, HK), pp. 69–84.
CAV-2013-Sankur #analysis #named #robust: Shrinktech: A Tool for the Robustness Analysis of Timed Automata (OS), pp. 1006–1012.
CAV-2013-StewartEY #bound #model checking #polynomial #probability: Upper Bounds for Newton’s Method on Monotone Polynomial Systems, and P-Time Model Checking of Probabilistic One-Counter Automata (AS, KE, MY), pp. 495–510.
CAV-2013-TsaiTH #game studies #logic: GOAL for Games, ω-Automata, and Logics (MHT, YKT, YSH), pp. 883–889.
CSL-2013-ColcombetKLB: Deciding the weak definability of Büchi definable tree languages (TC, DK, CL, MVB), pp. 215–230.
CSL-2013-Kuusisto #distributed #logic #message passing: Modal Logic and Distributed Message Passing Automata (AK), pp. 452–468.
LICS-2013-AlurDDRY: Regular Functions and Cost Register Automata (RA, LD, JVD, MR, YY), pp. 13–22.
LICS-2013-BenediktGKM #similarity: Bisimilarity of Pushdown Automata is Nonelementary (MB, SG, SK, ASM), pp. 488–498.
LICS-2013-FacchiniMS #problem: Rabin-Mostowski Index Problem: A Step beyond Deterministic Automata (AF, FM, MS), pp. 499–508.
LICS-2013-FredrikssonG #game studies #revisited #semantics: Abstract Machines for Game Semantics, Revisited (OF, DRG), pp. 560–569.
LICS-2013-Lynch #probability: Timed and Probabilistic I/O Automata (NAL), p. 12.
TAP-2013-AichernigLN #modelling #mutation testing #testing: Time for Mutants — Model-Based Mutation Testing with Timed Automata (BKA, FL, DN), pp. 20–38.
VMCAI-2013-Podelski #proving: Automata as Proofs (AP), pp. 13–14.
SIGMOD-2012-TeubnerWN #configuration management: Skeleton automata for FPGAs: reconfiguring without reconstructing (JT, LW, CN), pp. 229–240.
ITiCSE-2012-DrorR #finite: The effect of mathematical vs. verbal formulation for finite automata (TD, DLR), p. 382.
DLT-J-2011-BrodaMMR12 #on the: On the Average Size of Glushkov and Partial derivative Automata (SB, AM, NM, RR), pp. 969–984.
DLT-J-2011-SayY12 #quantum: Quantum Counter Automata (ACCS, AY), pp. 1099–1116.
DLT-J-2011-ZhengQL12 #finite #quantum: Some Languages Recognized by Two-Way Finite Automata with Quantum and Classical States (SZ, DQ, LL), pp. 1117–1130.
CIAA-2012-AllauzenR #library #transducer: A Pushdown Transducer Extension for the OpenFst Library (CA, MR), pp. 66–77.
CIAA-2012-Berlinkov: Synchronizing Automata on Quasi-Eulerian Digraph (MVB), pp. 90–100.
CIAA-2012-Ceccherini-SilbersteinCFS: Cellular Automata on Regular Rooted Trees (TCS, MC, FF, ZS), pp. 101–112.
CIAA-2012-DeganoFM #resource management: Nominal Automata for Resource Usage Control (PD, GLF, GM), pp. 125–137.
CIAA-2012-DrosteP #logic #word: Weighted Nested Word Automata and Logics over Strong Bimonoids (MD, BP), pp. 138–148.
CIAA-2012-FaroL #algorithm #online #performance #string: A Fast Suffix Automata Based Algorithm for Exact Online String Matching (SF, TL), pp. 149–158.
CIAA-2012-GastinM: Adding Pebbles to Weighted Automata (PG, BM), pp. 28–51.
CIAA-2012-Gusev #bound #rank: Synchronizing Automata of Bounded Rank (VVG), pp. 171–179.
CIAA-2012-IbarraT #how #multi: How to Synchronize the Heads of a Multitape Automaton (OHI, NQT), pp. 192–204.
CIAA-2012-JezM: Hyper-minimization for Deterministic Tree Automata (AJ, AM), pp. 217–228.
CIAA-2012-KlimannMP #implementation: Implementing Computations in Automaton (Semi)groups (IK, JM, MP), pp. 240–252.
CIAA-2012-KutribO #complexity #on the: On the Descriptional Complexity of the Window Size for Deterministic Restarting Automata (MK, FO), pp. 253–264.
CIAA-2012-LiuSGF #named #regular expression: SDFA: Series DFA for Memory-Efficient Regular Expression Matching (TL, YS, LG, BF), pp. 337–344.
CIAA-2012-Martyugin #ambiguity: Synchronization of Automata with One Undefined or Ambiguous Transition (PVM), pp. 278–288.
CIAA-2012-Mohri #algorithm #ambiguity #finite #functional #transducer: A Disambiguation Algorithm for Finite Automata and Functional Transducers (MM), pp. 265–277.
CIAA-2012-Oliveira #algebra #linear #probability: Typed Linear Algebra for Weigthed (Probabilistic) Automata (JNO), pp. 52–65.
CIAA-2012-PrusaM: Restarting Tiling Automata (DP, FM), pp. 289–300.
CIAA-2012-ReidenbachS #bound #nondeterminism: Automata with Modulo Counters and Nondeterministic Counter Bounds (DR, MLS), pp. 361–368.
DLT-2012-CadilhacFM #ambiguity: Unambiguous Constrained Automata (MC, AF, PM), pp. 239–250.
DLT-2012-CaralpRT #bound #multi: Visibly Pushdown Automata with Multiplicities: Finiteness and K-Boundedness (MC, PAR, JMT), pp. 226–238.
DLT-2012-Csuhaj-Varju: P and dP Automata: Unconventional versus Classical Automata (ECV), pp. 7–22.
DLT-2012-HolzerJ #equivalence #fault: From Equivalence to Almost-Equivalence, and Beyond — Minimizing Automata with Errors — (MH, SJ), pp. 190–201.
DLT-2012-HromkovicKKS #logic #nondeterminism #representation: Determinism vs. Nondeterminism for Two-Way Automata — Representing the Meaning of States by Logical Formulæ (JH, RK, RK, RS), pp. 24–39.
DLT-2012-KapoutsisL #finite #nondeterminism #theorem: Analogs of Fagin’s Theorem for Small Nondeterministic Finite Automata (CAK, NL), pp. 202–213.
DLT-2012-Kari: Cellular Automata, the Collatz Conjecture and Powers of 3/2 (JK), pp. 40–49.
DLT-2012-KlimaP: Biautomata for k-Piecewise Testable Languages (OK, LP), pp. 344–355.
DLT-2012-KutribMW #finite #multi: States and Heads Do Count for Unary Multi-head Finite Automata (MK, AM, MW), pp. 214–225.
DLT-2012-LavadoPS #context-free grammar #nondeterminism: Converting Nondeterministic Automata and Context-Free Grammars into Parikh Equivalent Deterministic Automata (GJL, GP, SS), pp. 284–295.
DLT-2012-PrusaM #2d: Two-Dimensional Sgraffito Automata (DP, FM), pp. 251–262.
ICALP-v2-2012-BouyerMS #approach #game studies #reachability #robust: Robust Reachability in Timed Automata: A Game-Based Approach (PB, NM, OS), pp. 128–140.
ICALP-v2-2012-Broadbent: Prefix Rewriting for Nested-Words and Collapsible Pushdown Automata (CHB), pp. 153–164.
ICALP-v2-2012-BroadbentCHS: A Saturation Method for Collapsible Pushdown Systems (CHB, AC, MH, OS), pp. 165–176.
ICALP-v2-2012-Velner #complexity: The Complexity of Mean-Payoff Automaton Expression (YV), pp. 390–402.
LATA-2012-AbdullaAS #low cost #problem #reachability: The Minimal Cost Reachability Problem in Priced Timed Pushdown Systems (PAA, MFA, JS), pp. 58–69.
LATA-2012-Axelsen #finite #multi: Reversible Multi-head Finite Automata Characterize Reversible Logarithmic Space (HBA), pp. 95–105.
LATA-2012-DennunzioFP #complexity: Computational Complexity of Rule Distributions of Non-uniform Cellular Automata (AD, EF, JP), pp. 204–215.
LATA-2012-Dowek #formal method #physics #quantum: Around the Physical Church-Turing Thesis: Cellular Automata, Formal Languages, and the Principles of Quantum Theory (GD), pp. 21–37.
LATA-2012-GeffertGP: Two-Way Automata Making Choices Only at the Endmarkers (VG, BG, GP), pp. 264–276.
LATA-2012-IbarraT #multi #turing machine: Weak Synchronization and Synchronizability of Multitape Pushdown Automata and Turing Machines (OHI, NQT), pp. 337–350.
LATA-2012-KaraST #logic #word: Feasible Automata for Two-Variable Logic with Successor on Data Words (AK, TS, TT), pp. 351–362.
LATA-2012-SaloT #finite #on the #product line #set: On Stable and Unstable Limit Sets of Finite Families of Cellular Automata (VS, IT), pp. 502–513.
LATA-2012-TangO #model checking #on the: On Model Checking for Visibly Pushdown Automata (NVT, HO), pp. 408–419.
LATA-2012-Woryna #self: Automaton Ranks of Some Self-similar Groups (AW), pp. 514–525.
LATA-2012-Yamakami #finite #quantum: One-Way Reversible and Quantum Finite Automata with Advice (TY), pp. 526–537.
FM-2012-AartsHKOV #abstraction #learning #refinement: Automata Learning through Counterexample Guided Abstraction Refinement (FA, FH, HK, PO, FWV), pp. 10–27.
FM-2012-BarringerFHRR #monitoring #performance #quantifier #runtime #towards: Quantified Event Automata: Towards Expressive and Efficient Runtime Monitors (HB, YF, KH, GR, DER), pp. 68–84.
RTA-2012-Lisitsa #finite #modelling #safety #verification: Finite Models vs Tree Automata in Safety Verification (AL), pp. 225–239.
ICFP-2012-EarlSMH #analysis #higher-order #source code: Introspective pushdown analysis of higher-order programs (CE, IS, MM, DVH), pp. 177–188.
GT-VMT-2012-BrugginkHK #graph #towards: Towards Alternating Automata for Graph Languages (HJSB, MH, BK).
ICGT-2012-BlumeBEK #graph #implementation #invariant #performance: Efficient Symbolic Implementation of Graph Automata with Applications to Invariant Checking (CB, HJSB, DE, BK), pp. 264–278.
ICPR-2012-DuanZRTB #automation #probability #recognition: Timed and probabilistic automata for automatic animal Call Recognition (SD, JZ, PR, MWT, LB), pp. 2910–2913.
SEKE-2012-SalamahEO #consistency #ltl #using: Consistency Checks of System Properties Using LTL and Büchi Automata (SS, ME, OO), pp. 39–44.
QAPL-2012-BulychevDLMPLW #model checking #named #statistics: UPPAAL-SMC: Statistical Model Checking for Priced Timed Automata (PEB, AD, KGL, MM, DBP, AL, ZW), pp. 1–16.
SAC-2012-KeshishzadehIM #framework #model checking: A Büchi automata based model checking framework for reo connectors (SK, MI, AM), pp. 1536–1543.
CASE-2012-FeiMAL #approach #finite #scalability: A symbolic approach to large-scale discrete event systems modeled as finite automata with variables (ZF, SM, KÅ, BL), pp. 502–507.
CASE-2012-GeorgilasAM: Manipulating objects with gliders in cellular automata (IG, AA, CM), pp. 936–941.
CASE-2012-KobayashiH #on the: On opacity and diagnosability in discrete event systems modeled by pushdown automata (KK, KH), pp. 662–667.
CASE-2012-LiK #automation #finite #generative #modelling #testing #using: Model-based automatic test generation for Simulink/Stateflow using extended finite automaton (ML, RK), pp. 857–862.
CASE-2012-ShoaeiFL #abstraction #finite: Abstractions for nonblocking supervisory control of Extended Finite Automata (MRS, LF, BL), pp. 364–370.
DAC-2012-AadithyaR #abstraction #automation #generative #logic #named: DAE2FSM: automatic generation of accurate discrete-time logical abstractions for continuous-time circuit dynamics (KVA, JSR), pp. 311–316.
PPoPP-2012-ZuYXWTPD #implementation #memory management #nondeterminism #performance #regular expression: GPU-based NFA implementation for memory efficient high speed regular expression matching (YZ, MY, ZX, LW, XT, KP, QD), pp. 129–140.
ESOP-2012-DenielouY #communication #multi: Multiparty Session Types Meet Communicating Automata (PMD, NY), pp. 194–213.
FASE-2012-HatvaniPS #adaptation #embedded #framework #verification: Adaptive Task Automata: A Framework for Verifying Adaptive Embedded Systems (LH, PP, CCS), pp. 115–129.
FoSSaCS-2012-BreuersLO: Improved Ramsey-Based Büchi Complementation (SB, CL, JO), pp. 150–164.
FoSSaCS-2012-GollerHOW #model checking #parametricity: Branching-Time Model Checking of Parametric One-Counter Automata (SG, CH, JO, JW), pp. 406–420.
FoSSaCS-2012-Kartzow #exponential #first-order #model checking: First-Order Model Checking on Nested Pushdown Trees is Complete for Doubly Exponential Alternating Time (AK), pp. 376–390.
FoSSaCS-2012-KieferMOWW #complexity #equivalence #on the #probability #problem: On the Complexity of the Equivalence Problem for Probabilistic Automata (SK, ASM, JO, BW, JW), pp. 467–481.
FoSSaCS-2012-PreugschatW #effectiveness #logic #using: Effective Characterizations of Simple Fragments of Temporal Logic Using Prophetic Automata (SP, TW), pp. 135–149.
TACAS-2012-BabiakKRS #ltl #performance: LTL to Büchi Automata Translation: Fast and More Deterministic (TB, MK, VR, JS), pp. 95–109.
TACAS-2012-FriedmannL #analysis: Ramsey-Based Analysis of Parity Automata (OF, ML), pp. 64–78.
TACAS-2012-LengalSV #library #named #nondeterminism #performance: VATA: A Library for Efficient Manipulation of Non-deterministic Tree Automata (OL, JS, TV), pp. 79–94.
TACAS-2012-MertenHSCJ #learning: Demonstrating Learning of Register Automata (MM, FH, BS, SC, BJ), pp. 466–471.
TACAS-2012-SongT #detection #model checking: Pushdown Model Checking for Malware Detection (FS, TT), pp. 110–125.
TACAS-2012-VeanesB #tool support: Symbolic Automata: The Toolkit (MV, NB), pp. 472–477.
CAV-2012-DriscollTR #library #named: OpenNWA: A Nested-Word Automaton Library (ED, AVT, TWR), pp. 665–671.
CAV-2012-GuhaNA #bisimulation #decidability #on the: On Decidability of Prebisimulation for Timed Automata (SG, CN, SAK), pp. 444–461.
CAV-2012-HarrisJR #game studies #programming #safety: Secure Programming via Visibly Pushdown Safety Games (WRH, SJ, TWR), pp. 581–598.
CAV-2012-KretinskyE #ltl: Deterministic Automata for the (F, G)-Fragment of LTL (JK, JE), pp. 7–22.
CSL-2012-Parys: Variants of Collapsible Pushdown Systems (PP), pp. 500–515.
CSL-2012-Wu #commutative: Commutative Data Automata (ZW), pp. 528–542.
LICS-2012-AbdullaAS: Dense-Timed Pushdown Automata (PAA, MFA, JS), pp. 35–44.
LICS-2012-CarayolS #effectiveness #equivalence #recursion #safety: Collapsible Pushdown Automata and Labeled Recursion Schemes: Equivalence, Safety and Effective Selection (AC, OS), pp. 165–174.
LICS-2012-ChatterjeeT #decidability #infinity #probability #problem #word: Decidable Problems for Probabilistic Automata on Infinite Words (KC, MT), pp. 185–194.
LICS-2012-ChatterjeeV #game studies: Mean-Payoff Pushdown Games (KC, YV), pp. 195–204.
LICS-2012-FijalkowGO #probability #problem: Deciding the Value 1 Problem for Probabilistic Leaktight Automata (NF, HG, YO), pp. 295–304.
LICS-2012-HerbreteauSW #abstraction: Better Abstractions for Timed Automata (FH, BS, IW), pp. 375–384.
LICS-2012-Tan #order: An Automata Model for Trees with Ordered Data Values (TT), pp. 586–595.
VMCAI-2012-HowarSJC #canonical: Inferring Canonical Register Automata (FH, BS, BJ, SC), pp. 251–266.
DLT-J-2009-BealBP11 #bound #clustering #polynomial #word: A Quadratic Upper Bound on the Size of a Synchronizing Word in One-Cluster Automata (MPB, MVB, DP), pp. 277–288.
CIAA-J-2010-DrosteM11 #monad #regular expression: Weighted Automata and Regular Expressions over Valuation Monoids (MD, IM), pp. 1829–1844.
CIAA-J-2010-EsikM11 #simulation: The Category of Simulations for Weighted Tree Automata (ZÉ, AM), pp. 1845–1859.
CIAA-J-2010-KufleitnerL11 #order: Partially Ordered Two-Way BüChi Automata (MK, AL), pp. 1861–1876.
CIAA-J-2010-YuBI11 #multi #relational #string #using #verification: Relational String Verification Using Multi-Track Automata (FY, TB, OHI), pp. 1909–1924.
DLT-J-2010-BordihnKM11 #communication #finite #parallel: Undecidability and Hierarchy Results for Parallel Communicating Finite Automata (HB, MK, AM), pp. 1577–1592.
DLT-J-2010-BrodaMMR11 #approach #combinator #complexity #on the: On the Average State Complexity of Partial derivative Automata: an analytic Combinatorics Approach (SB, AM, NM, RR), pp. 1593–1606.
AFL-2011-BorgwardtP #infinity #problem: The Inclusion Problem for Weighted Automata on Infinite Trees (SB, RP), pp. 108–122.
AFL-2011-CermakM #strict: n-Accepting Restricted Pushdown Automata Systems (MC, AM), pp. 168–183.
AFL-2011-Egri-NagyN #symmetry: Symmetries of Automata (AEN, CLN), p. 391.
AFL-2011-MalettiQ #finite: Hyper-minimisation of deterministic weighted finite automata over semifields (AM, DQ), pp. 285–299.
AFL-2011-Umeo #2d #algorithm #implementation: Recent Developments in Firing Squad Synchronization Algorithms for Two-Dimensional Cellular Automata and Their State-Efficient Implementations (HU), pp. 368–387.
CIAA-2011-CarninoF #generative #markov #random #using: Random Generation of Deterministic Acyclic Automata Using Markov Chains (VC, SDF), pp. 65–75.
CIAA-2011-CastiglioneRS #algorithm #nondeterminism: Nondeterministic Moore Automata and Brzozowski’s Algorithm (GC, AR, MS), pp. 88–99.
CIAA-2011-DaciukW #finite #representation: Smaller Representation of Finite State Automata (JD, DW), pp. 118–129.
CIAA-2011-FlouriJMIP #order: Tree Template Matching in Ranked Ordered Trees by Pushdown Automata (TF, JJ, BM, CSI, SPP), pp. 273–281.
CIAA-2011-HanK: A Cellular Automaton Model for Car Traffic with a Form-One-Lane Rule (YSH, SKK), pp. 154–165.
CIAA-2011-HeamHK: Loops and Overloops for Tree Walking Automata (PCH, VH, OK), pp. 166–177.
CIAA-2011-HolzerK #finite: Gaining Power by Input Operations: Finite Automata and Beyond (MH, MK), pp. 16–29.
CIAA-2011-JezM #performance: Computing All ℓ-Cover Automata Fast (AJ, AM), pp. 203–214.
CIAA-2011-LonatiP #2d #towards: Towards More Expressive 2D Deterministic Automata (VL, MP), pp. 225–237.
CIAA-2011-Martyugin #complexity #problem #word: Complexity of Problems Concerning Reset Words for Cyclic and Eulerian Automata (PM), pp. 238–249.
CIAA-2011-OrtizLS #distributed: Distributed Event Clock Automata — Extended Abstract (JJO, AL, PYS), pp. 250–263.
CIAA-2011-SkvortsovT #case study #random #word: Experimental Study of the Shortest Reset Word of Random Automata (ES, ET), pp. 290–298.
DLT-2011-BrodaMMR #complexity: The Average Transition Complexity of Glushkov and Partial Derivative Automata (SB, AM, NM, RR), pp. 93–104.
DLT-2011-CeceG #2d #online #simulation: Simulations over Two-Dimensional On-Line Tessellation Automata (GC, AG), pp. 141–152.
DLT-2011-CernoM: Δ-Clearing Restarting Automata and CFL (PC, FM), pp. 153–164.
DLT-2011-ChandesrisDFM #aspect-oriented: Computational Aspects of Asynchronous Cellular Automata (JC, AD, EF, LM), pp. 466–468.
DLT-2011-HundeshagenO #regular expression: Characterizing the Regular Languages by Nonforgetting Restarting Automata (NH, FO), pp. 288–299.
DLT-2011-Kasprzik #finite #query: Inference of Residual Finite-State Tree Automata from Membership Queries and Finite Positive Data (AK), pp. 476–477.
DLT-2011-KuncO #finite #using: Describing Periodicity in Two-Way Deterministic Finite Automata Using Transformation Semigroups (MK, AO), pp. 324–336.
DLT-2011-MenibusS #approach #self: Self-organization in Cellular Automata: A Particle-Based Approach (BHdM, MS), pp. 251–263.
DLT-2011-RestivoV: Some Remarks on Automata Minimality (AR, RV), pp. 15–27.
DLT-2011-RodaroS #problem: Never Minimal Automata and the Rainbow Bipartite Subgraph Problem (ER, PVS), pp. 374–385.
DLT-2011-TasdemirS #modelling: Models of Pushdown Automata with Reset (NT, ACCS), pp. 417–428.
ICALP-v2-2011-BertrandBBS #problem: Emptiness and Universality Problems in Timed Automata with Positive Frequency (NB, PB, TB, AS), pp. 246–257.
ICALP-v2-2011-BrihayeDGORW #bound #hybrid #on the #reachability: On Reachability for Hybrid Automata over Bounded Time (TB, LD, GG, JO, JFR, JW), pp. 416–427.
ICALP-v2-2011-Clemente: Büchi Automata Can Have Smaller Quotients (LC), pp. 258–270.
ICALP-v2-2011-Delacourt #set #theorem: Rice’s Theorem for μ-Limit Sets of Cellular Automata (MD), pp. 89–100.
ICALP-v2-2011-DengH #markov #on the #semantics: On the Semantics of Markov Automata (YD, MH), pp. 307–318.
ICALP-v2-2011-HopkinsMO #decidability #ml: A Fragment of ML Decidable by Visibly Pushdown Automata (DH, ASM, CHLO), pp. 149–161.
ICALP-v2-2011-Zetzsche #monad #on the #transducer: On the Capabilities of Grammars, Automata, and Transducers Controlled by Monoids (GZ), pp. 222–233.
LATA-2011-BareckaC #complexity #finite #problem: The Parameterized Complexity of Chosen Problems for Finite Automata on Trees (AB, WC), pp. 129–141.
LATA-2011-Colcombet: Green’s Relations and Their Use in Automata Theory (TC), pp. 1–21.
LATA-2011-Gelderie #regular expression: Classifying Regular Languages via Cascade Products of Automata (MG), pp. 286–297.
LATA-2011-LisitsaPS: Planarity of Knots, Register Automata and LogSpace Computability (AL, IP, RS), pp. 366–377.
LATA-2011-OkhotinS #ambiguity #complexity #word: Descriptional Complexity of Unambiguous Nested Word Automata (AO, KS), pp. 414–426.
LATA-2011-Quaas #bound #on the #problem: On the Interval-Bound Problem for Weighted Timed Automata (KQ), pp. 452–464.
LATA-2011-Schluter #lookahead: Restarting Automata with Auxiliary Symbols and Small Lookahead (NS), pp. 499–510.
IFM-J-2009-BenesBBCSV11 #component #ltl #partial order #reduction: Partial order reduction for state/event LTL with application to component-interaction automata (NB, LB, BB, IC, JS, PV), pp. 877–890.
RTA-2011-Tison #constraints #question #similarity #term rewriting #what: Tree Automata, (Dis-)Equality Constraints and Term Rewriting: What’s New? (ST), pp. 1–2.
SFM-2011-Jonsson #learning #modelling: Learning of Automata Models Extended with Data (BJ), pp. 327–349.
SFM-2011-SteffenHM #learning #perspective: Introduction to Active Automata Learning from a Practical Perspective (BS, FH, MM), pp. 256–296.
TLCA-2011-Tison #constraints #question #similarity #term rewriting #what: Tree Automata, (Dis-)Equality Constraints and Term Rewriting — What’s New? (ST), pp. 3–5.
ICFP-2011-VardoulakisS #analysis: Pushdown flow analysis of first-class control (DV, OS), pp. 69–80.
GCM-2010-PlumpSS11 #finite #graph #source code: Minimizing Finite Automata with Graph Programs (DP, RS, AS).
AGTIVE-2011-GreenyerR #concept #diagrams #game studies #graph grammar #sequence chart #specification: Applying Advanced TGG Concepts for a Complex Transformation of Sequence Diagram Specifications to Timed Game Automata (JG, JR), pp. 222–237.
GT-VMT-2011-Krause #distributed: Distributed Port Automata (CK).
POPL-2011-Tzevelekos: Fresh-register automata (NT), pp. 295–306.
QAPL-2011-Rutkowski #game studies: Two-Player Reachability-Price Games on Single-Clock Timed Automata (MR), pp. 31–46.
QAPL-2011-TracolDZ #probability: Computing Distances between Probabilistic Automata (MT, JD, AZ), pp. 148–162.
LDTA-2011-SergeyC #recursion #type checking: From type checking by recursive descent to type checking with an abstract machine (IS, DC), p. 2.
CASE-2011-FeiMA #finite #modelling #resource management #using: Modeling sequential resource allocation systems using Extended Finite Automata (ZF, SM, KÅ), pp. 444–449.
CASE-2011-MiremadiLA #finite: BDD-based supervisory control on extended finite automata (SM, BL, KÅ), pp. 25–31.
DATE-2011-BruschiPRS #performance: An efficient Quantum-Dot Cellular Automata adder (FB, FP, VR, DS), pp. 1220–1223.
FASE-2011-LiXBL #model checking: Model Checking Büchi Pushdown Systems (JL, FX, TB, VL), pp. 141–155.
FoSSaCS-2011-BertrandSJK #approach #game studies: A Game Approach to Determinize Timed Automata (NB, AS, TJ, MK), pp. 245–259.
FoSSaCS-2011-BokerK: Co-Büching Them All (UB, OK), pp. 184–198.
FoSSaCS-2011-DaxK #word: Alternation Elimination for Automata over Nested Words (CD, FK), pp. 168–183.
FoSSaCS-2011-HalamishK: Minimizing Deterministic Lattice Automata (SH, OK), pp. 199–213.
FoSSaCS-2011-JaubertR #analysis #robust: Quantitative Robustness Analysis of Flat Timed Automata (RJ, PAR), pp. 229–244.
FoSSaCS-2011-Kobayashi #algorithm #higher-order #linear #model checking #recursion: A Practical Linear Time Algorithm for Trivial Automata Model Checking of Higher-Order Recursion Schemes (NK0), pp. 260–274.
TACAS-2011-BertrandJSK #nondeterminism #testing: Off-Line Test Selection with Test Purposes for Non-deterministic Timed Automata (NB, TJ, AS, MK), pp. 96–111.
TACAS-2011-TsayTCC #repository: Büchi Store: An Open Repository of Büchi Automata (YKT, MHT, JSC, YWC), pp. 262–266.
CAV-2011-BabicRS #analysis: Malware Analysis with Tree Automata Inference (DB, DR, DS), pp. 116–131.
CAV-2011-ChatterjeeHJS #algorithm #analysis #markov #process: Symbolic Algorithms for Qualitative Analysis of Markov Decision Processes with Büchi Objectives (KC, MH, MJ, NS), pp. 260–276.
CAV-2011-CimattiMT #hybrid #performance #verification: Efficient Scenario Verification for Hybrid Automata (AC, SM, ST), pp. 317–332.
CAV-2011-HabermehlHRSV #verification: Forest Automata for Verification of Heap Manipulation (PH, LH, AR, JS, TV), pp. 424–440.
CAV-2011-KieferMOWW #equivalence #probability: Language Equivalence for Probabilistic Automata (SK, ASM, JO, BW, JW), pp. 526–540.
CAV-2011-MorbePS #model checking: Fully Symbolic Model Checking for Timed Automata (GM, FP, CS), pp. 616–632.
CAV-2011-PeterEM #named #synthesis #verification: Synthia: Verification and Synthesis for Timed Automata (HJP, RE, RM), pp. 649–655.
CSL-2011-BokerH: Determinizing Discounted-Sum Automata (UB, TAH), pp. 82–96.
CSL-2011-FogartyKVW: Unifying Büchi Complementation Constructions (SF, OK, MYV, TW), pp. 248–263.
CSL-2011-Kartzow #graph: A Pumping Lemma for Collapsible Pushdown Graphs of Level 2 (AK), pp. 322–336.
ICST-2011-BelliBTF #mutation testing #testing: Mutation Testing of “Go-Back” Functions Based on Pushdown Automata (FB, MB, TT, ZF), pp. 249–258.
ICST-2011-ChanderDSY #finite #generative #modelling #sequence: Optimal Test Input Sequence Generation for Finite State Models and Pushdown Systems (AC, DD, KS, DY), pp. 140–149.
LICS-2011-AminofKL #approximate: Rigorous Approximated Determinization of Weighted Automata (BA, OK, RL), pp. 345–354.
LICS-2011-BojanczykKL: Automata with Group Actions (MB, BK, SL), pp. 355–364.
TAP-2011-HeamM #approach #random testing #testing #using: A Random Testing Approach Using Pushdown Automata (PCH, CM), pp. 119–133.
TAP-2011-Tan #metric #testing: State Coverage Metrics for Specification-Based Testing with Büchi Automata (LT), pp. 171–186.
VMCAI-2011-ChadhaSV #probability: Probabilistic Büchi Automata with Non-extremal Acceptance Thresholds (RC, APS, MV), pp. 103–117.
VMCAI-2011-DelahayeKLLPSW #probability: Abstract Probabilistic Automata (BD, JPK, KGL, AL, MLP, FS, AW), pp. 324–339.
VMCAI-2011-HooimeijerV #algorithm #analysis #evaluation #string: An Evaluation of Automata Algorithms for String Analysis (PH, MV), pp. 248–262.
VMCAI-2011-HowarSM #abstraction #automation #learning #refinement: Automata Learning with Automated Alphabet Abstraction Refinement (FH, BS, MM), pp. 263–277.
AFL-J-2008-KaminskiZ10 #nondeterminism: Finite-Memory Automata with Non-Deterministic Reassignment (MK, DZ), pp. 741–760.
AFL-J-2008-KutribMO10 #on the: On Stateless Two-Pushdown Automata and Restarting Automata (MK, HM, FO), pp. 781–798.
AFL-J-2008-Lohrey10 #problem #regular expression: Compressed Membership Problems for Regular Expressions and Hierarchical Automata (ML), pp. 817–841.
DLT-J-2008-FiliotTT10 #constraints: Tree Automata with Global Constraints (EF, JMT, ST), pp. 571–596.
DLT-J-2008-Glockler10 #taxonomy: A Taxonomy of Deterministic Forgetting Automata (JG), pp. 619–631.
CIAA-2010-AllauzenCM #kernel #scalability: Large-Scale Training of SVMs with Automata Kernels (CA, CC, MM), pp. 17–27.
CIAA-2010-AlmeidaMPS #coq: Partial Derivative Automata Formalized in Coq (JBA, NM, DP, SMdS), pp. 59–68.
CIAA-2010-AlmeidaMR #incremental: Incremental DFA Minimisation (MA, NM, RR), pp. 39–48.
CIAA-2010-AntosM #approach #finite #pattern matching: Finite Automata for Generalized Approach to Backward Pattern Matching (JA, BM), pp. 49–58.
CIAA-2010-CastiglioneNS #algorithm #product line: A Challenging Family of Automata for Classical Minimization Algorithms (GC, CN, MS), pp. 251–260.
CIAA-2010-CimattiMRT #nondeterminism #regular expression: From Sequential Extended Regular Expressions to NFA with Symbolic Labels (AC, SM, MR, ST), pp. 87–94.
CIAA-2010-EsikM #simulation: Simulations of Weighted Tree Automata (ZÉ, AM), pp. 321–330.
CIAA-2010-ForysOB #infinity: Symbolic Dynamics, Flower Automata and Infinite Traces (WF, PO, SB), pp. 135–142.
CIAA-2010-HundeshagenOV: Transductions Computed by PC-Systems of Monotone Deterministic Restarting Automata (NH, FO, MV), pp. 163–172.
CIAA-2010-Jonoska #self #using: Using Automata to Describe Self-Assembled Nanostructures (NJ), pp. 1–3.
CIAA-2010-KufleitnerL #order: Partially Ordered Two-Way Büchi Automata (MK, AL), pp. 181–190.
CIAA-2010-LiuGLT #composition #matrix #regular expression: Compressing Regular Expressions’ DFA Table by Matrix Decomposition (YL, LG, PL, JT), pp. 282–289.
CIAA-2010-OkuiS #ambiguity #regular expression: Disambiguation in Regular Expression Matching via Position Automata with Augmented Transitions (SO, TS), pp. 231–240.
CIAA-2010-TirnaucaT #identification #query: Types of Trusted Information That Make DFA Identification with Correction Queries Feasible (CT, CIT), pp. 272–281.
CIAA-2010-TsaiFVT: State of Büchi Complementation (MHT, SF, MYV, YKT), pp. 261–271.
CIAA-2010-YuBI #multi #relational #string #using #verification: Relational String Verification Using Multi-track Automata (FY, TB, OHI), pp. 290–299.
DLT-2010-BordihnKM #communication #finite #parallel: Undecidability and Hierarchy Results for Parallel Communicating Finite Automata (HB, MK, AM), pp. 88–99.
DLT-2010-BrodaMMR #on the: On the Average Number of States of Partial Derivative Automata (SB, AM, NM, RR), pp. 112–123.
DLT-2010-DrosteV #bound #logic #multi #theorem: Kleene and Büchi Theorems for Weighted Automata and Multi-valued Logics over Arbitrary Bounded Lattices (MD, HV), pp. 160–172.
DLT-2010-GeffertP: Two-Way Unary Automata versus Logarithmic Space (VG, GP), pp. 197–208.
DLT-2010-OttoPM #on the: On Lexicalized Well-Behaved Restarting Automata That Are Monotone (FO, MP, FM), pp. 352–363.
DLT-2010-RestivoV: Automata with Extremal Minimality Conditions (AR, RV), pp. 399–410.
DLT-2010-Schluter #lookahead #on the: On Lookahead Hierarchies for Monotone and Deterministic Restarting Automata with Auxiliary Symbols (NS), pp. 440–441.
ICALP-v1-2010-BojanczykP #evaluation #nondeterminism #performance #using: Efficient Evaluation of Nondeterministic Automata Using Factorization Forests (MB, PP), pp. 515–526.
ICALP-v2-2010-BokerKR: Alternation Removal in Büchi Automata (UB, OK, AR), pp. 76–87.
ICALP-v2-2010-BolligGMZ #logic #transitive: Pebble Weighted Automata and Transitive Closure Logics (BB, PG, BM, MZ), pp. 587–598.
ICALP-v2-2010-BraudC #linear #order: Linear Orders in the Pushdown Hierarchy (LB, AC), pp. 88–99.
ICALP-v2-2010-FontaineLV #algebra #approach #using: Automata for Coalgebras: An Approach Using Predicate Liftings (GF, RAL, YV), pp. 381–392.
ICALP-v2-2010-GenestGMW: Optimal Zielonka-Type Construction of Deterministic Asynchronous Automata (BG, HG, AM, IW), pp. 52–63.
ICALP-v2-2010-GimbertO #decidability #finite #probability #problem #word: Probabilistic Automata on Finite Words: Decidable and Undecidable Problems (HG, YO), pp. 527–538.
ICALP-v2-2010-GollerHOW #model checking #parametricity: Model Checking Succinct and Parametric One-Counter Automata (SG, CH, JO, JW), pp. 575–586.
LATA-2010-ArrighiG #quantum: A Simple n-Dimensional Intrinsically Universal Quantum Cellular Automaton (PA, JG), pp. 70–81.
LATA-2010-BousquetL #ambiguity #equivalence #problem: Equivalence and Inclusion Problem for Strongly Unambiguous Büchi Automata (NB, CL), pp. 118–129.
LATA-2010-Crespi-ReghizziM #precedence: Operator Precedence and the Visibly Pushdown Property (SCR, DM), pp. 214–226.
LATA-2010-Ehlers: Short Witnesses and Accepting Lassos in ω-Automata (RE), pp. 261–272.
LATA-2010-GrumbergKS #infinity: Variable Automata over Infinite Alphabets (OG, OK, SS), pp. 561–572.
LATA-2010-KutribM: Reversible Pushdown Automata (MK, AM), pp. 368–379.
LATA-2010-LetichevskySS #equivalence #finite #multi #problem #proving #using: The Equivalence Problem of Deterministic Multitape Finite Automata: A New Proof of Solvability Using a Multidimensional Tape (AAL, ASS, SKS), pp. 392–402.
LATA-2010-MarschallR #algorithm #analysis #pattern matching #probability: Exact Analysis of Horspool’s and Sunday’s Pattern Matching Algorithms with Probabilistic Arithmetic Automata (TM, SR), pp. 439–450.
LATA-2010-Melichar #named: Arbology: Trees and Pushdown Automata (BM), pp. 32–49.
LATA-2010-Muscholl #analysis #communication: Analysis of Communicating Automata (AM), pp. 50–57.
LATA-2010-PlatekML #functional #generative: Restarting Automata with Structured Output and Functional Generative Description (MP, FM, ML), pp. 500–511.
LATA-2010-Tamm: Some Minimality Results on Biresidual and Biseparable Automata (HT), pp. 573–584.
RTA-2010-Bojanczyk #word: Automata for Data Words and Data Trees (MB), pp. 1–4.
ICFP-2010-HornM: Abstracting abstract machines (DVH, MM), pp. 51–62.
IFL-2010-SieczkowskiBB #automation #coq #formal method #reduction #semantics: Automating Derivations of Abstract Machines from Reduction Semantics: — A Generic Formalization of Refocusing in Coq (FS, MB, DB), pp. 72–88.
GT-VMT-2010-HassanMS #interactive #lightweight: A lightweight abstract machine for interaction nets (AH, IM, SS).
ICGT-2010-Monreale #calculus #encoding #lts #process #semantics #visual notation: LTS Semantics for Process Calculi from Their Graphical Encodings (GVM), pp. 403–406.
SEKE-2010-Cao #interface #refinement: Refinement Checking for Interface Automata with Z Notation (ZC), pp. 399–404.
PEPM-2010-LiO: Conditional weighted pushdown systems and applications (XL, MO), pp. 141–150.
POPL-2010-GershenfeldDCKGDGS #configuration management #logic: Reconfigurable asynchronous logic automata: (RALA) (NG, DD, KC, AK, FG, EDD, SG, PSN), pp. 1–6.
QAPL-2010-AltisenLM #calculus #component #evaluation #interface #performance #realtime #using: Performance Evaluation of Components Using a Granularity-based Interface Between Real-Time Calculus and Timed Automata (KA, YL, MM), pp. 16–33.
SAC-2010-Fellah #framework #model checking: Time and alternation: an automata based framework to software model checking (AF), pp. 2498–2502.
SAC-2010-FlouriMJ #multi: Aho-Corasick like multiple subtree matching by pushdown automata (TF, BM, JJ), pp. 2157–2158.
CASE-2010-OuedraogoKMA #approach #finite: Symbolic approach to nonblocking and safe control of Extended Finite Automata (LO, RK, RM, KÅ), pp. 471–476.
ESOP-2010-Wenner #network: Weighted Dynamic Pushdown Networks (AW), pp. 590–609.
FoSSaCS-2010-HeussnerLMS #analysis #communication #reachability: Reachability Analysis of Communicating Pushdown Systems (AH, JL, AM, GS), pp. 267–281.
TACAS-2010-DoyenR #algorithm #finite: Antichain Algorithms for Finite Automata (LD, JFR), pp. 2–22.
TACAS-2010-FogartyV #performance: Efficient Büchi Universality Checking (SF, MYV), pp. 205–220.
TACAS-2010-MalinowskiN #bound #model checking #partial order #satisfiability #semantics: SAT Based Bounded Model Checking with Partial Order Semantics for Timed Automata (JM, PN), pp. 405–419.
CAV-2010-AbdullaCCHHMV #simulation #testing: Simulation Subsumption in Ramsey-Based Büchi Automata Universality and Inclusion Testing (PAA, YFC, LC, LH, CDH, RM, TV), pp. 132–147.
CAV-2010-BolligKKLNP #framework #learning #named: libalf: The Automata Learning Framework (BB, JPK, CK, ML, DN, DRP), pp. 360–364.
CAV-2010-HerbreteauSW #performance: Efficient Emptiness Check for Timed Büchi Automata (FH, BS, IW), pp. 148–161.
CAV-2010-LiXBL #analysis #hardware #performance #reachability: Efficient Reachability Analysis of Büchi Pushdown Systems for Hardware/Software Co-verification (JL, FX, TB, VL), pp. 339–353.
CAV-2010-Seth #bound #multi #reachability: Global Reachability in Bounded Phase Multi-stack Pushdown Systems (AS), pp. 615–628.
CSL-2010-BenediktLP #logic #word: Automata vs. Logics on Data Words (MB, CL, GP), pp. 110–124.
ICST-2010-LodingP #generative #model checking #testing: Timed Moore Automata: Test Data Generation and Model Checking (HL, JP), pp. 449–458.
IJCAR-2010-FriedmannLL: A Decision Procedure for CTL* Based on Tableaux and Automata (OF, ML, ML), pp. 331–345.
LICS-2010-BargunoCGJV #constraints #problem: The Emptiness Problem for Tree Automata with Global Constraints (LB, CC, GG, FJ, CV), pp. 263–272.
LICS-2010-BojanczykL #xpath: An Extension of Data Automata that Captures XPath (MB, SL), pp. 243–252.
LICS-2010-EisentrautHZ #on the #probability: On Probabilistic Automata in Continuous Time (CE, HH, LZ), pp. 342–351.
LICS-2010-JenkinsORW #bound: Alternating Timed Automata over Bounded Time (MJ, JO, AR, JW), pp. 60–69.
SAT-2010-Ehlers #satisfiability #using: Minimising Deterministic Büchi Automata Precisely Using SAT Solving (RE), pp. 326–332.
VMCAI-2010-BuZL #hybrid #programming #reachability #using #verification: Path-Oriented Reachability Verification of a Class of Nonlinear Hybrid Automata Using Convex Programming (LB, JZ, XL), pp. 78–94.
PODS-2009-CohenKS #probability #xml: Running tree automata on probabilistic XML (SC, BK, YS), pp. 227–236.
ITiCSE-2009-Merceron #design pattern #education: Design patterns to support teaching of automata theory (AM), p. 341.
CIAA-J-2008-AbdullaBHKV09 #bisimulation: Composed Bisimulation for Tree Automata (PAA, AB, LH, LK, TV), pp. 685–700.
CIAA-J-2008-CantinLW09: Computing Convex Hulls by Automata Iteration (FC, AL, PW), pp. 647–667.
CIAA-J-2008-HolzerK09 #complexity #finite #nondeterminism: Nondeterministic Finite Automata — Recent Results on the Descriptional and Computational Complexity (MH, MK), pp. 563–580.
CIAA-J-2008-MatsumotoHT09 #implementation #pattern matching #performance #runtime: A Run-Time Efficient Implementation of Compressed Pattern Matching Automata (TM, KH, MT), pp. 717–733.
CIAA-J-2008-Pighizzini09: Deterministic Pushdown Automata and Unary Languages (GP), pp. 629–645.
CIAA-2009-CaronCM: Small Extended Expressions for Acyclic Automata (PC, JMC, LM), pp. 198–207.
CIAA-2009-ClarridgeS: A Cellular Automaton Model for Car Traffic with a Slow-to-Stop Rule (AC, KS), pp. 44–53.
CIAA-2009-CleophasH #algorithm #tool support: Forest FIRE: A Taxonomy-based Toolkit of Tree Automata and Regular Tree Algorithms (LGC, KH), pp. 245–248.
CIAA-2009-Freivalds #finite: Amount of Nonconstructivity in Finite Automata (RF), pp. 227–236.
CIAA-2009-Fujiyoshi #graph #recognition: Recognition of a Spanning Tree of Directed Acyclic Graphs by Tree Automata (AF), pp. 105–114.
CIAA-2009-GantyMR #abstraction #fixpoint #refinement: Fixpoint Guided Abstraction Refinement for Alternating Automata (PG, NM, JFR), pp. 155–164.
CIAA-2009-GruberHT #empirical #finite #regular expression: Short Regular Expressions from Finite Automata: Empirical Results (HG, MH, MT), pp. 188–197.
CIAA-2009-HeamNS #generative #random: Random Generation of Deterministic Tree (Walking) Automata (PCH, CN, SS), pp. 115–124.
CIAA-2009-HolubS #finite #implementation #on the #parallel: On Parallel Implementations of Deterministic Finite Automata (JH, SS), pp. 54–64.
CIAA-2009-HolzerM #algorithm: An nlogn Algorithm for Hyper-minimizing States in a (Minimized) Deterministic Automaton (MH, AM), pp. 4–13.
CIAA-2009-Koch #xml: Applications of Automata in XML Processing (CK), p. 2.
CIAA-2009-KutribM #communication: Cellular Automata with Sparse Communication (MK, AM), pp. 34–43.
CIAA-2009-LiuYLT: A Table Compression Method for Extended Aho-Corasick Automaton (YL, YY, PL, JT), pp. 84–93.
CIAA-2009-LuY #finite #question: Are Statecharts Finite Automata? (HL, SY), pp. 258–261.
CIAA-2009-Navarro #implementation #string: Implementation and Application of Automata in String Processing (GN), p. 1.
CIAA-2009-Prochazka #compilation #generative: Compiler Generator Based on Restarting Automata (JP), pp. 253–257.
CIAA-2009-Seidl #finite #program analysis: Program Analysis through Finite Tree Automata (HS), p. 3.
CIAA-2009-VuilleminG #normalisation #regular expression: Compact Normal Form for Regular Languages as Xor Automata (JV, NG), pp. 24–33.
DLT-2009-BealP #bound #clustering #polynomial #word: A Quadratic Upper Bound on the Size of a Synchronizing Word in One-Cluster Automata (MPB, DP), pp. 81–90.
DLT-2009-FriscoI #finite #multi #on the: On Stateless Multihead Finite Automata and Multihead Pushdown Automata (PF, OHI), pp. 240–251.
DLT-2009-Kapoutsis #complexity #finite: Size Complexity of Two-Way Finite Automata (CAK), pp. 47–66.
ICALP-v2-2009-BaierBBB #question: When Are Timed Automata Determinizable? (CB, NB, PB, TB), pp. 43–54.
ICALP-v2-2009-ColcombetZ #bound: A Tight Lower Bound for Determinization of Transition Labeled Büchi Automata (TC, KZ), pp. 151–162.
ICALP-v2-2009-ParysW: Weak Alternating Timed Automata (PP, IW), pp. 273–284.
LATA-2009-BoigelotD #finite #set #visualisation: Partial Projection of Sets Represented by Finite Automata, with Application to State-Space Visualization (BB, JFD), pp. 200–211.
LATA-2009-CaronCM #multi: Multi-tilde Operators and Their Glushkov Automata (PC, JMC, LM), pp. 290–301.
LATA-2009-CattaneoDFP: Non-uniform Cellular Automata (GC, AD, EF, JP), pp. 302–313.
LATA-2009-ClarridgeS #composition: A Cryptosystem Based on the Composition of Reversible Cellular Automata (AC, KS), pp. 314–325.
LATA-2009-HolzerK #complexity #finite: Descriptional and Computational Complexity of Finite Automata (MH, MK), pp. 23–42.
LATA-2009-JacquemardKV: Rigid Tree Automata (FJ, FK, CV), pp. 446–457.
LATA-2009-JiraskovaP #self #verification: Converting Self-verifying Automata into Deterministic Automata (GJ, GP), pp. 458–468.
LATA-2009-LimayeM #multi #testing: Membership Testing: Removing Extra Stacks from Multi-stack Pushdown Automata (NL, MM), pp. 493–504.
LATA-2009-LisitsaPS #word: Automata on Gauss Words (AL, IP, RS), pp. 505–517.
LATA-2009-Nicaud #on the: On the Average Size of Glushkov’s Automata (CN), pp. 626–637.
LATA-2009-PardubskaPO #communication #correctness #on the #parallel: On Parallel Communicating Grammar Systems and Correctness Preserving Restarting Automata (DP, MP, FO), pp. 660–671.
LATA-2009-PribavkinaR: Finitely Generated Synchronizing Automata (EVP, ER), pp. 672–683.
LATA-2009-Salomaa #complexity #word: State Complexity of Nested Word Automata (KS), pp. 59–70.
LATA-2009-SumanP #integer: Determinization and Expressiveness of Integer Reset Timed Automata with Silent Transitions (PVS, PKP), pp. 728–739.
LATA-2009-VerwerWW: One-Clock Deterministic Timed Automata Are Efficiently Identifiable in the Limit (SV, MdW, CW), pp. 740–751.
FM-2009-ShahbazG: Inferring Mealy Machines (MS, RG), pp. 207–222.
REFSQ-2009-Kof #modelling #specification: Translation of Textual Specifications to Automata by Means of Discourse Context Modeling (LK), pp. 197–211.
ESEC-FSE-2009-HannaBR #automation #behaviour #composition #independence #verification: Behavioral automata composition for automatic topology independent verification of parameterized systems (YH, SB, HR), pp. 325–334.
SAC-2009-GiroD #on the #probability #verification: On the verification of probabilistic I/O automata with unspecified rates (SG, PRD), pp. 582–586.
SAC-2009-KoehlerC: Decomposing port automata (CK, DC), pp. 1369–1373.
SAC-2009-SinnigCK #case study #lts #modelling #semantics: LTS semantics for use case models (DS, PC, FK), pp. 365–370.
CASE-2009-MitraS #composition #hybrid: Hybrid Input Output Automata for composable conveyor systems (SM, SS), p. 29.
FASE-2009-HuismanT #ml #security: A Formal Connection between Security Automata and JML Annotations (MH, AT), pp. 340–354.
FoSSaCS-2009-BerardH: Interrupt Timed Automata (BB, SH), pp. 197–211.
FoSSaCS-2009-KupfermanP #bound: Lower Bounds on Witnesses for Nonemptiness of Universal Co-Büchi Automata (OK, NP), pp. 182–196.
FoSSaCS-2009-Schewe #bound #nondeterminism: Tighter Bounds for the Determinisation of Büchi Automata (SS), pp. 167–181.
FoSSaCS-2009-Stirling #dependence: Dependency Tree Automata (CS), pp. 92–106.
TACAS-2009-ChenFCTW #composition #learning #verification: Learning Minimal Separating DFA’s for Compositional Verification (YFC, AF, EMC, YKT, BYW), pp. 31–45.
TACAS-2009-FogartyV #termination: Büchi Complementation and Size-Change Termination (SF, MYV), pp. 16–30.
CADE-2009-BoigelotBL #theorem: A Generalization of Semenov’s Theorem to Automata over Real Numbers (BB, JB, JL), pp. 469–484.
CAV-2009-LammichMW #constraints #network #set: Predecessor Sets of Dynamic Pushdown Networks with Tree-Regular Constraints (PL, MMO, AW), pp. 525–539.
CSL-2009-DuparcFM #decidability #game studies #linear #problem: Linear Game Automata: Decidable Hierarchy Problems for Stripped-Down Alternating Tree Automata (JD, AF, FM), pp. 225–239.
LICS-2009-BokerK: Co-ing Büchi Made Tight and Useful (UB, OK), pp. 245–254.
LICS-2009-CaiZL #bound: An Improved Lower Bound for the Complementation of Rabin Automata (YC, TZ, HL), pp. 167–176.
LICS-2009-ChenHKM #markov #model checking #specification: Quantitative Model Checking of Continuous-Time Markov Chains Against Timed Automata Specifications (TC, TH, JPK, AM), pp. 309–318.
LICS-2009-Tan #graph #infinity #reachability: Graph Reachability and Pebble Automata over Infinite Alphabets (TT), pp. 157–166.
MBT-2009-DadeauLH #generative #on the #random #testing #using: On the Use of Uniform Random Generation of Automata for Testing (FD, JL, PCH), pp. 37–51.
VMCAI-2009-JurdzinskiLR #game studies #hybrid: Average-Price-per-Reward Games on Hybrid Automata with Strong Resets (MJ, RL, MR), pp. 167–181.
PODS-2008-CateS #logic #transitive #xpath: XPath, transitive closure logic, and nested tree walking automata (BtC, LS), pp. 251–260.
VLDB-2008-SilvastiSS: XML-document-filtering automaton (PS, SS, ESS), pp. 1666–1671.
ITiCSE-2008-Garcia-OsorioMJG #education #turing machine: Teaching push-down automata and turing machines (CGO, IMS, JJV, NGP), p. 316.
DLT-J-2007-Freivalds08 #finite #probability: Non-Constructive Methods for Finite Probabilistic Automata (RF), pp. 565–580.
DLT-J-2007-JirasekJS08 #finite #nondeterminism: Deterministic blow-UPS of Minimal Nondeterministic Finite Automata over a Fixed Alphabet (JJ, GJ, AS), pp. 617–631.
DLT-J-2007-Tamm08 #on the: On Transition Minimality of Bideterministic Automata (HT), pp. 677–690.
AFL-2008-Bartha #equivalence #simulation: Simulation equivalence of automata and circuits (MB), pp. 86–99.
AFL-2008-Cruz-ReyesK: Non-Linear Subband Coding with Cellular Automata (CCR, JK), pp. 146–157.
AFL-2008-GeffertBS: Hyper-Minimizing Minimized Deterministic Automata (VG, AB, IS), pp. 9–30.
AFL-2008-KaminskiZ #nondeterminism: Extending finite-memory automata with non-deterministic reassignment (MK, DZ), pp. 195–207.
AFL-2008-Kresz: Automata associated with open conjugated systems (MK), pp. 232–244.
AFL-2008-KutribMO #on the: On Stateless Two-Pushdown Automata and Restarting Automata (MK, HM, FO), pp. 257–268.
AFL-2008-Martyugin #commutative #complexity #problem #word: Complexity of problems concerning reset words for commutative automata and automata with simple idempotents (PVM), pp. 314–324.
AFL-2008-MasopustM #multi #on the: On Pure Multi-Pushdown Automata that Perform Complete-Pushdown Pops (TM, AM), pp. 325–336.
AFL-2008-Sakarovitch #transducer: The sequentialisation of automata and transducers (JS), pp. 56–57.
CIAA-2008-AbdullaBHKV #bisimulation: Composed Bisimulation for Tree Automata (PAA, AB, LH, LK, TV), pp. 212–222.
CIAA-2008-BouajjaniHHTV #finite #nondeterminism #testing: Antichain-Based Universality and Inclusion Testing over Nondeterministic Finite Tree Automata (AB, PH, LH, TT, TV), pp. 57–67.
CIAA-2008-CantinLW: Computing Convex Hulls by Automata Iteration (FC, AL, PW), pp. 112–121.
CIAA-2008-ChamparnaudDJ #geometry #regular expression #testing: Testing Whether a Binary and Prolongeable Regular Language LIs Geometrical or Not on the Minimal Deterministic Automaton of Pref(L) (JMC, JPD, HJ), pp. 68–77.
CIAA-2008-El-FakihY #equation: Progressive Solutions to FSM Equations (KEF, NY), pp. 274–282.
CIAA-2008-Fujiyoshi #context-free grammar: Combination of Context-Free Grammars and Tree Automata for Unranked and Ranked Trees (AF), pp. 283–285.
CIAA-2008-GarciaPAR #finite #learning #nondeterminism #regular expression #using: Learning Regular Languages Using Nondeterministic Finite Automata (PG, MVdP, GIA, JR), pp. 92–101.
CIAA-2008-MatsumotoHT #implementation #pattern matching #performance #runtime: A Run-Time Efficient Implementation of Compressed Pattern Matching Automata (TM, KH, MT), pp. 201–211.
CIAA-2008-Pighizzini: Deterministic Pushdown Automata and Unary Languages (GP), pp. 232–241.
CIAA-2008-Yannakakis #probability #recursion: Automata, Probability, and Recursion (MY), pp. 23–32.
DLT-2008-AllauzenMR #algorithm #ambiguity #finite #testing: General Algorithms for Testing the Ambiguity of Finite Automata (CA, MM, AR), pp. 108–120.
DLT-2008-AtigBH #multi: Emptiness of Multi-pushdown Automata Is 2ETIME-Complete (MFA, BB, PH), pp. 121–133.
DLT-2008-BordihnKM #capacity #communication #finite #on the #parallel: On the Computational Capacity of Parallel Communicating Finite Automata (HB, MK, AM), pp. 146–157.
DLT-2008-CarpiD #problem #transitive: The Synchronization Problem for Strongly Transitive Automata (AC, FD), pp. 240–251.
DLT-2008-DennunzioF #2d #decidability: Decidable Properties of 2D Cellular Automata (AD, EF), pp. 264–275.
DLT-2008-FiliotTT #constraints: Tree Automata with Global Constraints (EF, JMT, ST), pp. 314–326.
DLT-2008-GeffertMP #regular expression #representation: More Concise Representation of Regular Languages by Automata and Regular Expressions (VG, CM, BP), pp. 359–370.
DLT-2008-Glockler #taxonomy: A Taxonomy of Deterministic Forgetting Automata (JG), pp. 371–382.
DLT-2008-GruberH #finite #regular expression: Provably Shorter Regular Expressions from Deterministic Finite Automata (HG, MH), pp. 383–395.
DLT-2008-Hirvensalo #aspect-oriented #finite #quantum: Various Aspects of Finite Quantum Automata (MH), pp. 21–33.
DLT-2008-HromkovicS #bound #nondeterminism #on the #proving: On the Hardness of Determining Small NFA’s and of Proving Lower Bounds on Their Sizes (JH, GS), pp. 34–55.
DLT-2008-JiraskovaO #complexity #finite #on the: On the State Complexity of Operations on Two-Way Finite Automata (GJ, AO), pp. 443–454.
DLT-2008-KapoutsisKM #complexity #on the: On the Size Complexity of Rotating and Sweeping Automata (CAK, RK, TM), pp. 455–466.
DLT-2008-KuskeM #regular expression: Construction of Tree Automata from Regular Expressions (DK, IM), pp. 491–503.
ICALP-A-2008-KahlerW #ambiguity: Complementation, Disambiguation, and Determinization of Büchi Automata Unified (DK, TW), pp. 724–735.
ICALP-B-2008-BjorklundM #nondeterminism: The Tractability Frontier for NFA Minimization (HB, WM), pp. 27–38.
ICALP-B-2008-BoigelotBB #finite #multi #on the #set: On the Sets of Real Numbers Recognized by Finite Automata in Multiple Bases (BB, JB, VB), pp. 112–123.
ICALP-B-2008-ColcombetL #nondeterminism: The Non-deterministic Mostowski Hierarchy and Distance-Parity Automata (TC, CL), pp. 398–409.
ICALP-B-2008-GruberH #finite #regular expression: Finite Automata, Digraph Connectivity, and Regular Expression Size (HG, MH), pp. 39–50.
ICALP-B-2008-RaskinS #transducer: Visibly Pushdown Transducers (JFR, FS), pp. 386–397.
LATA-2008-AndersonRSS #finite: Finite Automata, Palindromes, Powers, and Patterns (TA, NR, NS, JS), pp. 52–63.
LATA-2008-ArrighiNW #bound #finite #quantum: One-Dimensional Quantum Cellular Automata over Finite, Unbounded Configurations (PA, VN, RFW), pp. 64–75.
LATA-2008-BenschBHK #finite: Deterministic Input-Reversal and Input-Revolving Finite Automata (SB, HB, MH, MK), pp. 113–124.
LATA-2008-Bojanczyk: Tree-Walking Automata (MB), pp. 1–2.
LATA-2008-Capobianco: Induced Subshifts and Cellular Automata (SC), pp. 160–171.
LATA-2008-CastiglioneRS #algorithm: Hopcroft’s Algorithm and Cyclic Automata (GC, AR, MS), pp. 172–183.
LATA-2008-ChampavereGLN #performance: Efficient Inclusion Checking for Deterministic Tree Automata and DTDs (JC, RG, AL, JN), pp. 184–195.
LATA-2008-Klunder #finite #using: Characterization of Star-Connected Languages Using Finite Automata (BK), pp. 311–320.
LATA-2008-Maletti: Minimizing Deterministic Weighted Tree Automata (AM), pp. 357–372.
LATA-2008-Mercer #bound #finite #quantum: Lower Bounds for Generalized Quantum Finite Automata (MM), pp. 373–384.
LATA-2008-RegnaultST #2d #analysis #on the #probability: On the Analysis of “Simple” 2D Stochastic Cellular Automata (DR, NS, ET), pp. 452–463.
LATA-2008-RenderK: Polycyclic and Bicyclic Valence Automata (ER, MK), pp. 464–475.
LATA-2008-Volkov: Synchronizing Automata and the Cerny Conjecture (MVV), pp. 11–27.
FM-2008-EmmiGP #interface #verification: Assume-Guarantee Verification for Interface Automata (ME, DG, CSP), pp. 116–131.
RTA-2008-HendrixO #equation: Combining Equational Tree Automata over AC and ACI Theories (JH, HO), pp. 142–156.
RTA-2008-KobayashiO: Tree Automata for Non-linear Arithmetic (NK, HO), pp. 291–305.
RTA-2008-KuhlmannN #logic #order: Logics and Automata for Totally Ordered Trees (MK, JN), pp. 217–231.
SFM-2008-Zavattaro #probability: A Gentle Introduction to Stochastic (Poly)Automata Collectives and the (Bio)Chemical Ground Form (GZ), pp. 507–523.
GT-VMT-2006-ManningP08: The York Abstract Machine (GM, DP), pp. 231–240.
GT-VMT-2008-KumarM #sequence chart #verification: Improving Live Sequence Chart to Automata Transformation for Verification (RK, EGM).
ICEIS-AIDSS-2008-ZimbresBO #evolution #modelling #network #social: Cellular Automata Based Modeling of the Formation and Evolution of Social Networks: A Case in Dentistry (RAZ, EPZB, PPBdO), pp. 333–339.
CIKM-2008-ThomoV #integration #xml: Rewriting of visibly pushdown languages for xml data integration (AT, SV), pp. 521–530.
ICPR-2008-KauffmannP #gpu: Cellular automaton for ultra-fast watershed transform on GPU (CK, NP), pp. 1–4.
SEKE-2008-FraserWW #testing #using: Using Observer Automata to Select Test Cases for Test Purposes (GF, MW, FW), pp. 709–714.
SEKE-2008-ParkK #bound #constraints #lts #model checking #using: Using Boolean Cardinality Constraint for LTS Bounded Model Checking (SP, GK), pp. 537–542.
PPDP-2008-MeraLCH #estimation #execution #towards: Towards execution time estimation in abstract machine-based languages (EM, PLG, MC, MVH), pp. 174–184.
PPDP-2008-MoralesCH #generative #using: Comparing tag scheme variations using an abstract machine generator (JFM, MC, MVH), pp. 32–43.
SAS-2008-Leroux: Convex Hull of Arithmetic Automata (JL), pp. 47–61.
DAC-2008-PiyachonL #design #finite #pattern matching #performance: Design of high performance pattern matching engine through compact deterministic finite automata (PP, YL), pp. 852–857.
FoSSaCS-2008-BaierBG #on the #probability #problem: On Decision Problems for Probabilistic Büchi Automata (CB, NB, MG), pp. 287–301.
FoSSaCS-2008-BonsangueRS #algebra #logic #synthesis: Coalgebraic Logic and Synthesis of Mealy Machines (MMB, JJMMR, AS), pp. 231–245.
FoSSaCS-2008-BouyerMR #analysis #robust: Robust Analysis of Timed Automata via Channel Machines (PB, NM, PAR), pp. 157–171.
FoSSaCS-2008-DemriLS #ltl #model checking: Model Checking Freeze LTL over One-Counter Automata (SD, RL, AS), pp. 490–504.
FoSSaCS-2008-DrosteQ #theorem: A Kleene-Schützenberger Theorem for Weighted Timed Automata (MD, KQ), pp. 142–156.
TACAS-2008-AbdullaBHKV #simulation: Computing Simulations over Tree Automata (PAA, AB, LH, LK, TV), pp. 93–108.
TACAS-2008-TsayCTCL #logic #research #towards: GOAL Extended: Towards a Research Tool for ω Automata and Temporal Logic (YKT, YFC, MHT, WCC, CJL), pp. 346–350.
CAV-2008-AlurKW #game studies #ranking #requirements: Ranking Automata and Games for Prioritized Requirements (RA, AK, GW), pp. 240–253.
CSL-2008-Cardelli: Molecules as Automata (LC), p. 32.
CSL-2008-Eisinger #bound #integer #linear: Upper Bounds on the Automata Size for Integer and Mixed Real and Integer Linear Arithmetic (JE), pp. 431–445.
CSL-2008-TorreMP #exponential #infinity: An Infinite Automaton Characterization of Double Exponential Time (SLT, PM, GP), pp. 33–48.
IJCAR-2008-BouhoulaJ #automation #induction: Automated Induction with Constrained Tree Automata (AB, FJ), pp. 539–554.
IJCAR-2008-BoyerGJ: Certifying a Tree Automata Completion Checker (BB, TG, TPJ), pp. 523–538.
LICS-2008-BaierBBBG #infinity #model checking: Almost-Sure Model Checking of Infinite Paths in One-Clock Timed Automata (CB, NB, PB, TB, MG), pp. 217–226.
LICS-2008-CarayolHMOS #game studies #higher-order: Winning Regions of Higher-Order Pushdown Games (AC, MH, AM, CHLO, OS), pp. 193–204.
LICS-2008-HagueMOS #recursion: Collapsible Pushdown Automata and Recursion Schemes (MH, ASM, CHLO, OS), pp. 452–461.
TestCom-FATES-2008-BochmannHJJ #partial order #testing: Testing Systems Specified as Partial Order Input/Output Automata (GvB, SH, CJ, GVJ), pp. 169–183.
VMCAI-2008-KupfermanL #game studies #logic #multi #simulation: Multi-valued Logics, Automata, Simulations, and Games (OK, YL), p. 5.
VMCAI-2008-MorgensternS #ltl: From LTL to Symbolically Represented Deterministic Automata (AM, KS), pp. 279–293.
ITiCSE-2007-RodgerLR #formal method #interactive: Increasing interaction and support in the formal languages and automata theory course (SHR, JL, SR), pp. 58–62.
ITiCSE-2007-StallmannBRBGH #correctness #named #proving: ProofChecker: an accessible environment for automata theory correctness proofs (MFS, SB, RDR, SB, MCG, SDH), pp. 48–52.
CIAA-J-2006-AbdullaHK07 #bisimulation: Bisimulation Minimization of Tree Automata (PAA, JH, LK), pp. 699–713.
CIAA-J-2006-BloemCPR07 #implementation: Symbolic Implementation of Alternating Automata (RB, AC, IP, MR), pp. 727–743.
CIAA-J-2006-BordihnHK07 #finite #hybrid: Hybrid Extended Finite Automata (HB, MH, MK), pp. 745–760.
CIAA-J-2006-CortesMR07 #distance #equivalence #probability: LP Distance and Equivalence of Probabilistic Automata (CC, MM, AR), pp. 761–779.
CIAA-J-2006-GiraudVL07: Path-Equivalent Developments in Acyclic Weighted Automata (MG, PV, DL), pp. 799–811.
CIAA-J-2006-Glockler07: Forgetting Automata and Unary Languages (JG), pp. 813–827.
CIAA-J-2006-NicartCCGK07 #multi: Labelling Multi-Tape Automata with Constrained Symbol Classes (FN, JMC, TC, TG, AK), pp. 847–858.
CIAA-J-2006-SimunekM07 #finite: Borders and Finite Automata (MS, BM), pp. 859–871.
CIAA-2007-AnselmoGM #2d: Tiling Automaton: A Computational Model for Recognizable Two-Dimensional Languages (MA, DG, MM), pp. 290–302.
CIAA-2007-BassinoDN #library: : A Library to Randomly and Exhaustively Generate Automata (FB, JD, CN), pp. 303–305.
CIAA-2007-CarrascoDF #implementation: An Implementation of Deterministic Tree Automata Minimization (RCC, JD, MLF), pp. 122–129.
CIAA-2007-CrochemoreEGM #on the: On the Suffix Automaton with Mismatches (MC, CE, AG, FM), pp. 144–156.
CIAA-2007-DrosteR #logic: Weighted Automata and Weighted Logics with Discounting (MD, GR), pp. 73–84.
CIAA-2007-HogbergMM #bisimulation: Backward and Forward Bisimulation Minimisation of Tree Automata (JH, AM, JM), pp. 109–121.
CIAA-2007-JonoskaP #2d #finite #representation: Finite State Automata Representing Two-Dimensional Subshifts (NJ, JBP), pp. 277–289.
CIAA-2007-KleinB #on the fly: On-the-Fly Stuttering in the Construction of Deterministic ω-Automata (JK, CB), pp. 51–61.
CIAA-2007-Klunder #finite: Finite Automata Accepting Star-Connected Languages (BK), pp. 312–313.
CIAA-2007-KucherovNR #set: Subset Seed Automaton (GK, LN, MAR), pp. 180–191.
CIAA-2007-KutribMW #nondeterminism: Regulated Nondeterminism in Pushdown Automata (MK, AM, LW), pp. 85–96.
CIAA-2007-MohriMW: Factor Automata of Automata and Applications (MM, PJM, EW), pp. 168–179.
CIAA-2007-Vardi #linear #model checking: Linear-Time Model Checking: Automata Theory in Practice (MYV), pp. 5–10.
CIAA-2007-Volkov #partial order: Synchronizing Automata Preserving a Chain of Partial Orders (MVV), pp. 27–37.
CIAA-2007-Watson: Automata Applications in Chip-Design Software (BWW), pp. 24–26.
DLT-2007-BelovsRS #finite #multi #quantum: Multi-letter Reversible and Quantum Finite Automata (AB, AR, JS), pp. 60–71.
DLT-2007-BienvenuS #invariant: The Dynamics of Cellular Automata in Shift-Invariant Topologies (LB, MS), pp. 84–95.
DLT-2007-BordihnHK #finite: Hairpin Finite Automata (HB, MH, MK), pp. 108–119.
DLT-2007-CarotenutoMP: 2-Visibly Pushdown Automata (DC, AM, AP), pp. 132–144.
DLT-2007-Freivalds #finite #probability: Non-constructive Methods for Finite Probabilistic Automata (RF), pp. 169–180.
DLT-2007-HogbergMM #bisimulation: Bisimulation Minimisation for Weighted Tree Automata (JH, AM, JM), pp. 229–241.
DLT-2007-JirasekJS #finite #nondeterminism: Deterministic Blow-Ups of Minimal Nondeterministic Finite Automata over a Fixed Alphabet (JJ, GJ, AS), pp. 254–265.
DLT-2007-Priese #finite #graph: Finite Automata on Unranked and Unordered DAGs (LP), pp. 346–360.
DLT-2007-Sakarovitch #finite: Finite Automata and the Writing of Numbers (JS), pp. 29–30.
DLT-2007-Salomaa #complexity #finite #nondeterminism: Descriptional Complexity of Nondeterministic Finite Automata (KS), pp. 31–35.
DLT-2007-SciortinoZ #standard #word: Suffix Automata and Standard Sturmian Words (MS, LQZ), pp. 382–398.
DLT-2007-Tamm #on the: On Transition Minimality of Bideterministic Automata (HT), pp. 411–421.
ICALP-2007-ArenasBL #fixpoint #regular expression #word: Regular Languages of Nested Words: Fixed Points, Automata, and Synchronization (MA, PB, LL), pp. 888–900.
ICALP-2007-BoigelotB #theorem: A Generalization of Cobham’s Theorem to Automata over Real Numbers (BB, JB), pp. 813–824.
ICALP-2007-BozzelliT #bound #parametricity #problem: Decision Problems for Lower/Upper Bound Parametric Timed Automata (LB, SLT), pp. 925–936.
ICALP-2007-JurdzinskiT #game studies: Reachability-Time Games on Timed Automata (MJ, AT), pp. 838–849.
ICALP-2007-KariantoL: Unranked Tree Automata with Sibling Equalities and Disequalities (KW, CL), pp. 875–887.
LATA-2007-BaaderHP #exclamation #logic: SI! Automata Can Show PSPACE Results for Description Logics (FB, JH, RP), pp. 67–78.
LATA-2007-BolligK #logic #message passing: Muller Message-Passing Automata and Logics (BB, DK), pp. 163–174.
LATA-2007-DinuGM #on the #word: On the syllabification of words via go-through automata (LPD, RG, FM), pp. 223–236.
LATA-2007-Domosi #network: Automata Networks without any Letichevsky Criteria (PD), pp. 237–248.
LATA-2007-FrancezK: Pushdown automata with cancellation and commutation-augmented pregroups grammars (NF, MK), pp. 7–26.
LATA-2007-GruberH #complexity #finite #nondeterminism: Computational Complexity of NFA Minimization for Finite and Unary Languages (HG, MH), pp. 261–272.
LATA-2007-Kresz #nondeterminism: Nondeterministic soliton automata with a single external vertex (MK), pp. 319–330.
LATA-2007-KutribM #performance #recognition #using: Fast Reversible Language Recognition Using Cellular Automata (MK, AM), pp. 331–342.
LATA-2007-KutribR #regular expression: Succinct Description of Regular Languages by Weak Restarting Automata (MK, JR), pp. 343–354.
LATA-2007-LenaM #complexity: Computational Complexity of Dynamical Systems: the case of Cellular Automata (PdL, LM), pp. 211–222.
LATA-2007-Martugin: A series of slowly synchronizable automata with a zero state over a small alphabet (PVM), pp. 391–402.
LATA-2007-MesserschmidtO #nondeterminism #on the: On Determinism Versus Non-Determinism for Restarting Automata (HM, FO), pp. 413–424.
LATA-2007-MrazOP: Free Word-Order and Restarting Automata (FM, FO, MP), pp. 425–436.
IFM-2007-SalaunKLM #network: Translating FSP into LOTOS and Networks of Automata (GS, JK, FL, JM), pp. 558–578.
AGTIVE-2007-BoddenV #monitoring #runtime #specification #timeline: Transforming Timeline Specifications into Automata for Runtime Monitoring (EB, HV), pp. 249–264.
POPL-2007-KahlonG #analysis #on the: On the analysis of interacting pushdown systems (VK, AG), pp. 303–314.
SAS-2007-GallJ #infinity #representation #verification: Lattice Automata: A Representation for Languages on Infinite Alphabets, and Some Applications to Verification (TLG, BJ), pp. 52–68.
SAC-2007-MengA #constraints #distributed #web #web service: Web services choreography and orchestration in Reo and constraint automata (SM, FA), pp. 346–353.
ESOP-2007-LarsenNW #interface #product line: Modal I/O Automata for Interface and Product Line Theories (KGL, UN, AW), pp. 64–79.
FoSSaCS-2007-AbdullaKY: Sampled Universality of Timed Automata (PAA, PK, WY), pp. 2–16.
FoSSaCS-2007-BouyerLM #model checking: Model-Checking One-Clock Priced Timed Automata (PB, KGL, NM), pp. 108–122.
FoSSaCS-2007-Comon-LundhJP #constraints #memory management: Tree Automata with Memory, Visibility and Structural Constraints (HCL, FJ, NP), pp. 168–182.
FoSSaCS-2007-HagueO #analysis #higher-order: Symbolic Backwards-Reachability Analysis for Higher-Order Pushdown Systems (MH, CHLO), pp. 213–227.
TACAS-2007-DAprileDSS #approach #petri net: From Time Petri Nets to Timed Automata: An Untimed Approach (DD, SD, AS, JS), pp. 216–230.
TACAS-2007-JurdzinskiLS #model checking #probability: Model Checking Probabilistic Timed Automata with One or Two Clocks (MJ, FL, JS), pp. 170–184.
TACAS-2007-TsayCTWC #named #visual notation: GOAL: A Graphical Tool for Manipulating Büchi Automata and Temporal Formulae (YKT, YFC, MHT, KNW, WCC), pp. 466–471.
CADE-2007-Stirling #game studies: Games, Automata and Matching (CS), pp. 1–2.
CAV-2007-Segelken #abstraction #hybrid #linear #model checking #modelling: Abstraction and Counterexample-Guided Construction of ω-Automata for Model Checking of Step-Discrete Linear Hybrid Models (MS), pp. 433–448.
CSL-2007-Dawar #first-order #locality #logic #model checking: Model-Checking First-Order Logic: Automata and Locality (AD), p. 6.
CSL-2007-Kupferman: Tightening the Exchange Rates Between Automata (OK), pp. 7–22.
LICS-2007-Stirling #game studies #higher-order: Higher-Order Matching, Games and Automata (CS), pp. 326–335.
TestCom-FATES-2007-HaarJJ #partial order #testing: Testing Input/Output Partial Order Automata (SH, CJ, GVJ), pp. 171–185.
VMCAI-2007-KupfermanL: Lattice Automata (OK, YL), pp. 199–213.
ITiCSE-2006-Bozic #algorithm #finite #modelling: Application of finite state automata to the bakery algorithm in critical section modeling (VB), p. 362.
ITiCSE-2006-HielscherW #education #formal method #learning #named: AtoCC: learning environment for teaching theory of automata and formal languages (MH, CW), p. 306.
ITiCSE-2006-Rodger #formal method #learning: Learning automata and formal languages interactively with JFLAP (SHR), p. 360.
ITiCSE-2006-SchreyerW #finite #modelling #problem: Finite automata models for CS problem with binary semaphore (BS, WW), p. 330.
CIAA-2006-AbdullaKH #bisimulation: Bisimulation Minimization of Tree Automata (PAA, LK, JH), pp. 173–185.
CIAA-2006-AntoniouHIMP #finite #using: Finding Common Motifs with Gaps Using Finite Automata (PA, JH, CSI, BM, PP), pp. 69–77.
CIAA-2006-BloemCPRS #implementation: Symbolic Implementation of Alternating Automata (RB, AC, IP, MR, SS), pp. 208–218.
CIAA-2006-BonfanteRP #ambiguity: Lexical Disambiguation with Polarities and Automata (GB, JLR, GP), pp. 283–284.
CIAA-2006-BordihnHK #finite #hybrid: Hybrid Extended Finite Automata (HB, MH, MK), pp. 34–45.
CIAA-2006-ConstantM #compilation #constraints #finite: Compiling Linguistic Constraints into Finite State Automata (MC, DM), pp. 242–252.
CIAA-2006-CortesMR #on the #probability #standard: On the Computation of Some Standard Distances Between Probabilistic Automata (CC, MM, AR), pp. 137–149.
CIAA-2006-GiraudVL #finite: Path-Equivalent Removals of epsilon-transitions in a Genomic Weighted Finite Automaton (MG, PV, DL), pp. 23–33.
CIAA-2006-Glockler: Forgetting Automata and Unary Languages (JG), pp. 186–197.
CIAA-2006-Hyyro #approximate #nondeterminism #string: Tighter Packed Bit-Parallel NFA for Approximate String Matching (HH), pp. 287–289.
CIAA-2006-Leung #ambiguity #finite: Structurally Unambiguous Finite Automata (HL), pp. 198–207.
CIAA-2006-MayK #named #tool support: Tiburon: A Weighted Tree Automata Toolkit (JM, KK), pp. 102–113.
CIAA-2006-NicartCCGK #multi: Multi-tape Automata with Symbol Classes (FN, JMC, TC, TG, AK), pp. 126–136.
CIAA-2006-SimunekM #finite: Borders and Finite Automata (MS, BM), pp. 58–68.
CIAA-2006-Thurston #parsing #regular expression: Parsing Computer Languages with an Automaton Compiled from a Single Regular Expression (ADT), pp. 285–286.
CIAA-2006-Tischler #finite #random #refinement #video: Refinement of Near Random Access Video Coding with Weighted Finite Automata (GT), pp. 46–57.
DLT-2006-AnanichevVZ: Synchronizing Automata with a Letter of Deficiency 2 (DSA, MVV, YIZ), pp. 433–442.
DLT-2006-Caucal: Synchronization of Pushdown Automata (DC), pp. 120–132.
DLT-2006-DrosteR #infinity #logic #word: Weighted Automata and Weighted Logics on Infinite Words (MD, GR), pp. 49–58.
DLT-2006-FritzW #game studies #simulation: Simulation Relations for Alternating Parity Automata and Parity Games (CF, TW), pp. 59–70.
DLT-2006-KutribM #nondeterminism: Context-Dependent Nondeterminism for Pushdown Automata (MK, AM), pp. 133–144.
DLT-2006-Ravikumar #finite #modelling #on the #probability: On Some Variations of Two-Way Probabilistic Finite Automata Models (BR), pp. 443–454.
ICALP-v1-2006-BojanczykSSS #power of: Expressive Power of Pebble Automata (MB, MS, TS, LS), pp. 157–168.
ICALP-v1-2006-NearyW: P-completeness of Cellular Automaton Rule 110 (TN, DW), pp. 132–143.
ICALP-v2-2006-BouyerHR #petri net #power of #sequence: Timed Petri Nets and Timed Automata: On the Discriminating Power of Zeno Sequences (PB, SH, PAR), pp. 420–431.
ICALP-v2-2006-BozgaIL #parametricity: Flat Parametric Counter Automata (MB, RI, YL), pp. 577–588.
ICALP-v2-2006-GenestM: Constructing Exponential-Size Deterministic Zielonka Automata (BG, AM), pp. 565–576.
ICALP-v2-2006-Yan #bound: Lower Bounds for Complementation of ω-Automata Via the Full Automata Technique (QY), pp. 589–600.
FM-2006-LarsenNW #interface: Interface Input/Output Automata (KGL, UN, AW), pp. 82–97.
FM-2006-UmenoL #case study #protocol #proving #safety #theorem proving #using: Proving Safety Properties of an Aircraft Landing Protocol Using I/O Automata and the PVS Theorem Prover: A Case Study (SU, NAL), pp. 64–80.
RTA-2006-HendrixOV: Propositional Tree Automata (JH, HO, MV), pp. 50–65.
SEFM-2006-Lodaya #algebra #process: Product Automata and Process Algebra (KL), pp. 128–136.
ICGT-2006-BerwangerJ #graph: Automata on Directed Graphs: Edge Versus Vertex Marking (DB, DJ), pp. 46–60.
LOPSTR-2006-MoralesCH #optimisation #prolog #towards: Towards Description and Optimization of Abstract Machines in an Extension of Prolog (JFM, MC, MVH), pp. 77–93.
PLDI-2006-ErtlCG #flexibility #on-demand #performance: Fast and flexible instruction selection with on-demand tree-parsing automata (MAE, KC, DG), pp. 52–60.
SAC-2006-NasrBFI #specification #verification: Verification of a scheduler in B through a timed automata specification (ON, JPB, MF, MRI), pp. 1800–1801.
DATE-2006-GuptaJL #generative #quantum #testing: Test generation for combinational quantum cellular automata (QCA) circuits (PG, NKJ, LL), pp. 311–316.
FASE-2006-RaffeltS #learning #library #named: LearnLib: A Library for Automata Learning and Experimentation (HR, BS), pp. 377–380.
FoSSaCS-2006-EdalatP #hybrid #semantics: Denotational Semantics of Hybrid Automata (AE, DP), pp. 231–245.
TACAS-2006-EsparzaKS #abstraction #refinement: Abstraction Refinement with Craig Interpolation and Symbolic Pushdown Systems (JE, SK, SS), pp. 489–503.
TACAS-2006-JhaSWR #trust: Weighted Pushdown Systems and Trust-Management Systems (SJ, SS, HW, TWR), pp. 1–26.
CAV-2006-BouajjaniBHIMV #source code: Programs with Lists Are Counter Automata (AB, MB, PH, RI, PM, TV), pp. 517–531.
CAV-2006-HeljankoJKLL #bound #model checking: Bounded Model Checking for Weak Alternating Büchi Automata (KH, TAJ, MK, ML, TL), pp. 95–108.
CAV-2006-JuvekarP: Minimizing Generalized Büchi Automata (SJ, NP), pp. 45–58.
CAV-2006-KrcalY #communication #verification: Communicating Timed Automata: The More Synchronous, the More Difficult to Verify (PK, WY), pp. 249–262.
CAV-2006-LalR #model checking: Improving Pushdown System Model Checking (AL, TWR), pp. 343–357.
CAV-2006-WulfDHR #algorithm #anti #finite #named: Antichains: A New Algorithm for Checking Universality of Finite Automata (MDW, LD, TAH, JFR), pp. 17–30.
CSL-2006-Aehlig #finite #infinity #semantics: A Finite Semantics of Simply-Typed λ Terms for Infinite Runs of Automata (KA), pp. 104–118.
CSL-2006-Segoufin #infinity #logic #word: Automata and Logics for Words and Trees over an Infinite Alphabet (LS), pp. 41–57.
CSL-2006-Srba #bisimulation #equivalence #simulation: Visibly Pushdown Automata: From Language Equivalence to Simulation and Bisimulation (JS), pp. 89–103.
IJCAR-2006-JacquemardRV #constraints #equation #similarity: Tree Automata with Equality Constraints Modulo Equational Theories (FJ, MR, LV), pp. 557–571.
LICS-2006-DemriL #ltl #quantifier: LTL with the Freeze Quantifier and Register Automata (SD, RL), pp. 17–26.
LICS-2006-KuskeL #logic #monad: Monadic Chain Logic Over Iterations and Applications to Pushdown Systems (DK, ML), pp. 91–100.
LICS-2006-Piterman #nondeterminism: From Nondeterministic Buchi and Streett Automata to Deterministic Parity Automata (NP), pp. 255–264.
TestCom-2006-El-FakihPY: FSM Test Translation Through Context (KEF, AP, NY), pp. 245–258.
VMCAI-2006-Bozzelli #complexity #model checking: Complexity Results on Branching-Time Pushdown Model Checking (LB), pp. 65–79.
VMCAI-2006-HristovaL #algorithm #linear #logic #model checking: Improved Algorithm Complexities for Linear Temporal Logic Model Checking of Pushdown Systems (KH, YAL), pp. 190–206.
ITiCSE-2005-Gal-EzerT #challenge #education: Challenges in teaching the pumping lemma in automata theory course (JGE, MBT), p. 369.
ITiCSE-2005-Verma #interactive #visual notation: A visual and interactive automata theory course emphasizing breadth of automata (RMV), pp. 325–329.
ITiCSE-2005-WermelingerD #formal method #prolog #tool support: A prolog toolkit for formal languages and automata (MW, AMD), pp. 330–334.
CIAA-J-2004-GeserHWZ05 #finite #string #term rewriting #termination: Finding finite automata that certify termination of string rewriting systems (AG, DH, JW, HZ), pp. 471–486.
CIAA-J-2004-HanMZ05 #approach #database #sequence: An automata approach to match gapped sequence tags against protein database (YH, BM, KZ), pp. 487–497.
CIAA-J-2004-HanW05: The generalization of generalized automata: expression automata (YSH, DW), pp. 499–510.
DLT-J-2004-Maletti05 #transducer: Relating tree series transducers and weighted tree automata (AM), pp. 723–741.
CIAA-2005-AbdullaDKN #nondeterminism #scalability: Minimization of Non-deterministic Automata with Large Alphabets (PAA, JD, LK, MN), pp. 31–42.
CIAA-2005-AlthoffTW: Observations on Determinization of Büchi Automata (CSA, WT, NW), pp. 262–272.
CIAA-2005-AnselmoM #2d #queue #simulation: Simulating Two-Dimensional Recognizability by Pushdown and Queue Automata (MA, MM), pp. 43–53.
CIAA-2005-CampeanuPS #algorithm #finite #incremental: An Incremental Algorithm for Constructing Minimal Deterministic Finite Cover Automata (CC, AP, JRS), pp. 90–103.
CIAA-2005-CanoG #bound #constant #finite: Finite Automata and Unions of Regular Patterns with Bounded Constant Segments (AC, PG), pp. 104–115.
CIAA-2005-DaciukMS #incremental #pseudo: Incremental and Semi-incremental Construction of Pseudo-Minimal Automata (JD, DM, AS), pp. 341–342.
CIAA-2005-Freivalds #finite #quantum: Languages Recognizable by Quantum Finite Automata (RF), pp. 1–14.
CIAA-2005-FujiyoshiK #linear #recognition: Deterministic Recognition of Trees Accepted by a Linear Pushdown Tree Automaton (AF, IK), pp. 129–140.
CIAA-2005-HanW #finite #regular expression: Shorter Regular Expressions from Finite-State Automata (YSH, DW), pp. 141–152.
CIAA-2005-HigueraPT #finite #learning #probability #recognition: Learning Stochastic Finite Automata for Musical Style Recognition (CdlH, FP, FT), pp. 345–346.
CIAA-2005-JurdzinskiO #strict #using: Restricting the Use of Auxiliary Symbols for Restarting Automata (TJ, FO), pp. 176–187.
CIAA-2005-KleinB #linear #logic: Experiments with Deterministic ω-Automata for Formulas of Linear Temporal Logic (JK, CB), pp. 199–212.
CIAA-2005-LohreyM #xpath: Tree Automata and XPath on Compressed Trees (ML, SM), pp. 225–237.
CIAA-2005-MoraisMR #regular expression: Acyclic Automata with Easy-to-Find Short Regular Expressions (JJM, NM, RR), pp. 349–350.
CIAA-2005-PelanekS #ltl: Deeper Connections Between LTL and Alternating Automata (RP, JS), pp. 238–249.
CIAA-2005-Sakarovitch: The Language, the Expression, and the (Small) Automaton (JS), pp. 15–30.
CIAA-2005-Shcherbak #rank: The Interval Rank of Monotonic Automata (TS), pp. 273–281.
CIAA-2005-SubramanianS #documentation #finite #recursion #using #xml: Compressing XML Documents Using Recursive Finite State Automata (HS, PS), pp. 282–293.
CIAA-2005-SudaH #algorithm #backtracking #top-down: Non-backtracking Top-Down Algorithm for Checking Tree Automata Containment (TS, HH), pp. 294–306.
CIAA-2005-TammNU #multi #reduction: Size Reduction of Multitape Automata (HT, MN, EU), pp. 307–318.
CIAA-2005-Tellier: Automata and AB-Categorial Grammars (IT), pp. 353–355.
CIAA-2005-ZdarekM #2d #finite #on the #pattern matching: On Two-Dimensional Pattern Matching by Finite Automata (JZ, BM), pp. 329–340.
DLT-2005-AblayevG #complexity #quantum: Complexity of Quantum Uniform and Nonuniform Automata (FMA, AG), pp. 78–87.
DLT-2005-Ananichev: The Mortality Threshold for Partially Monotonic Automata (DSA), pp. 112–121.
DLT-2005-BordihnHK #finite: Revolving-Input Finite Automata (HB, MH, MK), pp. 168–179.
DLT-2005-GeffertMP #finite: Complementing Two-Way Finite Automata (VG, CM, GP), pp. 260–271.
DLT-2005-GruberHKK #on the: On Timed Automata with Discrete Time — Structural and Language Theoretical Characterization (HG, MH, AK, BK), pp. 272–283.
DLT-2005-Kari: Reversible Cellular Automata (JK), pp. 57–68.
DLT-2005-Karianto #graph: Adding Monotonic Counters to Automata and Transition Graphs (KW), pp. 308–319.
ICALP-2005-AbdullaDOW #complexity #decidability: Decidability and Complexity Results for Timed Automata via Channel Machines (PAA, JD, JO, JW), pp. 1089–1101.
ICALP-2005-AlurKMV: Congruences for Visibly Pushdown Languages (RA, VK, PM, MV), pp. 1102–1114.
ICALP-2005-CohenFIKP #finite #graph: Label-Guided Graph Exploration by a Finite Automaton (RC, PF, DI, AK, DP), pp. 335–346.
ICALP-2005-CzeizlerK #bound #linear: A Tight Linear Bound on the Neighborhood of Inverse Cellular Automata (EC, JK), pp. 410–420.
ICALP-2005-DrosteG #logic: Weighted Automata and Weighted Logics (MD, PG), pp. 513–525.
ICALP-2005-KnapikNUW: Unsafe Grammars and Panic Automata (TK, DN, PU, IW), pp. 1450–1461.
RTA-2005-BonevaT #logic: Automata and Logics for Unranked and Unordered Trees (IB, JMT), pp. 500–515.
RTA-2005-GeserHWZ #linear #on the #term rewriting #termination: On Tree Automata that Certify Termination of Left-Linear Term Rewriting Systems (AG, DH, JW, HZ), pp. 353–367.
SEFM-2005-GebremichaelV #specification: Specifying Urgency in Timed I/O Automata (BG, FWV), pp. 64–74.
SEFM-2005-LanotteMT #analysis #data type #design #distributed: Timed Automata with Data Structures for Distributed Systems Design and Analysis (RL, AMS, AT), pp. 44–53.
SEFM-2005-WandelerJLT #interface #modelling #static analysis: Counting Interface Automata and their Application in Static Analysis of Actor Models (EW, JWJ, EAL, LT), pp. 106–116.
SFM-2005-MontanariP: History-Dependent Automata: An Introduction (UM, MP), pp. 1–28.
LOPSTR-2005-Fages #constraints #logic: Temporal Logic Constraints in the Biochemical Abstract Machine BIOCHAM (FF), pp. 1–5.
FoSSaCS-2005-BouyerCD #fault #using: Fault Diagnosis Using Timed Automata (PB, FC, DD), pp. 219–233.
FoSSaCS-2005-Fahrenberg: A Category of Higher-Dimensional Automata (UF), pp. 187–201.
FoSSaCS-2005-LarsenR #multi #reachability: Optimal Conditional Reachability for Multi-priced Timed Automata (KGL, JIR), pp. 234–249.
FoSSaCS-2005-LasotaW: Alternating Timed Automata (SL, IW), pp. 250–265.
STOC-2005-BojanczykC #regular expression: Tree-walking automata do not recognize all regular languages (MB, TC), pp. 234–243.
TACAS-2005-KupfermanV #infinity #nondeterminism #word: Complementation Constructions for Nondeterministic Automata on Infinite Words (OK, MYV), pp. 206–221.
CAV-2005-LalRB: Extended Weighted Pushdown Systems (AL, TWR, GB), pp. 434–448.
FATES-2005-PetrenkoY #consistency #nondeterminism #testing: Conformance Tests as Checking Experiments for Partial Nondeterministic FSM (AP, NY), pp. 118–133.
ICLP-2005-MoralesCPH #generative #implementation #performance: A Generator of Efficient Abstract Machine Implementations and Its Application to Emulator Minimization (JFM, MC, GP, MVH), pp. 21–36.
LICS-2005-BaierG #probability #regular expression: Recognizing ω-regular Languages with Probabilistic Automata (CB, MG), pp. 137–146.
LICS-2005-EsparzaKM #analysis #probability: Quantitative Analysis of Probabilistic Pushdown Automata: Expectations and Variances (JE, AK, RM), pp. 117–126.
LICS-2005-KupkeV #algebra: Closure Properties of Coalgebra Automata (CK, YV), pp. 199–208.
TestCom-2005-KrichenT #identification #problem: State Identification Problems for Timed Automata (MK, ST), pp. 175–191.
VMCAI-2005-DamsN #abstraction: Automata as Abstractions (DD, KSN), pp. 216–232.
VMCAI-2005-Lange #calculus #linear: Weak Automata for the Linear Time µ-Calculus (ML), pp. 267–281.
PODS-2004-Schwentick #xml: Trees, Automata and XML (TS), p. 222.
ITiCSE-2004-ChesnevarGM #formal method #learning: Didactic strategies for promoting significant learning in formal languages and automata theory (CIC, MPG, AGM), pp. 7–11.
ITiCSE-2004-HamadaS #education #empirical: A classroom experiment for teaching automata (MH, KS), p. 261.
CIAA-2004-CampeanuP #bound #nondeterminism: Tight Bounds for NFA to DFCA Transformations for Binary Alphabets (CC, AP), pp. 306–307.
CIAA-2004-ChamparnaudNZ: Computing the Follow Automaton of an Expression (JMC, FN, DZ), pp. 90–101.
CIAA-2004-Couvreur #implementation: A BDD-Like Implementation of an Automata Package (JMC), pp. 310–311.
CIAA-2004-Egri-NagyN #algebra #comparison #composition #finite #implementation: Algebraic Hierarchical Decomposition of Finite State Automata: Comparison of Implementations for Krohn-Rhodes Theory (AEN, CLN), pp. 315–316.
CIAA-2004-FrishertCW #finite #regular expression: FIRE Station: An Environment for Manipulating Finite Automata and Regular Expression Views (MF, LGC, BWW), pp. 125–133.
CIAA-2004-FrishertW #regular expression: Combining Regular Expressions with (Near-)Optimal Brzozowski Automata (MF, BWW), pp. 319–320.
CIAA-2004-GeserHWZ #finite #string #termination: Finding Finite Automata That Certify Termination of String Rewriting (AG, DH, JW, HZ), pp. 134–145.
CIAA-2004-GiraudL #encoding #finite #linear: Linear Encoding Scheme for Weighted Finite Automata (MG, DL), pp. 146–155.
CIAA-2004-HanMZ #approach #database #sequence: An Automata Approach to Match Gapped Sequence Tags Against Protein Database (YH, BM, KZ), pp. 167–177.
CIAA-2004-HanW: The Generalization of Generalized Automata: Expression Automata (YSH, DW), pp. 156–166.
CIAA-2004-Lugiez #linear #logic #set: From Automata to Semilinear Sets: A Logical Solution for Sets L(C, P) (DL), pp. 321–322.
CIAA-2004-NishimuraY #finite #interactive #proving #quantum: An Application of Quantum Finite Automata to Interactive Proof Systems (HN, TY), pp. 225–236.
CIAA-2004-Polak #nondeterminism #using: Minimalizations of NFA Using the Universal Automaton (LP), pp. 325–326.
CIAA-2004-PolcarM #2d #online #pattern matching: Two-Dimensional Pattern Matching by Two-Dimensional Online Tessellation Automata (TP, BM), pp. 327–328.
CIAA-2004-TammNU #multi #reduction: Size Reduction of Multitape Automata (HT, MN, EU), pp. 329–330.
CIAA-2004-Tischler #finite #parametricity: Parametric Weighted Finite Automata for Figure Drawing (GT), pp. 259–268.
CIAA-2004-XieLD #testing: Testability of Oracle Automata (GX, CL, ZD), pp. 331–332.
CIAA-2004-ZakharovZ #multi #on the #problem #source code: On the Equivalence-Checking Problem for a Model of Programs Related with Multi-tape Automata (VAZ, IZ), pp. 293–305.
DLT-2004-BordihnHK #geometry: Input Reversals and Iterated Pushdown Automata: A New Characterization of Khabbaz Geometric Hierarchy of Languages (HB, MH, MK), pp. 102–113.
DLT-2004-GenestMK #algorithm #communication #effectiveness #theorem: A Kleene Theorem for a Class of Communicating Automata with Effective Algorithms (BG, AM, DK), pp. 30–48.
DLT-2004-JurdzinskiOMP #complexity #on the: On the Complexity of 2-Monotone Restarting Automata (TJ, FO, FM, MP), pp. 237–248.
DLT-2004-JurdzinskiOMP04a #on the: On Left-Monotone Deterministic Restarting Automata (TJ, FO, FM, MP), pp. 249–260.
DLT-2004-KurganskyyP #2d #finite #on the #power of: On the Computation Power of Finite Automata in Two-dimensional Environments (OK, IP), pp. 261–271.
DLT-2004-KuskeW: The Role of the Complementarity Relation in Watson-Crick Automata and Sticker Systems (DK, PW), pp. 272–283.
DLT-2004-Maletti #transducer: Relating Tree Series Transducers and Weighted Tree Automata (AM), pp. 321–333.
DLT-2004-Potapov #matrix #multi #problem #reachability: From Post Systems to the Reachability Problems for Matrix Semigroups and Multicounter Automata (IP), pp. 345–356.
ICALP-2004-BojanczykC: Tree-Walking Automata Cannot Be Determinized (MB, TC), pp. 246–256.
IFM-2004-Willemse #algebra #hybrid #process: Embeddings of Hybrid Automata in Process Algebra (TACW), pp. 343–362.
RTA-2004-CarmeNT #query: Querying Unranked Trees with Stepwise Tree Automata (JC, JN, MT), pp. 105–118.
SEFM-2004-BertoliniFFO #analysis #generative #network #probability #testing #using: Test Case Generation Using Stochastic Automata Networks: Quantitative Analysis (CB, AGF, PF, FMO), pp. 251–260.
SFM-2004-AlurM #overview #problem: Decision Problems for Timed Automata: A Survey (RA, PM), pp. 1–24.
FLOPS-2004-HagiyaTYS #abstraction #analysis #logic #using: Analysis of Synchronous and Asynchronous Cellular Automata Using Abstraction by Temporal Logic (MH, KT, MY, TS), pp. 7–21.
LOPSTR-2004-Ager #semantics: From Natural Semantics to Abstract Machines (MSA), pp. 245–261.
SAC-2004-MichaelsonHS #bound #named #programming #using: FSM-Hume: programming resource-limited systems using bounded automata (GM, KH, JS), pp. 1455–1461.
LDTA-2004-Tavernier #named #tool support #user interface #visual notation: Calife: A Generic Graphical User Interface for Automata Tools (BT), pp. 169–172.
DAC-2004-AntonelliCDHKKMN #clustering #modelling #problem: Quantum-Dot Cellular Automata (QCA) circuit partitioning: problem modeling and solutions (DAA, DZC, TJD, XSH, ABK, PMK, RCM, MTN), pp. 363–368.
DATE-v1-2004-DSilvaRS #architecture #communication #framework #modelling #protocol #verification: Synchronous Protocol Automata: A Framework for Modelling and Verification of SoC Communication Architectures (VD, SR, AS), pp. 390–395.
DATE-v2-2004-TahooriL #design #quantum #testing: Testing of Quantum Dot Cellular Automata Based Designs (MBT, FL), pp. 1408–1409.
ESOP-2004-CarlssonB #algorithm #constraints #finite: From Constraints to Finite Automata to Filtering Algorithms (MC, NB), pp. 94–108.
ESOP-2004-PhillipsYE #calculus #distributed: A Distributed Abstract Machine for Boxed Ambient Calculi (AP, NY, SE), pp. 155–170.
FoSSaCS-2004-Kirsten #distance #problem: Distance Desert Automata and the Star Height One Problem (DK), pp. 257–272.
STOC-2004-AlurM: Visibly pushdown languages (RA, PM), pp. 202–211.
TACAS-2004-BardinFL #performance: FASTer Acceleration of Counter Automata in Practice (SB, AF, JL), pp. 576–590.
TACAS-2004-BehrmannBLP #abstraction #bound: Lower and Upper Bounds in Zone Based Abstractions of Timed Automata (GB, PB, KGL, RP), pp. 312–326.
TACAS-2004-KrcalY #analysis #decidability #problem #scheduling #using: Decidable and Undecidable Problems in Schedulability Analysis Using Timed Automata (PK, WY), pp. 236–250.
TACAS-2004-LugiezNZ #approach #explosion #partial order #problem #semantics: A Partial Order Semantics Approach to the Clock Explosion Problem of Timed Automata (DL, PN, SZ), pp. 296–311.
TACAS-2004-RasmussenLS #scheduling #using: Resource-Optimal Scheduling Using Priced Timed Automata (JIR, KGL, KS), pp. 220–235.
CAV-2004-BartzisB: Widening Arithmetic Automata (CB, TB), pp. 321–333.
CAV-2004-BrabermanGO #named #slicing: ObsSlice: A Timed Automata Slicer Based on Observers (VAB, DG, AO), pp. 470–474.
FATES-2004-BlomHJP #generative #specification #testing #using: Specifying and Generating Test Cases Using Observer Automata (JB, AH, BJ, PP), pp. 125–139.
LICS-2004-EsparzaKM #model checking #probability: Model Checking Probabilistic Pushdown Automata (JE, AK, RM), pp. 12–21.
LICS-2004-GrooteGS: Vector Addition Tree Automata (PdG, BG, SS), pp. 64–73.
LICS-2004-Klaedtke #on the: On the Automata Size for Presburger Arithmetic (FK), pp. 110–119.
LICS-2004-Latour #integer: From Automata to Formulas: Convex Integer Polyhedra (LL), pp. 120–129.
LICS-2004-OuaknineW #decidability #on the #problem: On the Language Inclusion Problem for Timed Automata: Closing a Decidability Gap (JO, JW), pp. 54–63.
TestCom-2004-El-FakihTSY #multi #testing: FSM Based Interoperability Testing Methods for Multi Stimuli Model (KEF, VT, NS, NY), pp. 60–75.
CIAA-2003-ChamparnaudLOZ #finite: From Regular Weighted Expressions to Finite Automata (JMC, ÉL, FO, DZ), pp. 49–60.
CIAA-2003-DaleyEM #probability #retrieval: Bag Automata and Stochastic Retrieval of Biomolecules in Solution (MD, MGE, IM), pp. 239–250.
CIAA-2003-FrishertCW #regular expression: The Effect of Rewriting Regular Expressions on Their Accepting Automata (MF, LGC, BWW), pp. 304–305.
CIAA-2003-Fritz #linear #logic #simulation #using: Constructing Büchi Automata from Linear Temporal Logic Using Simulation Relations for Alternating Büchi Automata (CF), pp. 35–48.
CIAA-2003-GuingneKN #complexity: Running Time Complexity of Printing an Acyclic Automaton (FG, AK, FN), pp. 131–140.
CIAA-2003-Henzinger #component #interface #specification: Automata for Specifying Component Interfaces (TAH), pp. 1–2.
CIAA-2003-Karhumaki #word: Automata on Words (JK), pp. 3–10.
CIAA-2003-KuskeM #branch #parallel: Branching Automata with Costs — A Way of Reflecting Parallelism in Costs (DK, IM), pp. 150–162.
CIAA-2003-MelicharP #approach #finite #problem #sequence: The Longest Common Subsequence Problem A Finite Automata Approach (BM, TP), pp. 294–296.
CIAA-2003-NgassamWK #finite: Preliminary Experiments in Hardcoding Finite Automata (EKN, BWW, DGK), pp. 299–300.
CIAA-2003-PrestonK #named #visualisation: AVA: An Applet for Visualizing FRACTRAN and Other Automata (NP, MSK), pp. 297–298.
CIAA-2003-Ravikumar #algorithm: Weak Minimization of DFA — An Algorithm and Applications (BR), pp. 226–238.
CIAA-2003-TammU #regular expression: Bideterministic Automata and Minimal Representations of Regular Languages (HT, EU), pp. 61–71.
DLT-2003-AnanichevV: Synchronizing Monotonic Automata (DSA, MVV), pp. 111–121.
DLT-2003-BertoniMP #quantum: Quantum Computing: 1-Way Quantum Automata (AB, CM, BP), pp. 1–20.
DLT-2003-CarmeGLTT #finite: Residual Finite Tree Automata (JC, RG, AL, AT, MT), pp. 171–182.
DLT-2003-ChamparnaudC #algorithm #nondeterminism #reduction: NFA Reduction Algorithms by Means of Regular Inequalities (JMC, FC), pp. 194–205.
DLT-2003-Csuhaj-VarjuMV #distributed: Distributed Pushdown Automata Systems: Computational Power (ECV, VM, GV), pp. 218–229.
DLT-2003-Domaratzki #on the: On Enumeration of Müller Automata (MD), pp. 254–265.
DLT-2003-Gecseg #set: Comments on Complete Sets of Tree Automata (FG), pp. 22–34.
DLT-2003-HolzerK #finite #monad #on the: On Deterministic Finite Automata and Syntactic Monoid Size, Continued (MH, BK), pp. 349–360.
DLT-2003-HolzerK03a #nondeterminism: Flip-Pushdown Automata: Nondeterminism Is Better than Determinism (MH, MK), pp. 361–372.
DLT-2003-KlimannLMP #ambiguity: Deciding the Sequentiality of a Finitely Ambiguous Max-Plus Automaton (IK, SL, JM, CP), pp. 373–385.
DLT-2003-Malcher #finite: Minimizing Finite Automata Is Computationally Hard (AM), pp. 386–397.
DLT-2003-Otto: Restarting Automata and Their Relations to the Chomsky Hierarchy (FO), pp. 55–74.
DLT-2003-Polak: Syntactic Semiring and Universal Automaton (LP), pp. 411–422.
DLT-2003-Rahonis #transducer: Alphabetic Pushdown Tree Transducers (GR), pp. 423–436.
ICALP-2003-Cachat #game studies #graph #higher-order: Higher Order Pushdown Automata, the Caucal Hierarchy of Graphs and Parity Games (TC), pp. 556–569.
ICALP-2003-DenisE #probability: Residual Languages and Probabilistic Automata (FD, YE), pp. 452–463.
ICALP-2003-HolzerK: Flip-Pushdown Automata: k+1 Pushdown Reversals Are Better than k (MH, MK), pp. 490–501.
ICALP-2003-HromkovicS #comparison #multi: Pushdown Automata and Multicounter Machines, a Comparison of Computation Modes (JH, GS), pp. 66–80.
ICALP-2003-HromkovicS03a #finite #nondeterminism: Nondeterminism versus Determinism for Two-Way Finite Automata: Generalizations of Sipser’s Separation (JH, GS), pp. 439–451.
ICALP-2003-StoelingaV #probability #testing: A Testing Scenario for Probabilistic Automata (MS, FWV), pp. 464–477.
ICALP-2003-Vardi #logic: Logic and Automata: A Match Made in Heaven (MYV), pp. 64–65.
FME-2003-BeekK #composition: Team Automata Satisfying Compositionality (MHtB, JK), pp. 381–400.
RTA-2003-Dal-ZilioL #logic #xml: XML Schema, Tree Logic and Sheaves Automata (SDZ, DL), pp. 246–263.
RTA-2003-Verma #decidability #equation: Two-Way Equational Tree Automata for AC-Like Theories: Decidability and Closure Properties (KNV), pp. 180–196.
SEFM-2003-LanotteMT #bisimulation #probability #security: Weak Bisimulation for Probabilistic Timed Automata and Applications to Security (RL, AMS, AT), pp. 34–43.
ICEIS-v1-2003-BouchouALD #constraints #validation #xml: Extending Tree Automata to Model XML Validation Under Element and Attribute Constraints (BB, MHFA, DL, DD), pp. 184–190.
CIKM-2003-Onizuka #xml #xpath: Light-weight xPath processing of XML stream with deterministic automata (MO), pp. 342–349.
LOPSTR-2003-Ellman #animation #hybrid #specification #synthesis: Specification and Synthesis of Hybrid Automata for Physics-Based Animation (TE), pp. 54–55.
PPDP-2003-AgerBDM #functional: A functional correspondence between evaluators and abstract machines (MSA, DB, OD, JM), pp. 8–19.
SAS-2003-RepsSJ #analysis #data flow #interprocedural: Weighted Pushdown Systems and Their Application to Interprocedural Dataflow Analysis (TWR, SS, SJ), pp. 189–213.
ASE-2003-Ellman #animation #hybrid #specification #synthesis: Specification and Synthesis of Hybrid Automata for Physics-Based Animation (TE), pp. 80–93.
DAC-2003-Al-YamaniM #encoding: Seed encoding with LFSRs and cellular automata (AAAY, EJM), pp. 560–565.
DAC-2003-Bernstein: Quantum-dot cellular automata: computing by field polarization (GHB), pp. 268–273.
PDP-2003-MameiRZ #behaviour #case study #distributed: Dissipative Cellular Automata As Minimalist Distributed Systems: A Study On Emergent Behaviors (MM, AR, FZ), pp. 250–257.
FoSSaCS-2003-Lugiez #constraints #multi #similarity: Counting and Equality Constraints for Multitree Automata (DL), pp. 328–342.
TACAS-2003-BehrmannBFL #analysis #verification: Static Guard Analysis in Timed Automata Verification (GB, PB, EF, KGL), pp. 254–277.
TACAS-2003-DembinskiJJPPSWZ #named #specification #verification: Verics: A Tool for Verifying Timed Automata and Estelle Specifications (PD, AJ, PJ, WP, AP, MS, BW, AZ), pp. 278–283.
CADE-2003-HladikS #logic: A Translation of Looping Alternating Automata into Description Logics (JH, US), pp. 90–105.
CAV-2003-BoigelotHJ #hybrid #using: Hybrid Acceleration Using Real Vector Automata (BB, FH, SJ), pp. 193–205.
CAV-2003-HungarNS #learning #optimisation: Domain-Specific Optimization in Automata Learning (HH, ON, BS), pp. 315–327.
CAV-2003-SeshiaB #bound #model checking #using: Unbounded, Fully Symbolic Model Checking of Timed Automata using Boolean Methods (SAS, REB), pp. 154–166.
CSL-2003-LeissR #string: Automata on Lempel-ziv Compressed Strings (HL, MdR), pp. 384–396.
LICS-2003-OuaknineW #decidability #robust: Revisiting Digitization, Robustness, and Decidability for Timed Automata (JO, JW), pp. 198–207.
TestCom-2003-En-NouaaryD #testing: A Guided Method for Testing Timed Input Output Automata (AEN, RD), pp. 211–225.
VMCAI-2003-Wang #performance #verification: Efficient Verification of Timed Automata with BDD-Like Data-Structures (FW), pp. 189–205.
PODS-2002-SpielmannTB #distributed #query #using #web: Distributed Computation of Web Queries Using Automata (MS, JT, JVdB), pp. 97–108.
CIAA-J-2000-Bruggemann-KleinW02 #nondeterminism: The Regularity of Two-Way Nondeterministic Tree Automata Languages (ABK, DW), pp. 67–81.
CIAA-J-2000-CampeanuPY02 #algorithm #finite #performance: An Efficient Algorithm for Constructing Minimal Cover Automata for Finite Languages (CC, AP, SY), pp. 83–97.
CIAA-J-2000-Champarnaud02 #evaluation #nondeterminism #regular expression: Evaluation of Three Implicit Structures to Implement Nondeterministic Automata From Regular Expressions (JMC), pp. 99–113.
CIAA-2002-AlonsoDF #bidirectional: Tabulation of Bidirectional Push Down Automata (MAA, VJD, MVF), pp. 35–46.
CIAA-2002-AnselmoGV #finite #self: Finite Automata and Non-self-Embedding Grammars (MA, DG, SV), pp. 47–56.
CIAA-2002-CampeanuP #finite #similarity: The Number of Similarity Relations and the Number of Minimal Deterministic Finite Cover Automata (CC, AP), pp. 67–76.
CIAA-2002-Daciuk #algorithm #comparison #finite #set #string: Comparison of Construction Algorithms for Minimal, Acyclic, Deterministic, Finite-State Automata from Sets of Strings (JD), pp. 255–261.
CIAA-2002-Fatholahzadeh #implementation: Implementation of Dictionaries via Automata and Decision Trees (AF), pp. 95–105.
CIAA-2002-Holub #nondeterminism #programming #simulation: Dynamic Programming — NFA Simulation (JH), pp. 295–300.
CIAA-2002-HolzerK #complexity #finite #nondeterminism: State Complexity of Basic Operations on Nondeterministic Finite Automata (MH, MK), pp. 148–157.
CIAA-2002-Korner #finite #on the: On Minimizing Cover Automata for Finite Languages in O(n log n) Time (HK), pp. 117–127.
CIAA-2002-Mohri: Edit-Distance of Weighted Automata (MM), pp. 1–23.
CIAA-2002-NetoB #adaptation: Adaptive Automata — A Revisited Proposal (JJN, CB), pp. 158–168.
CIAA-2002-Sutner: Reduced Power Automata (KS), pp. 194–202.
CIAA-2002-Sutner02a #hybrid: automata, a Hybrid System for Computational Automata Theory (KS), pp. 221–227.
CIAA-2002-Tronicek #sequence: Common Subsequence Automaton (ZT), pp. 270–275.
DLT-2002-AnanichevCV #algorithm #word: An Inverse Automata Algorithm for Recognizing 2-Collapsing Words (DSA, AC, MVV), pp. 270–282.
DLT-2002-BruyereC #linear #order: Automata on Linear Orderings (VB, OC), pp. 103–115.
DLT-2002-Domaratzki #bound #finite: Improved Bounds on the Number of Automata Accepting Finite Languages (MD), pp. 209–219.
DLT-2002-HolzerK02a #finite #monad #on the: On Deterministic Finite Automata and Syntactic Monoid Size (MH, BK), pp. 258–269.
DLT-2002-Hoogeboom: Carriers and Counters: P Systems with Carriers vs. (Blind) Counter Automata (HJH), pp. 140–151.
DLT-2002-IbarraDS #finite #safety #verification: Safety Verification for Two-Way Finite Automata with Monotonic Counters (OHI, ZD, ZWS), pp. 326–338.
DLT-2002-Imreh: Some Remarks on Asynchronous Automata (BI), pp. 290–296.
DLT-2002-Okhotin #linear #representation: Automaton Representation of Linear Conjunctive Languages (AO), pp. 393–404.
DLT-2002-PetkovicCB: Characteristic Semigroups of Directable Automata (TP, MC, SB), pp. 417–427.
DLT-2002-Seibert #finite #performance #regular expression: Efficient Transformations from Regular Expressions to Finite Automata (SS), pp. 28–42.
DLT-2002-Svozil #concept #finite #modelling: Finite Automata Models of Quantized Systems: Conceptual Status and Outlook (KS), pp. 93–102.
DLT-2002-UmeoK #communication #infinity #realtime #sequence: An Infinite Prime Sequence Can Be Generated in Real-Time by a 1-Bit Inter-cell Communication Cellular Automaton (HU, NK), pp. 339–348.
ICALP-2002-Bojanczyk #finite #modelling: Two-Way Alternating Automata and Finite Models (MB), pp. 833–844.
ICALP-2002-Cachat #game studies #graph #synthesis: Symbolic Strategy Synthesis for Games on Pushdown Graphs (TC), pp. 704–715.
ICALP-2002-Lombardy #on the: On the Construction of Reversible Automata for Reversible Languages (SL), pp. 170–182.
ICALP-2002-Ollinger: The Quest for Small Universal Cellular Automata (NO), pp. 318–329.
ICALP-2002-PapazianR #graph #recognition: Hyperbolic Recognition by Graph Automata (CP, ER), pp. 330–342.
ICEIS-2002-DascaluGF #modelling #using: Using Cellular Automata in Traffic Modeling (MD, SG, EF), pp. 467–472.
CIKM-2002-SistlaHC #database #query #retrieval #sequence #similarity #using: Similarity based retrieval from sequence databases using automata as queries (APS, TH, VC), pp. 237–244.
SEKE-2002-FarinaFO #modelling #network #probability #representation: Representing software usage models with stochastic automata networks (AGF, PF, FMO), pp. 401–407.
PADL-2002-GallagherP #abstract interpretation #analysis #finite #logic programming #nondeterminism #source code: Abstract Interpretation over Non-deterministic Finite Tree Automata for Set-Based Analysis of Logic Programs (JPG, GP), pp. 243–261.
ICSE-2002-SchapachnikBO #approach #architecture #development #distributed #model checking: An architecture-centric approach to the development of a distributed model-checker for timed automata (FS, VAB, AO), p. 710.
DATE-2002-AbkeB #implementation: A Direct Mapping System for Datapath Module and FSM Implementation into LUT-Based FPGAs (JA, EB), p. 1085.
FoSSaCS-2002-JancarKMS #bound #proving: Equivalence-Checking with One-Counter Automata: A Generic Method for Proving Lower Bounds (PJ, AK, FM, ZS), pp. 172–186.
FoSSaCS-2002-KnapikNU #higher-order: Higher-Order Pushdown Trees Are Easy (TK, DN, PU), pp. 205–222.
TACAS-2002-AbdeddaimM #scheduling #using: Preemptive Job-Shop Scheduling Using Stopwatch Automata (YA, OM), pp. 113–126.
TACAS-2002-FersmanPY #decidability #process #scheduling: Timed Automata with Asynchronous Processes: Schedulability and Decidability (EF, PP, WY), pp. 67–82.
CSL-2002-CachatDT #game studies: Solving Pushdown Games with a Σ₃ Winning Condition (TC, JD, WT), pp. 322–336.
CSL-2002-Neven #logic #xml: Automata, Logic, and XML (FN), pp. 2–26.
ICLP-2002-BoigelotW #constraints #finite #overview #perspective #representation: Representing Arithmetic Constraints with Finite Automata: An Overview (BB, PW), pp. 1–19.
LICS-2002-BenediktL #algebra #logic #query: Tree Extension Algebras: Logics, Automata, and Query Languages (MB, LL), p. 203–?.
LICS-2002-Dima #reachability: Computing Reachability Relations in Timed Automata (CD), p. 177–?.
VMCAI-2002-TorreMN: Weak Muller Acceptance Conditions for Tree Automata (SLT, AM, MN), pp. 240–254.
CIAA-2001-DaciukN #finite #modelling #representation: Finite Automata for Compact Representation of Language Models in NLP (JD, GvN), pp. 65–73.
CIAA-2001-DangBIK: Past Pushdown Timed Automata (ZD, TB, OHI, RAK), pp. 74–86.
CIAA-2001-DubernardG #finite #generative #scheduling: Scheduling Hard Sporadic Tasks by Means of Finite Automata and Generating Functions (JPD, DG), pp. 87–100.
CIAA-2001-GranaBA #compilation #finite #scalability: Compilation Methods of Minimal Acyclic Finite-State Automata for Large Dictionaries (JG, FMB, MAA), pp. 135–148.
CIAA-2001-Holub #nondeterminism #parallel #simulation: Bit Parallelism — NFA Simulation (JH), pp. 149–160.
CIAA-2001-KatritzkeMT #clustering #finite #image #using: Enhancements of Partitioning Techniques for Image Compression Using Weighted Finite Automata (FK, WM, MT), pp. 177–189.
CIAA-2001-MelicharS #finite #on the: On the Size of Deterministic Finite Automata (BM, JS), pp. 202–213.
CIAA-2001-MoreySMW: Crystal Lattice Automata (JM, KS, REM, MWW), pp. 214–220.
CIAA-2001-NedjahM #adaptation #pattern matching #performance #term rewriting: Minimal Adaptive Pattern-Matching Automata for Efficient Term Rewriting (NN, LdMM), pp. 221–233.
CIAA-2001-Velinov #design #modelling #on the: On the Software Design of Cellular Automata Simulators for Ecological Modeling (YV), pp. 261–262.
CIAA-2001-Zijl01a #finite: Supernondeterministic Finite Automata (LvZ), pp. 274–288.
DLT-2001-CaludeC #named #nondeterminism #quantum: Automata: From Uncertainty to Quantum (CC, EC), pp. 1–14.
DLT-2001-CulikKK #problem: A Note on Synchronized Automata and Road Coloring Problem (KCI, JK, JK), pp. 175–185.
DLT-2001-EsikN: Automata on Series-Parallel Biposets (ZÉ, ZLN), pp. 217–227.
DLT-2001-HromkovicS #on the #power of #random: On the Power of Randomized Pushdown Automata (JH, GS), pp. 262–271.
DLT-2001-SchwentickTV: Partially-Ordered Two-Way Automata: A New Characterization of DA (TS, DT, HV), pp. 239–250.
DLT-2001-Thomas #infinity: A Short Introduction to Infinite Automata (WT), pp. 130–144.
ICALP-2001-ComonCM #constraints #memory management #protocol #set: Tree Automata with One Memory, Set Constraints, and Ping-Pong Protocols (HC, VC, JM), pp. 682–693.
ICALP-2001-EtessamiWS #game studies #reduction #simulation: Fair Simulation Relations, Parity Games, and State Space Reduction for Büchi Automata (KE, TW, RAS), pp. 694–707.
ICALP-2001-SangiorgiV #distributed: A Distributed Abstract Machine for Safe Ambients (DS, AV), pp. 408–420.
ICALP-2001-Trakhtenbrot: Automata, Circuits, and Hybrids: Facets of Continuous Time (BAT), pp. 4–23.
FME-2001-Beyer #analysis #reachability: Improvements in BDD-Based Reachability Analysis of Timed Automata (DB0), pp. 318–343.
RTA-2001-Lohrey #complexity #on the #parallel: On the Parallel Complexity of Tree Automata (ML), pp. 201–215.
FLOPS-2001-Hortala-GonzalezU #calculus #lazy evaluation: An Abstract Machine Based System for a Lazy Narrowing Calculus (MTHG, EU), pp. 216–232.
POPL-2001-BhargavanCMG #monitoring #network #what: What packets may come: automata for network monitoring (KB, SC, PJM, CAG), pp. 206–219.
SAS-2001-BouajjaniCLS #parametricity: Analyzing Fair Parametric Extended Automata (AB, ACA, YL, MS), pp. 335–355.
ESEC-FSE-2001-AlfaroH #interface: Interface automata (LdA, TAH), pp. 109–120.
PDP-2001-Talia #implementation #parallel #standard: Implementing Standard and Nonstandard Parallel Cellular Automata in CARPET (DT), pp. 243–249.
FoSSaCS-2001-Bojanczyk #finite #graph #problem: The Finite Graph Problem for Two-Way Alternating Automata (MB), pp. 88–103.
FoSSaCS-2001-KingKV #complexity #on the #word: On the Complexity of Parity Word Automata (VK, OK, MYV), pp. 276–286.
STOC-2001-Trakhtenbrot: Automata, circuits and hybrids: facets of continuous time (BAT), pp. 754–755.
STOC-2001-Vatan #probability: Distribution functions of probabilistic automata (FV), pp. 684–693.
TACAS-2001-CimattiRB #model checking #set: Searching Powerset Automata by Combining Explicit-State and Symbolic Model Checking (AC, MR, PB), pp. 313–327.
TACAS-2001-HuneRSV #linear #model checking #parametricity: Linear Parametric Model Checking of Timed Automata (TH, JR, MS, FWV), pp. 189–203.
TACAS-2001-KloseW #sequence chart: An Automata Based Interpretation of Live Sequence Charts (JK, HW), pp. 512–527.
TACAS-2001-NielsenS #automation #generative #testing: Automated Test Generation from Timed Automata (BN, AS), pp. 343–357.
CAV-2001-AbdeddaimM #scheduling #using: Job-Shop Scheduling Using Timed Automata (YA, OM), pp. 478–492.
CAV-2001-BhatCG #model checking #performance: Efficient Model Checking Via Büchi Tableau Automata (GB, RC, AG), pp. 38–52.
CAV-2001-Dang #analysis #reachability: Binary Reachability Analysis of Pushdown Timed Automata with Dense Clocks (ZD), pp. 506–518.
CAV-2001-GastinO #ltl #performance: Fast LTL to Büchi Automata Translation (PG, DO), pp. 53–65.
CAV-2001-LarsenBBFHPR #performance #reachability: As Cheap as Possible: Efficient Cost-Optimal Reachability for Priced Timed Automata (KGL, GB, EB, AF, TH, PP, JR), pp. 493–505.
CSL-2001-Finkel #effectiveness: An Effective Extension of the Wagner Hierarchy to Blind Counter Automata (OF), pp. 369–383.
CSL-2001-GalotaV #theorem: A Generalization of the Büchi-Elgot-Trakhtenbrot Theorem (MG, HV), pp. 355–368.
CSL-2001-Ohsaki #commutative #equation: Beyond Regularity: Equational Tree Automata for Associative and Commutative Theories (HO), pp. 539–553.
IJCAR-2001-BaaderT #approach #satisfiability: The Inverse Method Implements the Automata Approach for Modal Satisfiability (FB, ST), pp. 92–106.
IJCAR-2001-BoigelotJW #integer #linear #on the #using: On the Use of Weak Automata for Deciding Linear Arithmetic with Integer and Real Variables (BB, SJ, PW), pp. 611–625.
IJCAR-2001-Middeldorp #approximate #dependence #graph #using: Approximating Dependency Graphs Using Tree Automata Techniques (AM), pp. 593–610.
ADL-2000-Chidlovskii #using #xml: Using Regular Tree Automata as XML Schemas (BC), pp. 89–98.
ECDL-2000-OhtaTA #fuzzy #probability #retrieval: Probabilistic Automaton Model for Fuzzy English-Text Retrieval (MO, AT, JA), pp. 35–44.
CIAA-2000-BergeronH #implementation #performance: Fast Implementations of Automata Computations (AB, SH), pp. 47–56.
CIAA-2000-Bruggemann-KleinW #nondeterminism: Regularly Extended Two-Way Nondeterministic Tree Automata (ABK, DW), pp. 57–66.
CIAA-2000-Champarnaud #nondeterminism #regular expression: Implicit Structures to Implement NFA’s from Regular Expressions (JMC), pp. 80–93.
CIAA-2000-ChamparnaudZ #canonical #finite: New Finite Automaton Constructions Based on Canonical Derivatives (JMC, DZ), pp. 94–104.
CIAA-2000-Daciuk: Experiments with Automata Compression (JD), pp. 105–112.
CIAA-2000-DiehlKW #algorithm #finite #generative #visual notation #web: Visual Exploration of Generation Algorithms for Finite Automata on the Web (SD, AK, TW), pp. 327–328.
CIAA-2000-Heam: Automata for Pro-V Topologies (PCH), pp. 135–144.
CIAA-2000-IbarraS: Generalizing the Discrete Timed Automaton (OHI, JS), pp. 157–169.
CIAA-2000-LodayaR #navigation #web: An Automaton Model of User-Controlled Navigation on the Web (KL, RR), pp. 208–216.
CIAA-2000-Mohri #algorithm: Generic epsilon -Removal Algorithm for Weighted Automata (MM), pp. 230–242.
CIAA-2000-Neto #adaptation #problem: Solving Complex Problems Efficiently with Adaptive Automata (JJN), pp. 340–342.
CIAA-2000-PaunSY #algorithm #finite: An O(n2) Algorithm for Constructing Minimal Cover Automata for Finite Languages (AP, NS, SY), pp. 243–251.
CIAA-2000-ShankarSAR #finite #implementation: A Package for the Implementation of Block Codes as Finite Automata (PS, KS, VA, BSR), pp. 279–292.
CIAA-2000-Wareham #complexity #composition #finite #set: The Parameterized Complexity of Intersection and Composition Operations on Sets of Finite-State Automata (TW), pp. 302–310.
ICALP-2000-HromkovicKKSS #finite #metric #nondeterminism: Measures of Nondeterminism in Finite Automata (JH, JK, HK, GS, SS), pp. 199–210.
ICALP-2000-NevenS #on the #power of: On the Power of Tree-Walking Automata (FN, TS), pp. 547–560.
ICALP-2000-Urbanski #on the: On Deciding if Deterministic Rabin Language Is in Büchi Class (TFU), pp. 663–674.
WLC-2000-DemenyHNN #visualisation: Visualization of Cellular Automata (MD, GH, CN, ZN), pp. 162–170.
WLC-2000-GruskaV #finite #quantum: Quantum Finite Automata (JG, RV), pp. 192–211.
WLC-2000-ImrehIP #commutative #on the: On Commutative Asynchronous Automata (BI, MI, AP), pp. 212–221.
WLC-2000-NiemannO: Further Results on Restarting Automata (GN, FO), pp. 352–369.
WLC-2000-Nishio #finite: Cellular Automata with Polynomials over Finite Fields (HN), pp. 370–377.
WLC-2000-PopovicBPC: Generalized Directable Automata (ZP, SB, TP, MC), pp. 378–395.
WLC-2000-Steinby #formal method #term rewriting: Tree Automata in the Theory of Term Rewriting (MS), pp. 434–449.
RTA-2000-Tison #term rewriting: Tree Automata and Term Rewrite Systems (ST), pp. 27–30.
ICML-2000-ThollardDH #probability #using: Probabilistic DFA Inference using Kullback-Leibler Divergence and Minimality (FT, PD, CdlH), pp. 975–982.
ICML-2000-Veeser #approach #finite #learning: An Evolutionary Approach to Evidence-Based Learning of Deterministic Finite Automata (SV), pp. 1071–1078.
FASE-2000-HuneS #case study #synthesis #using: A Case Study on Using Automata in Control Synthesis (TH, AS), pp. 349–362.
FoSSaCS-2000-LinY #proving: A Proof System for Timed Automata (HL, WY), pp. 208–222.
FoSSaCS-2000-Pinto #concurrent #interactive: Sequential and Concurrent Abstract Machines for Interaction Nets (JSP), pp. 267–282.
FoSSaCS-2000-Treinen #logic #testing: Predicate Logic and Tree Automata with Tests (RT), pp. 329–343.
TACAS-2000-WolperB #constraints #linear #on the: On the Construction of Automata from Linear Arithmetic Constraints (PW, BB), pp. 1–19.
CAV-2000-AyariBK #induction: Decision Procedures for Inductive Boolean Functions Based on Alternating Automata (AA, DAB, FK), pp. 170–185.
CAV-2000-BouyerDFP #question: Are Timed Automata Updatable? (PB, CD, EF, AP), pp. 464–479.
CAV-2000-DangIBKS #analysis #reachability: Binary Reachability Analysis of Discrete Pushdown Timed Automata (ZD, OHI, TB, RAK, JS), pp. 69–84.
CAV-2000-EsparzaHRS #algorithm #model checking #performance: Efficient Algorithms for Model Checking Pushdown Systems (JE, DH, PR, SS), pp. 232–247.
CAV-2000-SomenziB #ltl #performance: Efficient Büchi Automata from LTL Formulae (FS, RB), pp. 248–263.
CSL-2000-Vardi #automation #graph #logic #verification: Automated Verification = Graphs, Automata, and Logic (MYV), p. 139.
PODS-1999-NevenS #query: Query Automata (FN, TS), pp. 205–214.
DLT-1999-Bruggemann-KleinW #pattern matching: Caterpillars, context, tree automata and tree pattern matching (ABK, DW), pp. 270–285.
DLT-1999-BuchholzKK #on the: On tally languages and generalized interacting automata (TB, AK, MK), pp. 316–325.
DLT-1999-CaludeC #behaviour #bisimulation #nondeterminism: Bisimulations and behaviour of nondeterministic automata (CC, EC), pp. 60–70.
DLT-1999-JirickaK #finite #nondeterminism: Deterministic forgetting planar automata are more powerful than non-deterministic finite-state planar automata (PJ, JK), pp. 71–80.
DLT-1999-NiemannO: Restarting automata, Church-Rosser languages, and representations of r.e. languages (GN, FO), pp. 103–114.
ICALP-1999-BouyerP #composition: Decomposition and Composition of Timed Automata (PB, AP), pp. 210–219.
ICALP-1999-DickhoferW #model checking #problem: Timed Alternating Tree Automata: The Automata-Theoretic Solution to the TCTL Model Checking Problem (MD, TW), pp. 281–290.
ICALP-1999-HromkovicS #finite #on the #power of: On the Power of Las Vegas II. Two-Way Finite Automata (JH, GS), pp. 433–442.
ICALP-1999-NichitiuR: Leader Election by d Dimensional Cellular Automata (CMN, ER), pp. 565–574.
ICALP-1999-PeichlV #finite: Finite Automata with Generalized Acceptance Criteria (TP, HV), pp. 605–614.
ICALP-1999-Rutten #induction: Automata, Power Series, and Coinduction: Taking Input Derivatives Seriously (JJMMR), pp. 645–654.
WIA-1999-AndaryCCDFL #named: SEA: A Symbolic Environment for Automata Theory (PA, PC, JMC, GD, MF, ÉL), pp. 13–26.
WIA-1999-BrauneDKW #animation #finite #generative #learning: Animation of the Generation and Computation of Finite Automata for Learning Software (BB, SD, AK, RW), pp. 39–47.
WIA-1999-JurgensenS #encoding #finite #geometry: Finite Automata Encoding Geometric Figures (HJ, LS), pp. 101–108.
WIA-1999-SeuringG: A Structural Method for Output Compaction of Sequential Automata Implemented as Circuits (MS, MG), pp. 158–163.
WIA-1999-Trahtman #algorithm #finite #testing #verification: An Algorithm to Verify Local Threshold Testability of Deterministic Finite Automata (ANT), pp. 164–173.
WIA-1999-Watson #algorithm #finite #taxonomy: A Taxonomy of Algorithms for Constructing Minimal Acyclic Deterministic Finite Automata (BWW), pp. 174–182.
FM-v2-1999-PoizatCR #approach #concurrent #requirements: From Informal Requirements to COOP: A Concurrent Automata Approach (PP, CC, JCR), pp. 939–962.
IFM-1999-Mery #requirements: Requirements for a Temporal B — Assigning Temporal Meaning to Abstract Machines... and to Abstract Systems (DM), pp. 395–414.
TLCA-1999-MikamiA #case study #linear: A Study of Abramsky’s Linear Chemical Abstract Machine (SM, YA), pp. 243–257.
FLOPS-1999-Ohori #logic #morphism: The Logical Abstract Machine: A Curry-Howard Isomorphism for Machine Code (AO), pp. 300–318.
HCI-CCAD-1999-FujishigeJK #finite #recognition #using #word: Recognition of Japanese sign language words using finite automata (EF, KJ, TK), pp. 167–171.
ICEIS-1999-FrantiDSS #data access #using: Using Intelligent Retina with Cellular Automata in Access Control (EF, MD, GS, MS), pp. 219–224.
ICML-1999-ParekhH: Simple DFA are Polynomially Probably Exactly Learnable from Simple Examples (RP, VH), pp. 298–306.
SAS-1999-Monniaux #encryption #protocol: Abstracting Cryptographic Protocols with Tree Automata (DM), pp. 149–163.
SAC-1999-FenwickD #estimation #using: Electrical Substation Service-Area Estimation Using Cellular Automata: An Initial Report (JWF, LJD), pp. 560–565.
SAC-1999-VenkataramanaR #framework #learning: A Learning Automata Based Framework for Task Assignment in Heterogeneous Computing Systems (RDV, NR), pp. 541–547.
FoSSaCS-1999-BogaertST #problem: The Recognizability Problem for Tree Automata with Comparisons between Brothers (BB, FS, ST), pp. 150–164.
STOC-1999-AmanoI #finite #quantum: Undecidability on Quantum Finite Automata (MA, KI), pp. 368–375.
STOC-1999-AmbainisNTV #bound #quantum: Dense Quantum Coding and a Lower Bound for 1-Way Quantum Automata (AA, AN, ATS, UVV), pp. 376–383.
CADE-1999-NadathurM #compilation #implementation #prolog #λ-calculus: System Description: Teyjus — A Compiler and Abstract Machine Based Implementation of lambda-Prolog (GN, DJM), pp. 287–291.
CAV-1999-Alur: Timed Automata (RA), pp. 8–22.
CAV-1999-DanieleGV #generative #linear #logic: Improved Automata Generation for Linear Temporal Logic (MD, FG, MYV), pp. 249–260.
CAV-1999-Etessami #invariant #logic: Stutter-Invariant Languages, ω-Automata, and Temporal Logic (KE), pp. 236–248.
CAV-1999-Klarlund #formal method #logic #strict: A Theory of Restrictions for Logics and Automata (NK), pp. 406–417.
IWTCS-1999-HigashinoNTC #generative #testing: Generating Test Cases for a Timed I/O Automaton Model (TH, AN, KT, ARC), pp. 197–214.
ICALP-1998-BoigelotRW #integer #on the: On the Expressiveness of Real and Integer Arithmetic Automata (BB, SR, PW), pp. 152–163.
ICALP-1998-BuchsbaumGW #finite #on the: On the Determinization of Weighted Finite Automata (ALB, RG, JW), pp. 482–493.
ICALP-1998-DamicoMM #on the: On Computing the Entropy of Cellular Automata (Md, GM, LM), pp. 470–481.
ICALP-1998-HengleinR #complexity #constraints #recursion #type system: Constraint Automata and the Complexity of Recursive Subtype Entailment (FH, JR), pp. 616–627.
ICALP-1998-Lugiez #induction #proving #theorem proving: A Good Class of Tree Automata and Application to Inductive Theorem Proving (DL), pp. 409–420.
ICALP-1998-Vardi #reasoning: Reasoning about The Past with Two-Way Automata (MYV), pp. 628–641.
WIA-1998-Augros #finite #infinity #set #word: Automata to Recognize Finite and Infinite Words with at Least Two Factorizations on a Given Finite Set (XA), pp. 220–225.
WIA-1998-BeaulieuB: Automata and Computational Probabilities (MCB, AB), pp. 164–177.
WIA-1998-ChamparnaudZP: Determinization of Glushkov Automata (JMC, DZ, JLP), pp. 57–68.
WIA-1998-DuchampFL #multi: Operations over Automata with Multiplicities (GD, MF, ÉL), pp. 183–191.
WIA-1998-HolubM #approximate #finite #implementation #nondeterminism #pattern matching: Implementation of Nondeterministic Finite Automata for Approximate Pattern Matching (JH, BM), pp. 92–99.
WIA-1998-HuerterSWY #finite #implementation: Implementing Reversed Alternating Finite Automaton (r-AFA) Operations (SH, KS, XW, SY), pp. 69–81.
WIA-1998-Karpischek: Paging Automata (RUK), pp. 192–198.
WIA-1998-LHerPM #proving #source code #using: Proving Sequential Function Chart Programs Using Automata (DL, PLP, LM), pp. 149–163.
WIA-1998-MaurelPR #predict: The Syntactic Prediction with Token Automata: Application to HandiAS System (DM, BLP, OR), pp. 100–109.
WIA-1998-MichonC #diagrams: Automata and Binary Decision Diagrams (JFM, JMC), pp. 178–182.
WIA-1998-Pedrazzini #design pattern #finite: The Finite State Automata’s Design Patterns (SP), pp. 213–219.
WIA-1998-Poibeau: Bi-directional Automata to Extract Complex Phrases from Texts (TP), pp. 110–120.
KR-1998-Kusters #finite #semantics #using: Characterizing the Semantics of Terminological Cycles in ALN Using Finite Automata (RK), pp. 499–511.
SAC-1998-BillardL #behaviour #distributed #learning #simulation: Simulation of period-doubling behavior in distributed learning automata (EB, SL), pp. 690–695.
CC-1998-BrouwerGP #analysis #finite #implementation #performance: Myths and Facts about the Efficient Implementation of Finite Automata and Lexical Analysis (KB, WG, EP), pp. 1–15.
DAC-1998-HasteerMB #algorithm #verification: An Implicit Algorithm for Finding Steady States and its Application to FSM Verification (GH, AM, PB), pp. 611–614.
FASE-1998-Tapken #design #named #realtime: MOBY/PLC — A Design Tool for Hierarchical Real-Time Automata (JT), pp. 326–329.
FoSSaCS-1998-Beauquier: Pumping Lemmas for Timed Automata (DB), pp. 81–94.
STOC-1998-KupfermanV: Weak Alternating Automata and Tree Automata Emptiness (OK, MYV), pp. 224–233.
TACAS-1998-AcetoBL #model checking #reachability #testing: Model Checking via Reachability Testing for Timed Automata (LA, AB, KGL), pp. 263–280.
TACAS-1998-Grahlmann #finite #parallel #petri net #source code #using: Combining Finite Automata, Parallel Programs and SDL Using Petri Nets (BG), pp. 102–117.
CAV-1998-ComonJ #analysis #multi #safety: Multiple Counters Automata, Safety Analysis and Presburger Arithmetic (HC, YJ), pp. 268–279.
IWTCS-1998-Grunsky #testing: Testing of Automata: From Experiments to Representations by Means of Fragments (ISG), pp. 3–14.
IWTCS-1998-TanP #generative #specification #testing: Test Generation for Specifications Modeled by Input/Output Automata (QMT, AP), pp. 83–100.
LICS-1998-StarkS #analysis #composition #network #probability: Compositional Analysis of Expected Delays in Networks of Probabilistic I/O Automata (EWS, SAS), pp. 466–477.
LICS-1998-Thomas #logic #monad: Monadic Logic and Automata: Recent Developments (WT), pp. 136–138.
DLT-1997-CaludeCK #simulation: Deterministic Automata: Simulation, Universality and Minimality. Extended Abstract (CSC, EC, BK), pp. 519–537.
DLT-1997-GecsegI #on the #set: On complete sets of tree automata (FG, BI), pp. 37–47.
DLT-1997-IwamaT #bound #nondeterminism: Tight Bounds on the Number of States of DFA’s That Are Equivalent to n-state NFA’s (KI, KT), pp. 147–154.
DLT-1997-JancarMPPV: Deleting Automata with a Restart Operation (PJ, FM, MP, MP, JV), pp. 191–202.
DLT-1997-Kuich #named: Semirings: A basis for a mathematical automata and language theory (WK), pp. 49–60.
DLT-1997-MrazPP: Deleting Automata with a Restart Operation and Marcus Grammars (FM, MP, MP), pp. 329–342.
DLT-1997-Neumann #ambiguity #modelling #revisited: Unambiguity of SGML Content Models — Pushdown Automata Revisited (AN), pp. 507–518.
DLT-1997-PazC #array #evolution #probability: Chaotic Evolution via Generalized Probabilistic Automata (Probabilistic Arrays) (AP, JWC), pp. 9–35.
ICALP-1997-HenzingerK97a #hybrid: Discrete-Time Control for Rectangular Hybrid Automata (TAH, PWK), pp. 582–593.
ICALP-1997-ManziniM #classification #linear: A Complete and Efficiently Computable Topological Classification of D-dimensional Linear Cellular Automata over Zm (GM, LM), pp. 794–804.
ICALP-1997-Senizergues #decidability #equivalence #problem: The Equivalence Problem for Deterministic Pushdown Automata is Decidable (GS), pp. 671–681.
WIA-1997-BertaultK #using #visualisation: Visualization of Dynamic Automata Using Padnon (FB, GK), pp. 25–28.
WIA-1997-BrzozowskiN #behaviour: Automata of Asynchronous Behaviors (JAB, RN), pp. 29–45.
WIA-1997-Caron #named #regular expression: LANGAGE: A Maple Package for Automaton Characterization of Regular Languages (PC), pp. 46–55.
WIA-1997-GlennG #finite #implementation #performance: Implementing WS1S via Finite Automata: Performance Issues (JG, WIG), pp. 75–86.
WIA-1997-KirazE #implementation #multi #prolog #speech: Multi-tape Automata for Speech and Language Systems: A Prolog Implementation (GAK, EGE), pp. 87–103.
WIA-1997-LescowV #set: Minimal Separating Sets for Muller Automata (HL, JV), pp. 109–121.
WIA-1997-Maout #tool support: Tools to Implement Automata, a First Step: ASTL (VLM), pp. 104–108.
WIA-1997-Revuz: Operations on Extended Automata (DR), pp. 171–175.
WIA-1997-Trahtman #estimation #finite #order #precise #testing: A Precise Estimation of the Order of Local Testability of a Deterministic Finite Automaton (ANT), pp. 198–212.
WIA-1997-VogeUMB: The Automata Theory Package omega (JV, SU, OM, NB), pp. 228–231.
WIA-1997-Watson #optimisation: Practical Optimizations for Automata (BWW), pp. 232–240.
WIA-1997-Ziadi #clustering #problem #set #sorting: Sorting and Doubling Techniques for Set Partitioning and Automata Minimization Problems (DZ), pp. 241–251.
RTA-1997-OgataOF #named #order #term rewriting: TRAM: An Abstract Machine for Order-Sorted Conditioned Term Rewriting Systems (KO, KO, KF), pp. 335–338.
IFL-1997-BreitingerKLOP #distributed #named: DREAM: The DistRibuted Eden Abstract Machine (SB, UK, RL, YOM, RP), pp. 250–269.
ALP-1997-NedjahWE #pattern matching: Optimal Left-to-Right Pattern-Matching Automata (NN, CDW, SEE), pp. 273–286.
SAS-1997-TalbotTD #analysis #logic programming: Set-Based Analysis for Logic Programming and Tree Automata (JMT, ST, PD), pp. 127–140.
EDTC-1997-KagarisT #generative #sequence #testing: Cellular automata for generating deterministic test sequences (DK, ST), pp. 77–81.
EDTC-1997-SurtiCT #design #encoding #power management #using: Low power FSM design using Huffman-style encoding (PS, LFC, AT), pp. 521–525.
EDTC-1997-UrsuGZ #design #logic #specification #using #verification: Design and verification of the sequential systems automata using temporal logic specifications (AU, GG, SZ), p. 623.
PDP-1997-OdorVR #parallel #probability #simulation #string: Parallel simulation of ID probabilistic cellular automata on associative string processing machine (GÓ, GV, FR), pp. 149–154.
TAPSOFT-1997-Caron #named #set: AG: A Set of Maple Packages for Symbolic Computing of Automata and Semigroups (PC), pp. 879–882.
TAPSOFT-1997-EmersonT #approach #reasoning: Generalized Quantitative Temporal Reasoning: An Automata Theoretic Approach (EAE, RJT), pp. 189–200.
TAPSOFT-1997-Thomas #partial order: Automata Theory on Trees and Partial Orders (WT), pp. 20–38.
TAPSOFT-1997-Vaandrager #formal method #testing: A Theory of Testing for Timed Automata (Abstract) (FWV), p. 39.
CADE-1997-Vardi #logic: Alternating Automata: Unifying Truth and Validity Checking for Temporal Logics (MYV), pp. 191–206.
CAV-1997-BozgaMPY #verification: Some Progress in the Symbolic Verification of Timed Automata (MB, OM, AP, SY), pp. 179–190.
CAV-1997-Sistla #invariant #linear #network #using #verification: Parametrized Verification of Linear Networks Using Automata as Invariants (APS), pp. 412–423.
CSL-1997-ComonJ #higher-order: Higher-Order Matching and Tree Automata (HC, YJ), pp. 157–176.
LICS-1997-AsarinCM #theorem: A Kleene Theorem for Timed Automata (EA, PC, OM), pp. 160–171.
LICS-1997-Janin #calculus #fixpoint #reduction #theorem: Automata, Tableaus and a Reduction Theorem for Fixpoint Calculi in Arbitrary Complete Lattices (DJ), pp. 172–182.
ICALP-1996-Hashiguchi #bound #distance: New Upper Bounds to the Limitedness of Distance Automata (KH), pp. 324–335.
ICALP-1996-Kaivola #fixpoint: Fixpoints for Rabin Tree Automata Make Complementation Easy (RK), pp. 312–323.
ICALP-1996-Pin #calculus #first-order #power of: The Expressive Power of Existential First Order Sentences of Büchi’s Sequential Calculus (JÉP), pp. 300–311.
WIA-1996-BiehlKR #algorithm: Algorithms for Guided Tree Automata (MB, NK, TR), pp. 6–25.
WIA-1996-BoneDGM #finite: Time Series Forecasting by Finite-State Automata (RB, CD, AG, DM), pp. 26–34.
WIA-1996-GarzonE #concurrent #implementation #nondeterminism: Dynamical Implementation of Nondeterministic Automata and Concurrent Systems (MHG, EE), pp. 35–49.
WIA-1996-GlennG #finite #implementation: Implementing WS1S via Finite Automata (JG, WIG), pp. 50–63.
WIA-1996-Maurel: Building Automata on Schemata and Acceptability Tables: Application to French Data Adverbials (DM), pp. 72–86.
WIA-1996-Noord #finite: FSA Utilities: A Toolbox to Manipulate Finite-State Automata (GvN), pp. 87–108.
WIA-1996-PontyZC #algorithm #polynomial #regular expression: A New Quadratic Algorithm to Convert a Regular Expression into an Automaton (JLP, DZ, JMC), pp. 109–119.
WIA-1996-SalomaaY #finite #nondeterminism: NFA to DFA Transformation for Finite Languages (KS, SY), pp. 149–158.
WIA-1996-Schubert #how #sorting: How to Use Sorting Procedures to Minimize DFA (BS), pp. 159–166.
RTA-1996-WaltersK #equation #named: EPIC: An Equational Language -Abstract Machine Supporting Tools- (HRW, JFTK), pp. 424–427.
ICPR-1996-Melichar #difference #finite #string: String matching with k differences by finite automata (BM), pp. 256–260.
SAS-1996-RouxR #decidability #hybrid: Uniformity for the Decidability of Hybrid Automata (OFR, VR), pp. 301–316.
SAC-1996-Julstom96a: Evolutionary discovery of DFA size and structure (BAJ), pp. 263–268.
DAC-1996-FerrandiFMPS #network #optimisation: Symbolic Optimization of FSM Networks Based on Sequential ATPG Techniques (FF, FF, EM, MP, DS), pp. 467–470.
DAC-1996-KhatriNKMBS #nondeterminism: Engineering Change in a Non-Deterministic FSM Setting (SPK, AN, SCK, KLM, RKB, ALSV), pp. 451–456.
TAPSOFT-J-1995-Salomaa96 #decidability #equivalence: Decidability of Equivalence for Deterministic Synchronized Tree Automata (KS), pp. 171–192.
TACAS-1996-KleinKKS #program analysis: DFA&OPT-METAFrame: A Tool Kit for Program Analysis and Optimazation (MK, JK, DK, BS), pp. 422–426.
TACAS-1996-MoserM #probability #realtime: Probabilistic Duration Automata for Analyzing Real-Time Systems (LEM, PMMS), pp. 369–390.
CADE-1996-SagonasSW #source code: An Abstract Machine for Fixed-Order Dynamically Stratified Programs (KFS, TS, DSW), pp. 328–342.
CAV-1996-Walukiewicz #game studies #model checking #process: Pushdown Processes: Games and Model Checking (IW), pp. 62–74.
JICSLP-1996-SagonasSW #semantics: An Abstract Machine for Computing the Well-Founded Semantics (KFS, TS, DSW), pp. 274–288.
LICS-1996-DanosHR #game studies #semantics: Game Semantics & Abstract Machines (VD, HH, LR), pp. 394–405.
LICS-1996-Henzinger #formal method #hybrid: The Theory of Hybrid Automata (TAH), pp. 278–292.
LICS-1996-KupfermanSV #word: Relating Word and Tree Automata (OK, SS, MYV), pp. 322–332.
DLT-1995-Cases #self: From Synonymy to Self-Modifying Automata: Q-Diam Language (BC), pp. 454–459.
DLT-1995-CattaneoFM: Rule Space Transformations and One-Dimensional Cellular Automata (GC, EF, GM), pp. 409–419.
DLT-1995-Holzer #finite #on the: On Emptiness and Counting for Alternating Finite Automata (MH), pp. 88–97.
DLT-1995-JancarMPPV #context-free grammar: Restarting Automata, Marcus Grammars and Context-Free Languages (PJ, FM, MP, MP, JV), pp. 102–111.
DLT-1995-KutribR #realtime: Real-Time One-Way Pushdown Cellular Automata Languages (MK, JR), pp. 420–429.
DLT-1995-Nederhof #bidirectional #parsing: Reversible Pushdown Automata and Bidirectional Parsing (MJN), pp. 472–481.
DLT-1995-SchieringT #first-order #logic: Counter-Free Automata, First-Order Logic and Star-Free Expressions (IS, WT), pp. 166–175.
DLT-1995-Weber #transducer: Transforming a Single-Valued Transducer Into a Mealy Machine (AW), pp. 176–185.
ICALP-1995-BaoI #finite: Break Finite Automata Public Key Cryptosystem (FB, YI), pp. 147–158.
ICALP-1995-DurisG: Sensing Versus Nonsensing Automata (PD, ZG), pp. 455–463.
ICALP-1995-GrecoSZ #logic programming #source code: The PushDown Method to Optimize Chain Logic Programs (SG, DS, CZ), pp. 523–534.
ICALP-1995-Henzinger95a #bisimulation #finite #hybrid: Hybrid Automata with Finite Bisimulatioins (TAH), pp. 324–335.
AdaEurope-1995-Bjornfot #ada: Ada and Timed Automata (LB), pp. 389–405.
PEPM-1995-Goubault #higher-order #interpreter: Schedulers as Abstract Interpreter of Higher Dimensional Automata (EG), pp. 134–145.
PLILP-1995-MehlSS: An Abstract Machine for Oz (MM, RS, CS), pp. 151–168.
STOC-1995-HenzingerKPV #decidability #hybrid #question #what: What’s decidable about hybrid automata? (TAH, PWK, AP, PV), pp. 373–382.
TAPSOFT-1995-Salomaa #decidability #equivalence: Decidability of Equivalence for Deterministic Synchronized Tree Automata (KS), pp. 140–154.
CAV-1995-BouajjaniLR #calculus #hybrid #linear: From Duration Calculus To Linear Hybrid Automata (AB, YL, RR), pp. 196–210.
CAV-1995-KrishnanPBV #game studies: The Rabin Index and Chain Automata, with Applications to Automatas and Games (SCK, AP, RKB, PV), pp. 253–266.
ICLP-1995-KrallB #compilation #incremental #prolog: Incremental Global Compilation of Prolog with the Vienna Abstract Machine (AK, TB), pp. 333–347.
ILPS-1995-JanssensBD #abstract interpretation #constraints #logic programming #source code: A Blueprint for an Abstract Machine for Abstract Interpretation of (Constraint) Logic Programs (GJ, MB, VD), pp. 336–350.
LICS-1995-Comon #higher-order #logic #monad: Sequentiality, Second Order Monadic Logic and Tree Automata (HC), pp. 508–517.
LICS-1995-Trakhtenbrot #logic: Origins and Metamorphoses of the Trinity: Logic, Nets, Automata (BAT), pp. 506–507.
ICALP-1994-Cerans #relational: Deciding Properties of Integral Relational Automata (KC), pp. 35–46.
ICALP-1994-GlobermanH #complexity #logic #multi: Complexity Results for Multi-Pebble Automata and their Logics (NG, DH), pp. 73–82.
ICALP-1994-KlarlundMS: Determinizing Asynchronous Automata (NK, MM, MAS), pp. 130–141.
ICALP-1994-Muscholl #on the: On the Complementation of Büchi Asynchronous Cellular Automata (AM), pp. 142–153.
FME-1994-PaechR #behaviour #concept #modelling #refinement: A new Concept of Refinement used for Behaviour Modelling with Automata (BP, BR), pp. 154–174.
FME-1994-RitchieBH #case study #experience #using: Experiences in Using the Abstract Machine Notation in a GKS Case Study (BR, JB, HPH), pp. 93–104.
TAGT-1994-BrandenburgS #graph #linear: Graph Automata for Linear Graph Languages (FJB, KS), pp. 336–350.
DAC-1994-WangB #network: Permissible Observability Relations in FSM Networks (HYW, RKB), pp. 677–683.
EDAC-1994-ChoHMPS #algorithm #approximate #composition #traversal: A State Space Decomposition Algorithm for Approximate FSM Traversal (HC, GDH, EM, MP, FS), pp. 137–141.
EDAC-1994-LiW #fault #logic #simulation: Logic and Fault Simulation by Cellular Automata (YLL, CWW), pp. 552–556.
EDAC-1994-WatanabeB #nondeterminism #pseudo: State Minimization of Pseudo Non-Deterministic FSM’s (YW, RKB), pp. 184–191.
EDAC-1994-YangMD #constraints #scheduling: Scheduling with Environmental Constraints based on Automata Representations (JCYY, GDM, MD), pp. 495–501.
ESOP-1994-Moreau #continuation #evaluation #functional #parallel #source code: The PCKS-Machine: An Abstract Machine for Sound Evaluation of Parallel Functional Programs with First-Class Continuations (LM), pp. 424–438.
STOC-1994-CondonHPW #finite #nondeterminism #on the #power of #probability: On the power of finite automata with both nondeterministic and probabilistic states (AC, LH, SP, AW), pp. 676–685.
CAV-1994-AlurFH: A Determinizable Class of Timed Automata (RA, LF, TAH), pp. 1–13.
CAV-1994-LamB: Criteria for the Simple Path Property in Timed Automata (WKCL, RKB), pp. 27–40.
CAV-1994-McManisV #decidability #hybrid: Suspension Automata: A Decidable Class of Hybrid Automata (JM, PV), pp. 105–117.
ILPS-1994-SwiftW94a #source code: An Abstract Machine for SLG Resolution: Definite Programs (TS, DSW), pp. 633–652.
ICALP-1993-BrachoD #concurrent: From Domains to Automata with Concurrency (FB, MD), pp. 669–681.
ICALP-1993-Gupta #finite #product line: Finite Automata as Characterizations of Minor Closed Tree Families (AG), pp. 359–370.
ICALP-1993-MichauxV #theorem: Cobham’s Ttheorem seen through Büchi’s Theorem (CM, RV), pp. 325–334.
FME-1993-DoumencM #execution #parallel: The Parallel Abstract Machine: A Common Execution Model for FDTs (GD, JFM), pp. 285–293.
RTA-1993-CaronCD #constraints: Encompassment Properties and Automata with Constraints (ACC, JLC, MD), pp. 328–342.
DAC-1993-ChoHMPS #algorithm #approximate #traversal: Algorithms for Approximate FSM Traversal (HC, GDH, EM, BP, FS), pp. 25–30.
STOC-1993-FreundKRRSS #finite #learning #performance #random: Efficient learning of typical finite automata from random walks (YF, MJK, DR, RR, RES, LS), pp. 315–324.
TAPSOFT-1993-BeauquirerN #constraints #infinity: Automata on Infinite Trees with Counting Constraints (DB, DN), pp. 266–281.
TAPSOFT-1993-NiehrenP #set: Feature Automata and Recognizable Sets of Feature Trees (JN, AP), pp. 356–375.
CAV-1993-LamB: Alternating RQ Timed Automata (WKCL, RKB), pp. 237–252.
CAV-1993-ProbstL #behaviour #verification: Verifying Timed Behavior Automata with Input/Output Critical Races (DKP, HFL), pp. 424–437.
ILPS-1993-FribourgP #concurrent #constraints: Concurrent Constraint Automata (LF, MVP), p. 656.
HT-ECHT-1992-StottsFR #verification: Hyperdocuments as Automata: Trace-Based Browsing Property Verification (PDS, RF, JCR), pp. 272–281.
ICALP-1992-GastinP #infinity: Asynchronous Cellular Automata for Infinite Traces (PG, AP), pp. 583–594.
ICALP-1992-IbarraT #finite: New Results Concerning Synchronized Finite Automata (OHI, NQT), pp. 126–137.
PLDI-1992-JaffarMSY: An Abstract Machine for CLP(R) (JJ, SM, PJS, RHCY), pp. 128–139.
PLILP-1992-BarthelemyC: Subsumption-oriented Push-Down Automata (FB, EVdlC), pp. 100–114.
PLILP-1992-Hans: A Complete Indexing Scheme for WAM-based Abstract Machines (WH), pp. 232–244.
PLILP-1992-Muck #functional #logic programming #named #source code: CAMEL: An Extension of the Categorial Abstract Machine to Compile Functional/Logic Programs (AM), pp. 341–354.
CC-1992-Pettersson #compilation #finite: A Term Pattern-Match Compiler Inspired by Finite Automata Theory (MP), pp. 258–270.
STOC-1992-Safra #exponential: Exponential Determinization for ω-Automata with Strong-Fairness Acceptance Condition (SS), pp. 275–282.
CAV-1992-ProbstL #behaviour #constraints #verification: Verifying Timed Behavior Automata with Nonbinary Delay Constraints (DKP, HFL), pp. 123–136.
LICS-1992-Klarlund #metric #set: Progress Measures, Immediate Determinacy, and a Subset Construction for Tree Automata (NK), pp. 382–393.
ICALP-1991-JiangR #nondeterminism #problem: Minimal NFA Problems Are Hard (TJ, BR), pp. 629–640.
ICALP-1991-KanepsF #probability #regular expression: Running Time to Recognize Nonregular Languages by 2-Way Probabilistic Automata (JK, RF), pp. 174–185.
ICALP-1991-Thomas #logic #on the: On Logics, Tilings, and Automata (WT), pp. 441–454.
RTA-1991-CoquideDGV #bottom-up #term rewriting: Bottom-Up Tree Pushdown Automata and Rewrite Systems (JLC, MD, RG, SV), pp. 287–298.
FPCA-1991-Hannan: Making Abstract Machines Less Abstract (JH), pp. 618–635.
ML-1991-MaclinS #finite: Refining Domain Theories Expressed as Finite-State Automata (RM, JWS), pp. 524–528.
PEPM-1991-Hannan #staging: Staging Transformations for Abstract Machines (JH), pp. 130–141.
ASPLOS-1991-CullerSSEW #hardware #parallel #thread: Fine-Grain Parallelism with Minimal Hardware Support: A Compiler-Controlled Threaded Abstract Machine (DEC, AS, KES, TvE, JW), pp. 164–175.
DAC-1991-CiesielskiSD #approach #encoding: A Unified Approach to Input-Output Encoding for FSM State Assignment (MJC, JJS, MD), pp. 176–181.
DAC-1991-GeigerM #algebra #benchmark #composition #metric: FSM Decomposition Revisited: Algebraic Structure Theory Applied to MCNC Benchmark FSMs (MG, TMW), pp. 182–185.
ADC-1991-Berry #concurrent: Concurrent Abstract Machines (Abstract) (GB), p. 49.
CAAP-1991-Caron #bound #linear #term rewriting: Linear Bounded Automata and Rewrite Systems: Influence of Initial Configurations on Decision Properties (ACC), pp. 74–89.
CAV-1991-Jong #approach #logic: An Automata Theoretic Approach to Temporal Logic (GGdJ), pp. 477–487.
CSL-1991-BarguryM #multi #power of #transitive: The Expressive Power of Transitive Closue and 2-way Multihead Automata (YB, JAM), pp. 1–14.
CSL-1991-ThistleW #problem: Control of ω-Automata, Church’s Problem, and the Emptiness Problem for Tree ω-Automata (JGT, WMW), pp. 367–382.
ICLP-1991-Ait-Kaci: Warren’s Abstract Machine (HAK), p. 939.
ICLP-1991-PuchhammerS #design #prototype: A Rule-oriented FSM Design System with Prototyping Capabilities (MP, RS), p. 891.
ISLP-1991-BeierleMS #order #polymorphism: Extending the Warren Abstract Machine to Polymorphic Order-Sorted Resolution (CB, GM, HS), pp. 272–286.
LICS-1991-KlarlundK #metric: Rabin Measures and Their Applications to Fairness and Automata Theory (NK, DK), pp. 256–265.
LICS-1991-Vaandrager #algebra #on the #process: On the Relationship Between Process Algebra and Input/Output Automata (FWV), pp. 387–398.
ICALP-1990-AlurD #modelling #realtime: Automata For Modeling Real-Time Systems (RA, DLD), pp. 322–335.
ICALP-1990-Anselmo #multi: Two-Way Automata with Multiplicity (MA), pp. 88–102.
ICALP-1990-Droste #concurrent: Concurrency, Automata and Domains (MD), pp. 195–208.
ICALP-1990-Kuich #algebra: ω-Continuous Semirings, Algebraic Systems and Pushdown Automata (WK), pp. 103–110.
LFP-1990-Cregut #normalisation: An Abstract Machine for λ-Terms Normalization (PC), pp. 333–340.
LFP-1990-HannanM #semantics: From Operational Semantics to Abstract Machines: Preliminary Results (JH, DM), pp. 323–332.
GG-1990-Lautemann #composition: Tree Automata, Tree Decomposition and Hyperedge Replacement (CL), pp. 520–537.
PLILP-1990-KrallN: The Vienna Abstract Machine (AK, UN), pp. 121–135.
POPL-1990-BerryB: The Chemical Abstract Machine (GB, GB), pp. 81–94.
POPL-1990-Stark #concurrent #on the: On the Relations Computable by a Class of Concurrent Automata (EWS), pp. 329–340.
DAC-1990-Wolf #behaviour #network #synthesis: The FSM Network Model for Behavioral Synthesis of Control-Dominated Machines (WW), pp. 692–697.
STOC-1990-HarjuK #decidability #equivalence #finite #multi: Decidability of the Multiplicity Equivalence of Multitape Finite Automata (TH, JK), pp. 477–481.
CAV-1990-MadelaineV #algebra #process: Finiteness Conditions and Structural Construction of Automata for All Process Algebras (EM, DV), pp. 353–363.
CAV-1990-Yodaiken #algebra #feedback: The Algebraic Feedback Product of Automata (VY), pp. 263–271.
CLP-1990-ZhouTU90 #prolog: A Matching Tree Oriented Abstract Machine for Prolog (NFZ, TT, KU), pp. 159–173.
CSL-1990-ArnborgPS #higher-order #logic #monad: Monadic Second Order Logic, Tree Automata and Forbidden Minors (SA, AP, DS), pp. 1–16.
NACLP-1990-AlkalajLS #development: FCP Sequential Abstract Machine Characteristics for the Systems Development Workload (LA, TL, EYS), pp. 321–339.
PODS-1989-Vardi #database: Automata Theory for Database Theoreticans (MYV), pp. 83–92.
ICALP-1989-EngelfrietH #infinity #word: Automata with Storage on Infinite Words (JE, HJH), pp. 289–303.
ICALP-1989-McKenzieT #complexity: Automata Theory Meets Circuit Complexity (PM, DT), pp. 589–602.
FPCA-1989-George #graph #parallel #reduction: An Abstract Machine for Parallel Graph Reduction (LG), pp. 214–229.
KR-1989-Rosenschein: Synthesizing Information-Tracking Automata from Environment Descriptions (SJR), pp. 386–393.
STOC-1989-KearnsV #encryption #finite #learning: Cryptographic Limitations on Learning Boolean Formulae and Finite Automata (MJK, LGV), pp. 433–444.
STOC-1989-PittW #approximate #consistency #polynomial #problem: The Minimum Consistent DFA Problem Cannot Be Approximated within any Polynomial (LP, MKW), pp. 421–432.
STOC-1989-RivestS #finite #sequence #using: Inference of Finite Automata Using Homing Sequences (RLR, RES), pp. 411–420.
STOC-1989-SafraV #logic #on the: On ω-Automata and Temporal Logic (SS, MYV), pp. 127–137.
LICS-1989-EmersonJ #on the: On Simultaneously Determinizing and Complementing ω-Automata (EAE, CSJ), pp. 333–342.
ICALP-1988-CoriM #approximate #distributed: Approximation of a TRace, Asynchronous Automata and the Ordering of Events in a Distributed System (RC, YM), pp. 147–161.
ICALP-1988-Eppstein #design #finite #sequence: Reset Sequences for Finite Automata with Application to Design of Parts Orienters (DE), pp. 230–238.
ICALP-1988-Tao #finite #linear: Invertibility of Linear Finite Automata Over a Ring (RjT), pp. 489–501.
ALP-1988-FulopV #linear #set #term rewriting: A Characterization of Irreducible Sets Modulo Left-Linear Term Rewriting Systems by Tree Automata (ZF, SV), p. 157.
CADE-1988-ButlerLO #compilation #performance #program transformation #prolog: Notes on Prolog Program Transformations, Prolog Style, and Efficient Compilation to The Warren Abstract Machine (RB, RL, RO), pp. 323–332.
CSL-1988-Wagner #logic #on the #problem #source code: On the Emptiness Problem of Tree Automata and Completeness of Modal Logics of Programs (HW), pp. 384–399.
JICSCP-1988-BiswasSY88 #logic programming #parallel #scalability #source code #strict: A Scalable Abstract Machine Model to Support Limited-OR (LOR) / Restricted-AND Parallelism (RAP) in Logic Programs (PB, SCS, DYYY), pp. 1160–1179.
LICS-1988-MullerSS #decidability #exponential #logic #why: Weak Alternating Automata Give a Simple Explanation of Why Most Temporal and Dynamic Logics are Decidable in Exponential Time (DEM, AS, PES), pp. 422–427.
HT-1987-CampbellG #hypermedia #named: HAM: A General-Purpose Hypertext Abstract Machine (BC, JMG), pp. 21–32.
ICALP-1987-BarringtonT: Non-Uniform Automata Over Groups (DAMB, DT), pp. 163–173.
ICALP-1987-Beauquier: Minimal Automaton of a Rational Cover (DB), pp. 174–189.
ICALP-1987-Metivier #algorithm #graph: An Algorithm for Computing Asynchronous Automata in the Case of Acyclic Non-Commutation Graphs (YM), pp. 226–236.
ICALP-1987-Pin #finite #on the: On the Language Accepted by Finite Reversible Automata (JÉP), pp. 237–249.
RTA-1987-Benois #algorithm #complexity #regular expression #term rewriting: Descendants of Regular Language in a Class of Rewriting Systems: Algorithm and Complexity of an Automata Construction (MB), pp. 121–132.
FPCA-1987-FairbairnW #combinator #lazy evaluation #named: TIM: A simple, lazy abstract machine to execute supercombinatorics (JF, SW), pp. 34–45.
SIGIR-1987-OommenM #clustering #learning #performance #probability #using: Fast Object Partitioning Using Stochastic Learning Automata (BJO, DCYM), pp. 111–122.
ESEC-1987-CurrieFC #named: Ten15: An Abstract Machine for Portable Environments (IFC, JMF, PWC), pp. 138–148.
SLP-1987-TouatiD87 #empirical: An Empirical Study of the Warren Abstract Machine (HJT, AMD), pp. 114–124.
ICALP-1986-GoralcikK #on the #word: On Discerning Words by Automata (PG, VK), pp. 116–122.
ICALP-1986-MullerSS #complexity #monad: Alternating Automata. The Weak Monadic Theory of the Tree, and its Complexity (DEM, AS, PES), pp. 275–283.
LFP-1986-MaunyS #category theory #functional #implementation: Implementing Functional Languages in the Categorical Abstract Machine (MM, AS), pp. 266–278.
ICLP-1986-Hermenegildo86 #execution #logic programming #source code #strict: An Abstract Machine for Restricted AND-Parallel Execution of Logic Programs (MVH), pp. 25–39.
ICLP-1986-Levy86 #haskell #set: A GHC Abstract Machine and Instruction Set (JL), pp. 157–171.
LICS-1986-BensonB #bisimulation: Strong Bisimulation of State Automata (DBB, OBS), pp. 77–81.
LICS-1986-PerrinS #decidability #equivalence #integer #monad: Automata on the Integers, Recurrence Distinguishability, and the Equivalence and Decidability of Monadic Theories (DP, PES), pp. 301–304.
ICALP-1985-Chrobak #multi: Hierarchies of One-Way Multihead Automata Languages (MC), pp. 101–110.
ICALP-1985-SistlaVW #logic #problem: The Complementation Problem for Büchi Automata with Applications to Temporal Logic (APS, MYV, PW), pp. 465–474.
FPCA-1985-CousineauCM85 #category theory: The Categorical Abstract Machine (GC, PLC, MM), pp. 50–64.
DAC-1985-ZaraRNS #data type #functional #modelling: An abstract machine data structure for non-procedural functional models (RVZ, KR, GN, HS), pp. 753–756.
CAAP-1985-FachiniN #bottom-up: Synchronized Bottom-Up Tree Automata and L-Systems (EF, MN), pp. 298–307.
ICALP-1984-BlumerBEHM #linear #online #set #word: Building the Minimal DFA for the Set of all Subwords of a Word On-line in Linear Time (AB, JB, AE, DH, RMM), pp. 109–118.
ICALP-1984-Girault-Beauquier #behaviour #finite #infinity: Some Results About Finite and Infinite Behaviours of a Pushdown Automaton (DB), pp. 187–195.
DAC-1984-MeyerAP #design: A VLSI FSM design system (MJM, PA, RGP), pp. 434–440.
STOC-1984-VardiW #logic #source code: Automata Theoretic Techniques for Modal Logics of Programs (MYV, PW), pp. 446–456.
ICALP-1983-Kamimura #attribute grammar: Tree Automata and Attribute Grammars (TK), pp. 374–384.
STOC-1983-Engelfriet #complexity: Iterated Pushdown Automata and Complexity Classes (JE), pp. 365–373.
STOC-1983-Gacs #reliability: Reliable Computation with Cellular Automata (PG), pp. 32–41.
ICALP-1982-DurisG #bound #on the: On Reversal-Bounded Counter Machines and on Pushdown Automata with a Bound on the Size of the Pushdown Store (PD, ZG), pp. 166–175.
ICALP-1982-DurisH #finite #multi: Multihead Finite State Automata and Concatenation (PD, JH), pp. 176–186.
DAC-1982-EustaceM #approach #design #finite: A Deterministic finite automaton approach to design rule checking for VLSI (RAE, AM), pp. 712–717.
STOC-1982-GurevichH #game studies: Trees, Automata, and Games (YG, LH), pp. 60–65.
ICALP-1981-King #finite #multi: Alternating Multihead Finite Automata (KNK), pp. 506–520.
STOC-1981-DurisG: Fooling a Two-Way Automaton or One Pushdown Store Is Better Than One Counter for Two Way Machines (PD, ZG), pp. 177–188.
STOC-1981-MullerS #graph #higher-order #logic #problem #reachability: Pushdown Automata, Graphs, Ends, Second-Order Logic, and Reachability Problems (DEM, PES), pp. 46–54.
ICALP-1980-Berman: A Note on Sweeping Automata (PB), pp. 91–97.
STOC-1980-Ukkonen #equivalence #realtime: A Decision Method for the Equivalence of some Non-Real-Time Deterministic Pushdown Automata (EU), pp. 29–38.
ICALP-1979-Ury #composition #linear: Optimal Decomposition of Linear Automata (LÚ), pp. 659–667.
STOC-1979-Sipser #bound: Lower Bounds on the Size of Sweeping Automata (MS), pp. 360–364.
GG-1978-WuR #graph: Cellular Graph Automata (AYW, AR), pp. 464–475.
ICSE-1978-Thalmann #design #evolution: Evolution in the Design of Abstract Machines for Software Portability (DT), pp. 333–340.
STOC-1978-SakodaS #finite #nondeterminism: Nondeterminism and the Size of Two Way Finite Automata (WJS, MS), pp. 275–286.
ICALP-1977-BertoniMT #probability #problem #recursion: Some Recursive Unsolvable Problems Relating to Isolated Cutpoints in Probabilistic Automata (AB, GM, MT), pp. 87–94.
STOC-1977-Sudborough #bound: Separating Tape Bounded Auxiliary Pushdown Automata Classes (IHS), pp. 208–217.
STOC-1976-Sudborough #context-free grammar #multi #on the #power of: On Deterministic Context-Free Languages, Multihead Automata, and the Power of an Auxiliary Pushdown Store (IHS), pp. 141–148.
ICALP-1974-Gecseg #composition: Composition of Automata (FG), pp. 351–363.
STOC-1974-Valiant #decidability #equivalence: The Decidability of Equivalence for Deterministic Finite-Turn Pushdown Automata (LGV), pp. 27–32.
ICALP-1972-HenkeIW #recursion: Hierarchies of Primitive Recursive Wordfunctions and Transductions Defined by Automata (FWvH, KI, KW), pp. 549–561.
ICALP-1972-HsiaY #finite: Finite Automata with Markers (PH, RTY), pp. 443–451.
ICALP-1972-Monien #bound #turing machine: Relationship between Pushdown Automata and Tape-Bounded Turing Machines (BM), pp. 575–583.
ICALP-1972-PazR #approximate #linear #problem: Linear Automata — Approximation Problem (AP, MR), pp. 99–102.
STOC-1972-Savitch: Maze Recognizing Automata (WJS), pp. 151–156.
STOC-1971-Buttelmann #finite #generative #on the #strict: On Generalized Finite Automata and Unrestricted Generative Grammars (HWB), pp. 63–77.
STOC-1971-LevyJ: Some Results in Tree Automata (LSL, AKJ), pp. 78–85.
STOC-1970-Ellis #probability: Probabilistic Tree Automata (CAE), pp. 198–205.
STOC-1970-Perrot #finite #monad #on the: On The Relationship between Finite Automata, Finite Monoids, and Prefix Codes (JFP), pp. 217–220.
STOC-1969-Cole #realtime: Pushdown Store Machines and Real-Time Computation (SNC), pp. 233–245.
STOC-1969-Cook: Variations on Pushdown Machines (SAC), pp. 229–231.
STOC-1969-Thatcher #finite: Transformations and Translations from the Point of View of Generalized Finite Automata Theory (JWT), pp. 129–142.