Stem automata$ (all stems)

1270 papers:

CASE-2015-Schwung #automaton #cyber-physical #hybrid #modelling #using

Cyber-physical modeling of compression systems using hybrid automata (AS), pp. 1125–1130.

CASE-2015-ZhangWZZ #automaton #learning #optimisation #performance

Incorporation of ordinal optimization into learning automata for high learning efficiency (JZ, CW, DZ, MZ), pp. 1206–1211.

FASE-2015-AndriescuMI #automaton #data type #using

Composing Message Translators and Inferring Their Data Types Using Tree Automata (EA, TM, VI), pp. 35–50.

FoSSaCS-2015-ChadhaSVB #automaton #decidability #probability

Decidable and Expressive Classes of Probabilistic Automata (RC, APS, MV, YB), pp. 200–214.

FoSSaCS-2015-Cotton-BarrattH #automaton #decidability #memory management #ml

Fragments of ML Decidable by Nested Data Class Memory Automata (CCB, DH, ASM, CHLO), pp. 249–263.

FoSSaCS-2015-KieferMW #automaton #multi

Minimisation of Multiplicity Tree Automata (SK, IM, JW), pp. 297–311.

TACAS-2015-HolikHLRSV #analysis #automaton #contest #named #using

Forester: Shape Analysis Using Tree Automata — (Competition Contribution) (LH, MH, OL, AR, JS, TV), pp. 432–435.

TACAS-2015-KiniV #automaton #ltl #probability

Limit Deterministic and Probabilistic Automata for LTL ∖ GU (DK, MV), pp. 628–642.

TACAS-2015-RenaultDKP #automaton #model checking #parallel

Parallel Explicit Model Checking for Generalized Büchi Automata (ER, ADL, FK, DP), pp. 613–627.

TACAS-2015-Sankur #analysis #automaton #robust

Symbolic Quantitative Robustness Analysis of Timed Automata (OS), pp. 484–498.

CIAA-J-2013-CaralpRT15 #automaton

Trimming visibly pushdown automata (MC, PAR, JMT), pp. 13–29.

CIAA-J-2013-DebarbieuxGNSZ15 #automaton #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 #automaton #taxonomy

Compressed automata for dictionary matching (TI, TN, SI, HB, MT), pp. 30–41.

CIAA-J-2013-Konstantinidis15 #automaton #implementation

Implementation and Application of Automata (CIAA 2013) (SK), p. 1.

CIAA-J-2013-KutribMMPW15 #automaton #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 #automaton

Hyper-optimization for deterministic tree automata (AM), pp. 72–87.

CIAA-2015-Bollig #automaton #concurrent #logic #modelling

Automata and Logics for Concurrent Systems: Five Models in Five Pages (BB), pp. 3–12.

CIAA-2015-BorsottiBCM #ambiguity #automaton #parsing #regular expression

From Ambiguous Regular Expressions to Deterministic Parsing Automata (AB, LB, SCR, AM), pp. 35–48.

CIAA-2015-DangDFH #automaton #security

Security of Numerical Sensors in Automata (ZD, DD, TRF, WJHI), pp. 76–88.

CIAA-2015-FernauPS #automaton #complexity #finite

Jumping Finite Automata: Characterizations and Complexity (HF, MP, MLS), pp. 89–101.

CIAA-2015-Giaquinta #automaton #nondeterminism

Run-Length Encoded Nondeterministic KMP and Suffix Automata (EG), pp. 102–113.

CIAA-2015-GruberHJ #automaton #finite #nondeterminism

More on Deterministic and Nondeterministic Finite Cover Automata — Extended Abstract (HG, MH, SJ), pp. 114–126.

CIAA-2015-HeamJ #automaton #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 #automaton #generative #random #realtime

Random Generation and Enumeration of Accessible Deterministic Real-Time Pushdown Automata (PCH, JLJ), pp. 153–164.

CIAA-2015-Hulden #automaton #finite #regular expression

From Two-Way to One-Way Finite Automata — Three Regular Expression-Based Methods (MH), pp. 176–187.

CIAA-2015-KushikY #automaton #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 #automaton #on the

On the Disambiguation of Weighted Automata (MM, MDR), pp. 263–278.

CIAA-2015-NakanishiY #automaton #problem #quantum

Classical and Quantum Counter Automata on Promise Problems (MN, AY), pp. 224–237.

CIAA-2015-Watson #automaton #finite #hardware #implementation #regular expression

Hardware Implementations of Finite Automata and Regular Expressions — Extended Abstract (BWW), pp. 13–17.

DLT-2015-BianchiHK #automaton #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 #automaton #complexity #finite #monad

Complexity Analysis: Transformation Monoids of Finite Automata (CB, HUS), pp. 143–154.

DLT-2015-CzybaST #automaton #finite #infinity #modelling

Finite Automata Over Infinite Alphabets: Two Models with Transitions for Local Change (CC, CS, WT), pp. 203–214.

DLT-2015-GainutdinovaY #automaton #probability #problem #quantum

Unary Probabilistic and Quantum Automata on Promise Problems (AG, AY), pp. 252–263.

DLT-2015-HolzerJK #automaton #finite

Minimal Reversible Deterministic Finite Automata (MH, SJ, MK), pp. 276–287.

DLT-2015-Marsault #automaton

Surminimisation of Automata (VM), pp. 352–363.

DLT-2015-MasopustT #automaton #complexity #on the #testing

On the Complexity of k-Piecewise Testability and the Depth of Automata (TM, MT), pp. 364–376.

DLT-2015-OttoK #automaton #order

Deterministic Ordered Restarting Automata that Compute Functions (FO, KK), pp. 401–412.

ICALP-v2-2015-BenesBLS #automaton #parametricity

Language Emptiness of Continuous-Time Parametric Timed Automata (NB, PB, KGL, JS), pp. 69–81.

ICALP-v2-2015-ChatterjeeHIO #automaton #distance #edit distance

Edit Distance for Pushdown Automata (KC, TAH, RIJ, JO), pp. 121–133.

ICALP-v2-2015-Finkel #automaton #infinity #scalability #theorem #word

Incompleteness Theorems, Large Cardinals, and Automata over Infinite Words (OF), pp. 222–233.

ICALP-v2-2015-KuperbergS #automaton #nondeterminism #on the

On Determinisation of Good-for-Games Automata (DK, MS), pp. 299–310.

LATA-2015-AutiliIMST #automation #specification #synthesis

Automated Synthesis of Application-Layer Connectors from Automata-Based Specifications (MA, PI, FM, RS, MT), pp. 3–24.

LATA-2015-BabariD #automaton #logic #theorem

A Nivat Theorem for Weighted Picture Automata and Weighted MSO Logic (PB, MD), pp. 703–715.

LATA-2015-BachmeierLS #automaton #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 #automaton #performance

An Efficient Best-Trees Algorithm for Weighted Tree Automata over the Tropical Semiring (JB, FD, NZ), pp. 97–108.

LATA-2015-Cotton-BarrattMO #automaton #memory management

Weak and Nested Class Memory Automata (CCB, ASM, CHLO), pp. 188–199.

LATA-2015-GodinKP #automaton #on the

On Torsion-Free Semigroups Generated by Invertible Reversible Mealy Automata (TG, IK, MP), pp. 328–339.

LATA-2015-KrishnaMT #automaton #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 #automaton #network #on the

On Observability of Automata Networks via Computational Algebra (RL, YH), pp. 249–262.

LATA-2015-Peltier #approach #reasoning

Reasoning on Schemas of Formulas: An Automata-Based Approach (NP), pp. 263–274.

LATA-2015-Salem #automaton #ltl #model checking #testing

Single-Pass Testing Automata for LTL Model Checking (AEBS), pp. 563–576.

LATA-2015-ThiemannS #automaton #regular expression

From ω-Regular Expressions to Büchi Automata via Partial Derivatives (PT, MS), pp. 287–298.

FM-2015-KroeningLW #automaton #bound #model checking #proving #safety

Proving Safety with Trace Automata and Bounded Model Checking (DK, ML, GW), pp. 325–341.

ICEIS-v2-2015-CeredaN #adaptation #automaton #recommendation

A Recommendation Engine based on Adaptive Automata (PRMC, JJN), pp. 594–601.

SEKE-2015-AssuncaoFLSV #automaton #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.

QAPL-2015-AldiniB #automaton #markov #similarity

Expected-Delay-Summing Weak Bisimilarity for Markov Automata (AA, MB), pp. 1–15.

POPL-2015-HeGWZ #automaton #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 #automaton #bytecode #semantics #similarity

Abstract Symbolic Automata: Mixed syntactic/semantic similarity analysis of executables (MDP, RG, AL, IM), pp. 329–341.

CADE-2015-GransdenWR #automaton #named #proving #using

SEPIA: Search for Proofs Using Inferred Automata (TG, NW, RR), pp. 246–255.

CADE-2015-Paulson #automaton #finite #formal method #set #using

A Formalisation of Finite Automata Using Hereditarily Finite Sets (LCP), pp. 231–245.

CAV-2015-AydinBB #constraints #string

Automata-Based Model Counting for String Constraints (AA, LB, TB), pp. 255–272.

CAV-2015-BabiakBDKKM0S

The Hanoi Omega-Automata Format (TB, FB, ADL, JK, JK, DM, DP, JS), pp. 479–486.

CAV-2015-IsbernerHS #automaton #framework #learning #open source

The Open-Source LearnLib — A Framework for Active Automata Learning (MI, FH, BS), pp. 487–495.

CSL-2015-MazowieckiR #automaton #logic #towards

Maximal Partition Logic: Towards a Logical Characterization of Copyless Cost Register Automata (FM, CR), pp. 144–159.

CSL-2015-SchubertDB #automaton #proving

Automata Theoretic Account of Proof Search (AS, WD, HPB), pp. 128–143.

ICLP-2015-VolkerI #automaton #logic programming

Logic Programming for Cellular Automata (MV, KI).

LICS-2015-BallePP #approximate #automaton #canonical

A Canonical Form for Weighted Automata and Applications to Approximate Minimization (BB, PP, DP), pp. 701–712.

LICS-2015-BrunetP #automaton #petri net

Petri Automata for Kleene Allegories (PB, DP), pp. 68–79.

LICS-2015-ChatterjeeHO #automaton

Nested Weighted Automata (KC, TAH, JO), pp. 725–737.

LICS-2015-ClementeL #automaton #revisited

Timed Pushdown Automata Revisited (LC, SL), pp. 738–749.

LICS-2015-KobayashiL #abstraction #model checking #refinement

Automata-Based Abstraction Refinement for μHORS Model Checking (NK, XL), pp. 713–724.

LICS-2015-MurawskiRT #automaton #similarity

Bisimilarity in Fresh-Register Automata (ASM, SJR, NT), pp. 156–167.

LICS-2015-Reiter #automaton #distributed #graph

Distributed Graph Automata (FR), pp. 192–201.

RTA-2015-EndrullisZ #automaton #finite #proving

Proving non-termination by finite automata (JE, HZ), pp. 160–176.

TLCA-2015-Riba #automaton

Fibrations of Tree Automata (CR), pp. 302–316.

VMCAI-2015-BraitlingFHWBH #automaton #markov #metric

Abstraction-Based Computation of Reward Measures for Markov Automata (BB, LMFF, HH, RW, BB, HH), pp. 172–189.

VMCAI-2015-KafleG #horn clause #refinement #verification

Tree Automata-Based Refinement with Application to Horn Clause Verification (BK, JPG), pp. 209–226.

TFPIE-2014-MorazanA #automaton #formal method #functional #student

Functional Automata — Formal Languages for Computer Science Students (MTM, RA), pp. 19–32.

TACAS-2014-SalemDKT #automaton #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 #automaton #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 #automaton #functional #source code #static analysis #towards #using

Towards Static Analysis of Functional Programs Using Tree Automata Completion (TG), pp. 147–161.

FLOPS-2014-CaiO #automaton

Well-Structured Pushdown System: Case of Dense Timed Pushdown Automata (XC, MO), pp. 336–352.

DLT-J-2013-BertoniCD14 #automaton #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-KucukSY14 #automaton #finite

Finite Automata with Advice Tapes (UK, ACCS, AY), pp. 987–1000.

DLT-J-2013-KutribMW14a #automaton #finite #multi

Stateless One-Way Multi-Head Finite Automata with Pebbles (MK, AM, MW), pp. 1141–1160.

AFL-2014-BordihnKM #automaton #communication #finite #parallel

Measuring Communication in Parallel Communicating Finite Automata (HB, MK, AM), pp. 124–138.

AFL-2014-Campeanu #automaton #finite #nondeterminism

Simplifying Nondeterministic Finite Cover Automata (CC), pp. 162–173.

AFL-2014-CarninoL #ambiguity #automaton #on the

On Determinism and Unambiguity of Weighted Two-way Automata (VC, SL), pp. 188–200.

AFL-2014-CevorovaJMPS #automaton

Operations on Automata with All States Final (KC, GJ, PM, MP, JS), pp. 201–215.

AFL-2014-GruberH #automaton #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-HutagalungLL #automaton #game studies #simulation

Buffered Simulation Games for Büchi Automata (MH, ML, ÉL), pp. 286–300.

AFL-2014-Ivan #automaton

Synchronizing weighted automata (SI), pp. 301–313.

AFL-2014-Klima #algebra #automaton #on the

On Varieties of Automata Enriched with an Algebraic Structure (Extended Abstract) (OK), pp. 49–54.

AFL-2014-Loding #automaton #infinity #problem #word

Decision Problems for Deterministic Pushdown Automata on Infinite Words (CL), pp. 55–73.

AFL-2014-MalettiQ #automaton

Hyper-Minimization for Deterministic Weighted Tree Automata (AM, DQ), pp. 314–326.

AFL-2014-MignotSZ14a #automaton #equation

$k$-Position, Follow, Equation and $k$-C-Continuation Tree Automata Constructions (LM, NOS, DZ), pp. 327–341.

AFL-2014-Vorel #automaton #set #transitive

Subset Synchronization of Transitive Automata (VV), pp. 370–381.

CIAA-2014-BianchiMP #automaton #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 #automaton

Unary Languages Recognized by Two-Way One-Counter Automata (MDB, AY), pp. 148–161.

CIAA-2014-BieglerM #automaton #finite #on the #word

On Comparing Deterministic Finite Automata and the Shuffle of Words (FB, IM), pp. 98–109.

CIAA-2014-Blanchet-SadriGS #automaton

Minimal Partial Languages and Automata (FBS, KG, AS), pp. 110–123.

CIAA-2014-DemailleDLSS #automaton #type system

A Type System for Weighted Automata and Rational Expressions (AD, ADL, SL, LS, JS), pp. 162–175.

CIAA-2014-Fujiyoshi #automaton #multi #recognition

Recognition of Labeled Multidigraphs by Spanning Tree Automata (AF), pp. 188–199.

CIAA-2014-GusevP #automaton

Reset Thresholds of Automata with Two Cycle Lengths (VVG, EVP), pp. 200–210.

CIAA-2014-MaiaMR #automaton #similarity

Partial Derivative and Position Bisimilarity Automata (EM, NM, RR), pp. 264–277.

CIAA-2014-Otto #automaton #bibliography

Restarting Automata for Picture Languages: A Survey on Recent Developments (FO), pp. 16–41.

CIAA-2014-Pighizzini #automaton

Investigations on Automata and Languages over a Unary Alphabet (GP), pp. 42–57.

CIAA-2014-PittouR #automaton #infinity

Weighted Variable Automata over Infinite Alphabets (MP, GR), pp. 304–317.

CIAA-2014-RashidY #automaton #quantum

Implications of Quantum Automata for Contextuality (JR, AY), pp. 318–331.

CIAA-2014-Sirakoulis #automaton

Cellular Automata for Crowd Dynamics (GCS), pp. 58–69.

DLT-2014-AlmeidaR #automaton

Semisimple Synchronizing Automata and the Wedderburn-Artin Theory (JA, ER), pp. 49–60.

DLT-2014-Berlinkov #algorithm #automaton #on the #problem

On Two Algorithmic Problems about Synchronizing Automata — (Short Paper) (MVB), pp. 61–67.

DLT-2014-FeliceN #algorithm #automaton #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 #automaton #random

Synchronizing Automata with Random Inputs — (Short Paper) (VVG), pp. 68–75.

DLT-2014-KutribM #automaton #communication

Measuring Communication in Automata Systems — (Invited Paper) (MK, AM), pp. 260–274.

DLT-2014-KutribMW #automaton #set

Deterministic Set Automata (MK, AM, MW), pp. 303–314.

DLT-2014-OkhotinS #automaton #nondeterminism

Input-Driven Pushdown Automata with Limited Nondeterminism — (Invited Paper) (AO, KS), pp. 84–102.

DLT-2014-Sinya #automaton #finite #graph

Graph Spectral Properties of Deterministic Finite Automata — (Short Paper) (RS), pp. 76–83.

ICALP-v2-2014-BorelloCV #automaton #set

Turing Degrees of Limit Sets of Cellular Automata (AB, JC, PV), pp. 74–85.

ICALP-v2-2014-ChistikovM #automaton #source code

Unary Pushdown Automata and Straight-Line Programs (DVC, RM), pp. 146–157.

ICALP-v2-2014-DrosteP #automaton #distance #logic #theorem

A Nivat Theorem for Weighted Timed Automata and Weighted Relative Distance Logic (MD, VP), pp. 171–182.

ICALP-v2-2014-KieferW #automaton #complexity #probability

Stability and Complexity of Minimising Probabilistic Automata (SK, BW), pp. 268–279.

LATA-2014-AbdullaAS #automaton #reachability

Computing Optimal Reachability Costs in Priced Dense-Timed Pushdown Automata (PAA, MFA, JS), pp. 62–75.

LATA-2014-BednarovaG #automaton

Two Double-Exponential Gaps for Automata with a Limited Pushdown (ZB, VG), pp. 113–125.

LATA-2014-DrosteD #automaton #infinity #logic #word

Weighted Automata and Logics for Infinite Nested Words (MD, SD), pp. 323–334.

LATA-2014-FelgenhauerT #analysis #automaton #reachability

Reachability Analysis with State-Compatible Automata (BF, RT), pp. 347–359.

LATA-2014-KleinMBK #automaton #model checking #probability #question

Are Good-for-Games Automata Good for Probabilistic Model Checking? (JK, DM, CB, SK), pp. 453–465.

LATA-2014-OttoM #automaton #order

Extended Two-Way Ordered Restarting Automata for Picture Languages (FO, FM), pp. 541–552.

LATA-2014-Vorel #automaton #complexity #problem #word

Complexity of a Problem Concerning Reset Words for Eulerian Binary Automata (VV), pp. 576–587.

LATA-2014-ZhengGQ #automaton #complexity #finite #on the

On the State Complexity of Semi-quantum Finite Automata (SZ, JG, DQ), pp. 601–612.

FM-2014-FengZ #automaton #bisimulation #equivalence #probability

When Equivalence and Bisimulation Join Forces in Probabilistic Automata (YF, LZ), pp. 247–262.

FM-2014-KordyLMP #algorithm #analysis #automaton #robust

A Symbolic Algorithm for the Analysis of Robust Timed Automata (PK, RL, SM, JWP), pp. 351–366.

OOPSLA-2014-ZhaoWZDSSW #automaton #predict #probability #sequence

Call sequence prediction through probabilistic calling automata (ZZ, BW, MZ, YD, JS, XS, YW), pp. 745–762.

QAPL-2014-BraitlingFHWBH #abstraction #automaton #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.

POPL-2014-DAntoniV #automaton

Minimization of symbolic automata (LD, MV), pp. 541–554.

SAC-2014-ShinJLY #automaton #design

Design of a cellular automata cell with rule 30 on quantum-dot cellular automata (SHS, JCJ, GJL, KYY), pp. 1749–1750.

CAV-2014-DAntoniA #automaton

Symbolic Visibly Pushdown Automata (LD, RA), pp. 209–225.

CAV-2014-EsparzaK #approach #automaton #composition #ltl

From LTL to Deterministic Automata: A Safraless Compositional Approach (JE, JK), pp. 192–208.

CAV-2014-HansenLLN0 #abstraction #automaton #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 #automaton #hybrid #invariant #network #verification

Invariant Verification of Nonlinear Hybrid Automata Networks of Cardiac Cells (ZH, CF, AM, SM, MZK), pp. 373–390.

LICS-CSL-2014-0001C #abstract interpretation #automaton

Abstract interpretation from Büchi automata (MH, WC), p. 10.

LICS-CSL-2014-BlumensathCKPB #automaton #infinity #logic

Two-way cost automata and cost logics over infinite trees (AB, TC, DK, PP, MVB), p. 9.

LICS-CSL-2014-Bollig #automaton #communication #logic

Logic for communicating automata with parameterized topology (BB), p. 10.

LICS-CSL-2014-BolligGMZ #automaton #logic

Logical characterization of weighted pebble walking automata (BB, PG, BM, MZ), p. 10.

LICS-CSL-2014-BrazdilKKNK #automaton #multi #probability

Zero-reachability in probabilistic multi-counter automata (TB, SK, AK, PN, JPK), p. 10.

LICS-CSL-2014-CarreiroFVZ #automaton #similarity

Weak MSO: automata and expressiveness modulo bisimilarity (FC, AF, YV, FZ), p. 27.

RTA-TLCA-2014-CreusG14a #automaton #constraints

Tree Automata with Height Constraints between Brothers (CC, GG), pp. 149–163.

VMCAI-2014-KiniV #automaton #ltl #probability #safety #specification

Probabilistic Automata for Safety LTL Specifications (DK, MV), pp. 118–136.

CASE-2013-MohajeraniMF #automaton #composition #finite #using #verification

Compositional nonblocking verification for extended finite-state automata using partial unfolding (SM, RM, MF), pp. 930–935.

FoSSaCS-2013-TzevelekosG #automaton

History-Register Automata (NT, RG), pp. 17–33.

TACAS-2013-EisentrautHST0 #automaton #probability

The Quest for Minimal Quotients for Probabilistic Automata (CE, HH, JS, AT, LZ), pp. 16–31.

TACAS-2013-GrigoreDPT #automaton #runtime #verification

Runtime Verification Based on Register Automata (RG, DD, RLP, NT), pp. 260–276.

TACAS-2013-JovanovicLR #automaton #integer #parametricity #synthesis

Integer Parameter Synthesis for Timed Automata (AJ, DL, OHR), pp. 401–415.

SAS-2013-0001MP #abstract domain #automaton #quantifier

Quantified Data Automata on Skinny Trees: An Abstract Domain for Lists (PG, PM, GP), pp. 172–193.

SAS-2013-PelegSYY #automaton #mining #specification

Symbolic Automata for Static Specification Mining (HP, SS, EY, HY), pp. 63–83.

STOC-2013-BohmGJ #automaton #equivalence

Equivalence of deterministic one-counter automata is NL-complete (SB, SG, PJ), pp. 131–140.

CIAA-J-2012-Berlinkov13 #automaton #clustering

Synchronizing quasi-Eulerian and quasi-One-Cluster Automata (MVB), pp. 729–746.

CIAA-J-2012-JezM13 #automaton

Hyper-Minimization for Deterministic Tree Automata (AJ, AM), pp. 815–830.

CIAA-J-2012-KutribO13 #automaton #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 #automaton #finite #functional #on the #transducer

On the Disambiguation of Finite Automata and Functional Transducers (MM), pp. 847–862.

CIAA-J-2012-Oliveira13 #algebra #automaton #category theory #matrix

Weighted Automata as Coalgebras in Categories of Matrices (JNO), pp. 709–728.

CIAA-J-2012-PrusaM13 #automaton

Restarting Tiling Automata (DP, FM), pp. 863–878.

DLT-J-2012-CadilhacFM13 #ambiguity #automaton

Unambiguous constrained Automata (MC, AF, PM), pp. 1099–1116.

DLT-J-2012-Csuhaj-Varju13 #automaton

P and DP Automata: Unconventional versus Classical Automata (ECV), pp. 995–1008.

DLT-J-2012-HolzerJ13 #automaton #equivalence #fault

From Equivalence to Almost-Equivalence, and beyond: Minimizing Automata with Errors (MH, SJ), pp. 1083–1098.

DLT-J-2012-HromkovicKKS13 #automaton #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 #automaton

Trimming Visibly Pushdown Automata (MC, PAR, JMT), pp. 84–96.

CIAA-2013-DebarbieuxGNSZ #automaton #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 #automaton

A Completion Algorithm for Lattice Tree Automata (TG, TLG, AL, VM), pp. 134–145.

CIAA-2013-HasanIRS #automaton #on the #sequence

On Palindromic Sequence Automata and Applications (MMH, ASMSI, MSR, AS), pp. 158–168.

CIAA-2013-INIBT #automaton #taxonomy

Compressed Automata for Dictionary Matching (TI, TN, SI, HB, MT), pp. 319–330.

CIAA-2013-Jurgensen #automaton

Automata for Codes (HJ), pp. 2–15.

CIAA-2013-KisielewiczS #automaton #generative

Generating Small Automata and the Černý Conjecture (AK, MS), pp. 340–348.

CIAA-2013-KutribMMPW #automaton #decidability #finite #queue

Input-Driven Queue Automata: Finite Turns, Decidability, and Closure Properties (MK, AM, CM, BP, MW), pp. 232–243.

CIAA-2013-Maletti #automaton

Hyper-optimization for Deterministic Tree Automata (AM), pp. 244–255.

CIAA-2013-MrazO #automaton #decidability

λ-Confluence Is Undecidable for Clearing Restarting Automata (FM, FO), pp. 256–267.

CIAA-2013-PrusaMO #2d #automaton

Comparing Two-Dimensional One-Marker Automata to Sgraffito Automata (DP, FM, FO), pp. 268–279.

CIAA-2013-Veanes #automaton #finite

Applications of Symbolic Finite Automata (MV), pp. 16–23.

DLT-2013-BertoniCD #automaton #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 #automaton #learning

A Fresh Approach to Learning Register Automata (BB, PH, ML, BM), pp. 118–130.

DLT-2013-FeliceN #algorithm #automaton

Brzozowski Algorithm Is Generically Super-Polynomial for Deterministic Automata (SDF, CN), pp. 179–190.

DLT-2013-Freivalds #automaton #finite #turing machine

Ultrametric Finite Automata and Turing Machines (RF), pp. 1–11.

DLT-2013-KlimaP #automaton

Alternative Automata Characterization of Piecewise Testable Languages (OK, LP), pp. 289–300.

DLT-2013-KucukSY #automaton #finite

Finite Automata with Advice Tapes (UK, ACCS, AY), pp. 301–312.

DLT-2013-KutribMW #automaton #finite #multi

One-Way Multi-Head Finite Automata with Pebbles But No States (MK, AM, MW), pp. 313–324.

DLT-2013-Loding #ambiguity #automaton #finite

Unambiguous Finite Automata (CL), pp. 29–30.

DLT-2013-PrusaMO #automaton

New Results on Deterministic Sgraffito Automata (DP, FM, FO), pp. 409–419.

DLT-2013-Regnault #automaton #probability #proving

Proof of a Phase Transition in Probabilistic Cellular Automata (DR), pp. 433–444.

ICALP-v2-2013-ChretienCD #automaton #protocol #security

From Security Protocols to Pushdown Automata (RC, VC, SD), pp. 137–149.

ICALP-v2-2013-DenielouY #automaton #communication #multi #synthesis

Multiparty Compatibility in Communicating Automata: Characterisation and Synthesis of Global Session Types (PMD, NY), pp. 174–186.

ICALP-v2-2013-FearnleyJ #automaton #reachability

Reachability in Two-Clock Timed Automata Is PSPACE-Complete (JF, MJ), pp. 212–223.

ICALP-v2-2013-Janin #algebra #automaton #logic

Algebras, Automata and Logic for Languages of Labeled Birooted Trees (DJ), pp. 312–323.

ICALP-v2-2013-Worrell #automaton #equivalence #finite #multi #problem

Revisiting the Equivalence Problem for Finite Multitape Automata (JW), pp. 422–433.

ICALP-v2-2013-Zetzsche #automaton

Silent Transitions in Automata with Storage (GZ), pp. 434–445.

LATA-2013-BabaaliK #automaton #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 #automaton #nondeterminism

Limited Non-determinism Hierarchy of Counter Automata (SB, DJ), pp. 92–103.

LATA-2013-BalaK #ambiguity #automaton

Unambiguous Automata Denoting Finitely Sequential Functions (SB, AK), pp. 104–115.

LATA-2013-BjorklundFK #automaton #learning

MAT Learning of Universal Automata (JB, HF, AK), pp. 141–152.

LATA-2013-BolligCHKS #automaton #branch #communication

Dynamic Communicating Automata and Branching High-Level MSCs (BB, AC, LH, AK, TS), pp. 177–189.

LATA-2013-BruyereDG #anti #automaton

Visibly Pushdown Automata: Universality and Inclusion via Antichains (VB, MD, OG), pp. 190–201.

LATA-2013-CuiDFI #automaton #execution

Execution Information Rate for Some Classes of Automata (CC, ZD, TRF, OHI), pp. 226–237.

LATA-2013-FreivaldsZP #automaton #complexity #on the

On the Size Complexity of Deterministic Frequency Automata (RF, TZ, GRP), pp. 287–298.

LATA-2013-IbarraR #automaton #bound #on the

On Bounded Languages and Reversal-Bounded Automata (OHI, BR), pp. 359–370.

LATA-2013-JacquemardR #automaton #term rewriting

Rewrite Closure and CF Hedge Automata (FJ, MR), pp. 371–382.

LATA-2013-NakamuraI #automaton #linear #stack

Eliminating Stack Symbols in Push-Down Automata and Linear Indexed Grammars (KN, KI), pp. 444–455.

LATA-2013-Ong #automaton #higher-order #model checking #recursion

Recursion Schemes, Collapsible Pushdown Automata and Higher-Order Model Checking (LO), pp. 13–41.

LATA-2013-Otto #automaton

Asynchronous PC Systems of Pushdown Automata (FO), pp. 456–467.

LATA-2013-Quaas #automaton #logic #metric #model checking

Model Checking Metric Temporal Logic over Automata with One Counter (KQ), pp. 468–479.

LATA-2013-Schwentick #automaton #challenge #xml

XML Schema Management: A Challenge for Automata Theory (TS), p. 43.

IFM-2013-CastillosDJKT #composition #semantics

A Compositional Automata-Based Semantics for Property Patterns (KCC, FD, JJ, BK, ST), pp. 316–330.

IFM-2013-IshiiMN #automaton #calculus #hybrid #induction #verification

Inductive Verification of Hybrid Automata with Strongest Postcondition Calculus (DI, GM, SN), pp. 139–153.

IFM-2013-Larsen #automaton #model checking #statistics

Priced Timed Automata and Statistical Model Checking (KGL), pp. 154–161.

GT-VMT-2013-ColomboP #automaton #programming

Monitor-Oriented Compensation Programming Through Compensating Automata (CC, GJP).

POPL-2013-MayrC #automaton

Advanced automata minimization (RM, LC), pp. 63–74.

ICSE-2013-LetierH #automaton #modelling #requirements #synthesis

Requirements modelling by synthesis of deontic input-output automata (EL, WH), pp. 592–601.

PPoPP-2013-YuB #automaton #performance #regular expression

Exploring different automata representations for efficient regular expression matching on GPUs (XY, MB), pp. 287–288.

CAV-2013-ChatterjeeGK #automaton #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 #automaton #model checking #people

Software Model Checking for People Who Love Automata (MH, JH, AP), pp. 36–52.

CAV-2013-HerbreteauSW #abstraction #automaton #lazy evaluation

Lazy Abstractions for Timed Automata (FH, BS, IW), pp. 990–1005.

CAV-2013-HolikLRSV #analysis #automation #automaton

Fully Automated Shape Analysis Based on Forest Automata (LH, OL, AR, JS, TV), pp. 740–755.

CAV-2013-LaarmanODLP #abstraction #automaton #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 #automaton #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 #automaton #named #robust

Shrinktech: A Tool for the Robustness Analysis of Timed Automata (OS), pp. 1006–1012.

CAV-2013-StewartEY #automaton #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 #automaton #game studies #logic

GOAL for Games, ω-Automata, and Logics (MHT, YKT, YSH), pp. 883–889.

CSL-2013-Kuusisto #automaton #distributed #logic #message passing

Modal Logic and Distributed Message Passing Automata (AK), pp. 452–468.

LICS-2013-AlurDDRY #automaton

Regular Functions and Cost Register Automata (RA, LD, JVD, MR, YY), pp. 13–22.

LICS-2013-BenediktGKM #automaton #similarity

Bisimilarity of Pushdown Automata is Nonelementary (MB, SG, SK, ASM), pp. 488–498.

LICS-2013-FacchiniMS #automaton #problem

Rabin-Mostowski Index Problem: A Step beyond Deterministic Automata (AF, FM, MS), pp. 499–508.

LICS-2013-Lynch #automaton #probability

Timed and Probabilistic I/O Automata (NAL), p. 12.

RTA-2013-Kari #automaton #generative

Pattern Generation by Cellular Automata (Invited Talk) (JK), pp. 1–3.

TAP-2013-AichernigLN #automaton #modelling #mutation testing #testing

Time for Mutants — Model-Based Mutation Testing with Timed Automata (BKA, FL, DN), pp. 20–38.

VMCAI-2013-Podelski #automaton #proving

Automata as Proofs (AP), pp. 13–14.

VMCAI-2013-PrabhakarDMV #hybrid

Hybrid Automata-Based CEGAR for Rectangular Hybrid Systems (PP, PSD, SM, MV), pp. 48–67.

CASE-2012-FeiMAL #approach #automaton #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 #automaton

Manipulating objects with gliders in cellular automata (IG, AA, CM), pp. 936–941.

CASE-2012-KobayashiH #automaton #on the

On opacity and diagnosability in discrete event systems modeled by pushdown automata (KK, KH), pp. 662–667.

CASE-2012-ShoaeiFL #abstraction #automaton #finite

Abstractions for nonblocking supervisory control of Extended Finite Automata (MRS, LF, BL), pp. 364–370.

SIGMOD-2012-TeubnerWN #automaton #configuration management

Skeleton automata for FPGAs: reconfiguring without reconstructing (JT, LW, CN), pp. 229–240.

ITiCSE-2012-DrorR #automaton #finite

The effect of mathematical vs. verbal formulation for finite automata (TD, DLR), p. 382.

ESOP-2012-DenielouY #automaton #communication #multi

Multiparty Session Types Meet Communicating Automata (PMD, NY), pp. 194–213.

FASE-2012-HatvaniPS #adaptation #automaton #embedded #framework #verification

Adaptive Task Automata: A Framework for Verifying Adaptive Embedded Systems (LH, PP, CCS), pp. 115–129.

FoSSaCS-2012-GollerHOW #automaton #model checking #parametricity

Branching-Time Model Checking of Parametric One-Counter Automata (SG, CH, JO, JW), pp. 406–420.

FoSSaCS-2012-KieferMOWW #automaton #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 #automaton #effectiveness #logic #using

Effective Characterizations of Simple Fragments of Temporal Logic Using Prophetic Automata (SP, TW), pp. 135–149.

TACAS-2012-BabiakKRS #automaton #ltl #performance

LTL to Büchi Automata Translation: Fast and More Deterministic (TB, MK, VR, JS), pp. 95–109.

TACAS-2012-FriedmannL #analysis #automaton

Ramsey-Based Analysis of Parity Automata (OF, ML), pp. 64–78.

TACAS-2012-LengalSV #automaton #library #named #nondeterminism #performance

VATA: A Library for Efficient Manipulation of Non-deterministic Tree Automata (OL, JS, TV), pp. 79–94.

TACAS-2012-MertenHSCJ #automaton #learning

Demonstrating Learning of Register Automata (MM, FH, BS, SC, BJ), pp. 466–471.

TACAS-2012-VeanesB #automaton #tool support

Symbolic Automata: The Toolkit (MV, NB), pp. 472–477.

DLT-J-2011-BrodaMMR12 #automaton #on the

On the Average Size of Glushkov and Partial derivative Automata (SB, AM, NM, RR), pp. 969–984.

DLT-J-2011-SayY12 #automaton #quantum

Quantum Counter Automata (ACCS, AY), pp. 1099–1116.

DLT-J-2011-ZhengQL12 #automaton #finite #quantum

Some Languages Recognized by Two-Way Finite Automata with Quantum and Classical States (SZ, DQ, LL), pp. 1117–1130.

CIAA-2012-Berlinkov #automaton

Synchronizing Automata on Quasi-Eulerian Digraph (MVB), pp. 90–100.

CIAA-2012-Ceccherini-SilbersteinCFS #automaton

Cellular Automata on Regular Rooted Trees (TCS, MC, FF, ZS), pp. 101–112.

CIAA-2012-DeganoFM #automaton #resource management

Nominal Automata for Resource Usage Control (PD, GLF, GM), pp. 125–137.

CIAA-2012-DrosteP #automaton #logic #word

Weighted Nested Word Automata and Logics over Strong Bimonoids (MD, BP), pp. 138–148.

CIAA-2012-FaroL #algorithm #automaton #online #performance #string

A Fast Suffix Automata Based Algorithm for Exact Online String Matching (SF, TL), pp. 149–158.

CIAA-2012-GastinM #automaton

Adding Pebbles to Weighted Automata (PG, BM), pp. 28–51.

CIAA-2012-Gusev #automaton #bound #rank

Synchronizing Automata of Bounded Rank (VVG), pp. 171–179.

CIAA-2012-JezM #automaton

Hyper-minimization for Deterministic Tree Automata (AJ, AM), pp. 217–228.

CIAA-2012-KutribO #automaton #complexity #on the

On the Descriptional Complexity of the Window Size for Deterministic Restarting Automata (MK, FO), pp. 253–264.

CIAA-2012-Martyugin #ambiguity #automaton

Synchronization of Automata with One Undefined or Ambiguous Transition (PVM), pp. 278–288.

CIAA-2012-Mohri #algorithm #ambiguity #automaton #finite #functional #transducer

A Disambiguation Algorithm for Finite Automata and Functional Transducers (MM), pp. 265–277.

CIAA-2012-Oliveira #algebra #automaton #linear #probability

Typed Linear Algebra for Weigthed (Probabilistic) Automata (JNO), pp. 52–65.

CIAA-2012-PrusaM #automaton

Restarting Tiling Automata (DP, FM), pp. 289–300.

CIAA-2012-ReidenbachS #automaton #bound #nondeterminism

Automata with Modulo Counters and Nondeterministic Counter Bounds (DR, MLS), pp. 361–368.

DLT-2012-CadilhacFM #ambiguity #automaton

Unambiguous Constrained Automata (MC, AF, PM), pp. 239–250.

DLT-2012-CaralpRT #automaton #bound #multi

Visibly Pushdown Automata with Multiplicities: Finiteness and K-Boundedness (MC, PAR, JMT), pp. 226–238.

DLT-2012-Csuhaj-Varju #automaton

P and dP Automata: Unconventional versus Classical Automata (ECV), pp. 7–22.

DLT-2012-HolzerJ #automaton #equivalence #fault

From Equivalence to Almost-Equivalence, and Beyond — Minimizing Automata with Errors — (Extended Abstract) (MH, SJ), pp. 190–201.

DLT-2012-HromkovicKKS #automaton #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 #automaton #finite #nondeterminism #theorem

Analogs of Fagin’s Theorem for Small Nondeterministic Finite Automata (CAK, NL), pp. 202–213.

DLT-2012-Kari #automaton

Cellular Automata, the Collatz Conjecture and Powers of 3/2 (JK), pp. 40–49.

DLT-2012-KutribMW #automaton #finite #multi

States and Heads Do Count for Unary Multi-head Finite Automata (MK, AM, MW), pp. 214–225.

DLT-2012-LavadoPS #automaton #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 #automaton

Two-Dimensional Sgraffito Automata (DP, FM), pp. 251–262.

ICALP-v2-2012-BouyerMS #approach #automaton #game studies #reachability #robust

Robust Reachability in Timed Automata: A Game-Based Approach (PB, NM, OS), pp. 128–140.

ICALP-v2-2012-Broadbent #automaton

Prefix Rewriting for Nested-Words and Collapsible Pushdown Automata (CHB), pp. 153–164.

ICALP-v2-2012-ReddyD #algol #formal method

An Automata-Theoretic Model of Idealized Algol — (Extended Abstract) (USR, BPD), pp. 337–350.

LATA-2012-Axelsen #automaton #finite #multi

Reversible Multi-head Finite Automata Characterize Reversible Logarithmic Space (HBA), pp. 95–105.

LATA-2012-BoigelotBD

Automata-Based Symbolic Representations of Polyhedra (BB, JB, JFD), pp. 3–20.

LATA-2012-DennunzioFP #automaton #complexity

Computational Complexity of Rule Distributions of Non-uniform Cellular Automata (AD, EF, JP), pp. 204–215.

LATA-2012-Dowek #automaton #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 #automaton

Two-Way Automata Making Choices Only at the Endmarkers (VG, BG, GP), pp. 264–276.

LATA-2012-IbarraT #automaton #multi #turing machine

Weak Synchronization and Synchronizability of Multitape Pushdown Automata and Turing Machines (OHI, NQT), pp. 337–350.

LATA-2012-KaraST #automaton #logic #word

Feasible Automata for Two-Variable Logic with Successor on Data Words (AK, TS, TT), pp. 351–362.

LATA-2012-SaloT #automaton #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 #automaton #model checking #on the

On Model Checking for Visibly Pushdown Automata (NVT, HO), pp. 408–419.

LATA-2012-Yamakami #automaton #finite #quantum

One-Way Reversible and Quantum Finite Automata with Advice (TY), pp. 526–537.

FM-2012-AartsHKOV #abstraction #automaton #learning #refinement

Automata Learning through Counterexample Guided Abstraction Refinement (FA, FH, HK, PO, FWV), pp. 10–27.

FM-2012-BarringerFHRR #automaton #monitoring #performance #quantifier #runtime #towards

Quantified Event Automata: Towards Expressive and Efficient Runtime Monitors (HB, YF, KH, GR, DER), pp. 68–84.

GT-VMT-2012-BrugginkHK #automaton #graph #towards

Towards Alternating Automata for Graph Languages (HJSB, MH, BK).

ICGT-2012-BlumeBEK #automaton #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 #automaton #probability #recognition

Timed and probabilistic automata for automatic animal Call Recognition (SD, JZ, PR, MWT, LB), pp. 2910–2913.

KR-2012-LutzSW #approach #approximate #logic

An Automata-Theoretic Approach to Uniform Interpolation and Approximation in the Description Logic EL (CL, IS, FW).

SEKE-2012-SalamahEO #automaton #consistency #ltl #using

Consistency Checks of System Properties Using LTL and Büchi Automata (SS, ME, OO), pp. 39–44.

ECMFA-2012-QureshiCT #constraints #specification

A Timed Automata-Based Method to Analyze EAST-ADL Timing Constraint Specifications (TNQ, DJC, MT), pp. 303–318.

QAPL-2012-BulychevDLMPLW #automaton #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 #automaton #framework #model checking

A Büchi automata based model checking framework for reo connectors (SK, MI, AM), pp. 1536–1543.

CAV-2012-GuhaNA #automaton #bisimulation #decidability #on the

On Decidability of Prebisimulation for Timed Automata (SG, CN, SAK), pp. 444–461.

CAV-2012-KretinskyE #automaton #ltl

Deterministic Automata for the (F, G)-Fragment of LTL (JK, JE), pp. 7–22.

CSL-2012-Wu #automaton #commutative

Commutative Data Automata (ZW), pp. 528–542.

LICS-2012-AbdullaAS #automaton

Dense-Timed Pushdown Automata (PAA, MFA, JS), pp. 35–44.

LICS-2012-CarayolS #automaton #effectiveness #equivalence #recursion #safety

Collapsible Pushdown Automata and Labeled Recursion Schemes: Equivalence, Safety and Effective Selection (AC, OS), pp. 165–174.

LICS-2012-ChatterjeeT #automaton #decidability #infinity #probability #problem #word

Decidable Problems for Probabilistic Automata on Infinite Words (KC, MT), pp. 185–194.

LICS-2012-FijalkowGO #automaton #probability #problem

Deciding the Value 1 Problem for Probabilistic Leaktight Automata (NF, HG, YO), pp. 295–304.

LICS-2012-HerbreteauSW #abstraction #automaton

Better Abstractions for Timed Automata (FH, BS, IW), pp. 375–384.

LICS-2012-Tan #automaton #order

An Automata Model for Trees with Ordered Data Values (TT), pp. 586–595.

RTA-2012-Lisitsa #automaton #finite #modelling #safety #verification

Finite Models vs Tree Automata in Safety Verification (AL), pp. 225–239.

VMCAI-2012-HowarSJC #automaton #canonical

Inferring Canonical Register Automata (FH, BS, BJ, SC), pp. 251–266.

CASE-2011-FeiMA #automaton #finite #modelling #resource management #using

Modeling sequential resource allocation systems using Extended Finite Automata (ZF, SM, KÅ), pp. 444–449.

CASE-2011-MiremadiLA #automaton #finite

BDD-based supervisory control on extended finite automata (SM, BL, KÅ), pp. 25–31.

DATE-2011-BruschiPRS #automaton #performance

An efficient Quantum-Dot Cellular Automata adder (FB, FP, VR, DS), pp. 1220–1223.

FoSSaCS-2011-BertrandSJK #approach #automaton #game studies

A Game Approach to Determinize Timed Automata (NB, AS, TJ, MK), pp. 245–259.

FoSSaCS-2011-DaxK #automaton #word

Alternation Elimination for Automata over Nested Words (CD, FK), pp. 168–183.

FoSSaCS-2011-HalamishK #automaton

Minimizing Deterministic Lattice Automata (SH, OK), pp. 199–213.

FoSSaCS-2011-JaubertR #analysis #automaton #robust

Quantitative Robustness Analysis of Flat Timed Automata (RJ, PAR), pp. 229–244.

FoSSaCS-2011-Kobayashi #algorithm #automaton #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 #automaton #nondeterminism #testing

Off-Line Test Selection with Test Purposes for Non-deterministic Timed Automata (NB, TJ, AS, MK), pp. 96–111.

TACAS-2011-TsayTCC #automaton #repository

Büchi Store: An Open Repository of Büchi Automata (YKT, MHT, JSC, YWC), pp. 262–266.

DLT-J-2009-BealBP11 #automaton #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 #automaton #monad #regular expression

Weighted Automata and Regular Expressions over Valuation Monoids (MD, IM), pp. 1829–1844.

CIAA-J-2010-EsikM11 #automaton #simulation

The Category of Simulations for Weighted Tree Automata (ZÉ, AM), pp. 1845–1859.

CIAA-J-2010-KufleitnerL11 #automaton #order

Partially Ordered Two-Way BüChi Automata (MK, AL), pp. 1861–1876.

CIAA-J-2010-YuBI11 #automaton #multi #relational #string #using #verification

Relational String Verification Using Multi-Track Automata (FY, TB, OHI), pp. 1909–1924.

DLT-J-2010-BordihnKM11 #automaton #communication #finite #parallel

Undecidability and Hierarchy Results for Parallel Communicating Finite Automata (HB, MK, AM), pp. 1577–1592.

DLT-J-2010-BrodaMMR11 #approach #automaton #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 #automaton #infinity #problem

The Inclusion Problem for Weighted Automata on Infinite Trees (SB, RP), pp. 108–122.

AFL-2011-CermakM #automaton #strict

n-Accepting Restricted Pushdown Automata Systems (MC, AM), pp. 168–183.

AFL-2011-Egri-NagyN #automaton #symmetry

Symmetries of Automata (AEN, CLN), p. 391.

AFL-2011-MalettiQ #automaton #finite

Hyper-minimisation of deterministic weighted finite automata over semifields (AM, DQ), pp. 285–299.

AFL-2011-NagyO

Deterministic Pushdown-CD-Systems of Stateless Deterministic R(1)-Automata (BN, FO), pp. 328–342.

AFL-2011-Umeo #2d #algorithm #automaton #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 #automaton #generative #markov #random #using

Random Generation of Deterministic Acyclic Automata Using Markov Chains (VC, SDF), pp. 65–75.

CIAA-2011-CastiglioneRS #algorithm #automaton #nondeterminism

Nondeterministic Moore Automata and Brzozowski’s Algorithm (GC, AR, MS), pp. 88–99.

CIAA-2011-CourcelleD

Fly-Automata, Their Properties and Applications (BC, ID), pp. 264–272.

CIAA-2011-DaciukW #automaton #finite #representation

Smaller Representation of Finite State Automata (JD, DW), pp. 118–129.

CIAA-2011-FlouriJMIP #automaton #order

Tree Template Matching in Ranked Ordered Trees by Pushdown Automata (TF, JJ, BM, CSI, SPP), pp. 273–281.

CIAA-2011-HeamHK #automaton

Loops and Overloops for Tree Walking Automata (PCH, VH, OK), pp. 166–177.

CIAA-2011-HolzerK #automaton #finite

Gaining Power by Input Operations: Finite Automata and Beyond (MH, MK), pp. 16–29.

CIAA-2011-JezM #automaton #performance

Computing All ℓ-Cover Automata Fast (AJ, AM), pp. 203–214.

CIAA-2011-LonatiP #2d #automaton #towards

Towards More Expressive 2D Deterministic Automata (VL, MP), pp. 225–237.

CIAA-2011-Martyugin #automaton #complexity #problem #word

Complexity of Problems Concerning Reset Words for Cyclic and Eulerian Automata (PM), pp. 238–249.

CIAA-2011-OrtizLS #automaton #distributed

Distributed Event Clock Automata — Extended Abstract (JJO, AL, PYS), pp. 250–263.

CIAA-2011-SkvortsovT #automaton #case study #random #word

Experimental Study of the Shortest Reset Word of Random Automata (ES, ET), pp. 290–298.

DLT-2011-BrodaMMR #automaton #complexity

The Average Transition Complexity of Glushkov and Partial Derivative Automata (SB, AM, NM, RR), pp. 93–104.

DLT-2011-CeceG #2d #automaton #online #simulation

Simulations over Two-Dimensional On-Line Tessellation Automata (GC, AG), pp. 141–152.

DLT-2011-CernoM #automaton

Δ-Clearing Restarting Automata and CFL (PC, FM), pp. 153–164.

DLT-2011-ChandesrisDFM #aspect-oriented #automaton

Computational Aspects of Asynchronous Cellular Automata (JC, AD, EF, LM), pp. 466–468.

DLT-2011-HundeshagenO #automaton #regular expression

Characterizing the Regular Languages by Nonforgetting Restarting Automata (NH, FO), pp. 288–299.

DLT-2011-Kasprzik #automaton #finite #query

Inference of Residual Finite-State Tree Automata from Membership Queries and Finite Positive Data (AK), pp. 476–477.

DLT-2011-KuncO #automaton #finite #using

Describing Periodicity in Two-Way Deterministic Finite Automata Using Transformation Semigroups (MK, AO), pp. 324–336.

DLT-2011-MenibusS #approach #automaton #self

Self-organization in Cellular Automata: A Particle-Based Approach (BHdM, MS), pp. 251–263.

DLT-2011-RestivoV #automaton

Some Remarks on Automata Minimality (AR, RV), pp. 15–27.

DLT-2011-RodaroS #automaton #problem

Never Minimal Automata and the Rainbow Bipartite Subgraph Problem (ER, PVS), pp. 374–385.

DLT-2011-TasdemirS #automaton #modelling

Models of Pushdown Automata with Reset (NT, ACCS), pp. 417–428.

ICALP-v2-2011-BertrandBBS #automaton #problem

Emptiness and Universality Problems in Timed Automata with Positive Frequency (NB, PB, TB, AS), pp. 246–257.

ICALP-v2-2011-BrihayeDGORW #automaton #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 #automaton

Büchi Automata Can Have Smaller Quotients (LC), pp. 258–270.

ICALP-v2-2011-Delacourt #automaton #set #theorem

Rice’s Theorem for μ-Limit Sets of Cellular Automata (MD), pp. 89–100.

ICALP-v2-2011-DengH #automaton #markov #on the #semantics

On the Semantics of Markov Automata (YD, MH), pp. 307–318.

ICALP-v2-2011-HopkinsMO #automaton #decidability #ml

A Fragment of ML Decidable by Visibly Pushdown Automata (DH, ASM, CHLO), pp. 149–161.

ICALP-v2-2011-Zetzsche #automaton #monad #on the #transducer

On the Capabilities of Grammars, Automata, and Transducers Controlled by Monoids (GZ), pp. 222–233.

ICALP-v2-2011-ZhangJNH #model checking

Automata-Based CSL Model Checking (LZ, DNJ, FN, HH), pp. 271–282.

LATA-2011-BareckaC #automaton #complexity #finite #problem

The Parameterized Complexity of Chosen Problems for Finite Automata on Trees (AB, WC), pp. 129–141.

LATA-2011-Colcombet #automaton

Green’s Relations and Their Use in Automata Theory (TC), pp. 1–21.

LATA-2011-Gelderie #automaton #regular expression

Classifying Regular Languages via Cascade Products of Automata (MG), pp. 286–297.

LATA-2011-LisitsaPS #automaton

Planarity of Knots, Register Automata and LogSpace Computability (AL, IP, RS), pp. 366–377.

LATA-2011-NagyO

Globally Deterministic CD-Systems of Stateless R(1)-Automata (BN, FO), pp. 390–401.

LATA-2011-OkhotinS #ambiguity #automaton #complexity #word

Descriptional Complexity of Unambiguous Nested Word Automata (AO, KS), pp. 414–426.

LATA-2011-Quaas #automaton #bound #on the #problem

On the Interval-Bound Problem for Weighted Timed Automata (KQ), pp. 452–464.

LATA-2011-Schluter #automaton #lookahead

Restarting Automata with Auxiliary Symbols and Small Lookahead (NS), pp. 499–510.

IFM-J-2009-BenesBBCSV11 #automaton #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.

SFM-2011-Jonsson #automaton #learning #modelling

Learning of Automata Models Extended with Data (BJ), pp. 327–349.

SFM-2011-SteffenHM #automaton #learning #perspective

Introduction to Active Automata Learning from a Practical Perspective (BS, FH, MM), pp. 256–296.

GCM-2010-PlumpSS11 #automaton #finite #graph #source code

Minimizing Finite Automata with Graph Programs (DP, RS, AS).

AGTIVE-2011-GreenyerR #automaton #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 #automaton #distributed

Distributed Port Automata (CK).

LOPSTR-2011-CabalarD #equilibrium #modelling

Automata-Based Computation of Temporal Equilibrium Models (PC, SD), pp. 57–72.

QAPL-2011-Rutkowski #automaton #game studies

Two-Player Reachability-Price Games on Single-Clock Timed Automata (MR), pp. 31–46.

QAPL-2011-TracolDZ #automaton #probability

Computing Distances between Probabilistic Automata (MT, JD, AZ), pp. 148–162.

POPL-2011-Tzevelekos #automaton

Fresh-register automata (NT), pp. 295–306.

CAV-2011-BabicRS #analysis #automaton

Malware Analysis with Tree Automata Inference (DB, DR, DS), pp. 116–131.

CAV-2011-CimattiMT #automaton #hybrid #performance #verification

Efficient Scenario Verification for Hybrid Automata (AC, SM, ST), pp. 317–332.

CAV-2011-HabermehlHRSV #automaton #verification

Forest Automata for Verification of Heap Manipulation (PH, LH, AR, JS, TV), pp. 424–440.

CAV-2011-KieferMOWW #automaton #equivalence #probability

Language Equivalence for Probabilistic Automata (SK, ASM, JO, BW, JW), pp. 526–540.

CAV-2011-MorbePS #automaton #model checking

Fully Symbolic Model Checking for Timed Automata (GM, FP, CS), pp. 616–632.

CAV-2011-PeterEM #automaton #named #synthesis #verification

Synthia: Verification and Synthesis for Timed Automata (HJP, RE, RM), pp. 649–655.

CSL-2011-BokerH #automaton

Determinizing Discounted-Sum Automata (UB, TAH), pp. 82–96.

ICST-2011-BelliBTF #automaton #mutation testing #testing

Mutation Testing of “Go-Back” Functions Based on Pushdown Automata (FB, MB, TT, ZF), pp. 249–258.

LICS-2011-AminofKL #approximate #automaton

Rigorous Approximated Determinization of Weighted Automata (BA, OK, RL), pp. 345–354.

LICS-2011-BojanczykKL #automaton

Automata with Group Actions (MB, BK, SL), pp. 355–364.

RTA-2011-Tison #automaton #constraints #question #similarity #term rewriting #what

Tree Automata, (Dis-)Equality Constraints and Term Rewriting: What’s New? (ST), pp. 1–2.

TAP-2011-HeamM #approach #automaton #random testing #testing #using

A Random Testing Approach Using Pushdown Automata (PCH, CM), pp. 119–133.

TAP-2011-Tan #automaton #metric #testing

State Coverage Metrics for Specification-Based Testing with Büchi Automata (LT), pp. 171–186.

TLCA-2011-Tison #automaton #constraints #question #similarity #term rewriting #what

Tree Automata, (Dis-)Equality Constraints and Term Rewriting — What’s New? (ST), pp. 3–5.

VMCAI-2011-ChadhaSV #automaton #probability

Probabilistic Büchi Automata with Non-extremal Acceptance Thresholds (RC, APS, MV), pp. 103–117.

VMCAI-2011-DelahayeKLLPSW #automaton #probability

Abstract Probabilistic Automata (BD, JPK, KGL, AL, MLP, FS, AW), pp. 324–339.

VMCAI-2011-HooimeijerV #algorithm #analysis #automaton #evaluation #string

An Evaluation of Automata Algorithms for String Analysis (PH, MV), pp. 248–262.

VMCAI-2011-HowarSM #abstraction #automation #automaton #learning #refinement

Automata Learning with Automated Alphabet Abstraction Refinement (FH, BS, MM), pp. 263–277.

CASE-2010-OuedraogoKMA #approach #automaton #finite

Symbolic approach to nonblocking and safe control of Extended Finite Automata (LO, RK, RM, KÅ), pp. 471–476.

FASE-2010-LiXBLM #approach #hardware

An Automata-Theoretic Approach to Hardware/Software Co-verification (JL, FX, TB, VL, CM), pp. 248–262.

TACAS-2010-DoyenR #algorithm #automaton #finite

Antichain Algorithms for Finite Automata (LD, JFR), pp. 2–22.

TACAS-2010-MalinowskiN #automaton #bound #model checking #partial order #satisfiability #semantics

SAT Based Bounded Model Checking with Partial Order Semantics for Timed Automata (JM, PN), pp. 405–419.

TACAS-2010-YuAB #analysis #named #php #string

Stranger: An Automata-Based String Analysis Tool for PHP (FY, MA, TB), pp. 154–157.

AFL-J-2008-KaminskiZ10 #automaton #nondeterminism

Finite-Memory Automata with Non-Deterministic Reassignment (MK, DZ), pp. 741–760.

AFL-J-2008-KutribMO10 #automaton #on the

On Stateless Two-Pushdown Automata and Restarting Automata (MK, HM, FO), pp. 781–798.

AFL-J-2008-Lohrey10 #automaton #problem #regular expression

Compressed Membership Problems for Regular Expressions and Hierarchical Automata (ML), pp. 817–841.

DLT-J-2008-FiliotTT10 #automaton #constraints

Tree Automata with Global Constraints (EF, JMT, ST), pp. 571–596.

DLT-J-2008-Glockler10 #automaton #taxonomy

A Taxonomy of Deterministic Forgetting Automata (JG), pp. 619–631.

CIAA-2010-AllauzenCM #automaton #kernel #scalability

Large-Scale Training of SVMs with Automata Kernels (CA, CC, MM), pp. 17–27.

CIAA-2010-AlmeidaMPS #automaton #coq

Partial Derivative Automata Formalized in Coq (JBA, NM, DP, SMdS), pp. 59–68.

CIAA-2010-AntosM #approach #automaton #finite #pattern matching

Finite Automata for Generalized Approach to Backward Pattern Matching (JA, BM), pp. 49–58.

CIAA-2010-CastiglioneNS #algorithm #automaton #product line

A Challenging Family of Automata for Classical Minimization Algorithms (GC, CN, MS), pp. 251–260.

CIAA-2010-EsikM #automaton #simulation

Simulations of Weighted Tree Automata (ZÉ, AM), pp. 321–330.

CIAA-2010-ForysOB #automaton #infinity

Symbolic Dynamics, Flower Automata and Infinite Traces (WF, PO, SB), pp. 135–142.

CIAA-2010-HundeshagenOV #automaton

Transductions Computed by PC-Systems of Monotone Deterministic Restarting Automata (NH, FO, MV), pp. 163–172.

CIAA-2010-Jonoska #automaton #self #using

Using Automata to Describe Self-Assembled Nanostructures (NJ), pp. 1–3.

CIAA-2010-KufleitnerL #automaton #order

Partially Ordered Two-Way Büchi Automata (MK, AL), pp. 181–190.

CIAA-2010-OkuiS #ambiguity #automaton #regular expression

Disambiguation in Regular Expression Matching via Position Automata with Augmented Transitions (SO, TS), pp. 231–240.

CIAA-2010-YuBI #automaton #multi #relational #string #using #verification

Relational String Verification Using Multi-track Automata (FY, TB, OHI), pp. 290–299.

DLT-2010-BordihnKM #automaton #communication #finite #parallel

Undecidability and Hierarchy Results for Parallel Communicating Finite Automata (HB, MK, AM), pp. 88–99.

DLT-2010-BrodaMMR #automaton #on the

On the Average Number of States of Partial Derivative Automata (SB, AM, NM, RR), pp. 112–123.

DLT-2010-DrosteV #automaton #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 #automaton

Two-Way Unary Automata versus Logarithmic Space (VG, GP), pp. 197–208.

DLT-2010-OttoPM #automaton #on the

On Lexicalized Well-Behaved Restarting Automata That Are Monotone (FO, MP, FM), pp. 352–363.

DLT-2010-RestivoV #automaton

Automata with Extremal Minimality Conditions (AR, RV), pp. 399–410.

DLT-2010-Schluter #automaton #lookahead #on the

On Lookahead Hierarchies for Monotone and Deterministic Restarting Automata with Auxiliary Symbols (Extended Abstract) (NS), pp. 440–441.

ICALP-v1-2010-BojanczykP #automaton #evaluation #nondeterminism #performance #using

Efficient Evaluation of Nondeterministic Automata Using Factorization Forests (MB, PP), pp. 515–526.

ICALP-v2-2010-BokerKR #automaton

Alternation Removal in Büchi Automata (UB, OK, AR), pp. 76–87.

ICALP-v2-2010-BolligGMZ #automaton #logic #transitive

Pebble Weighted Automata and Transitive Closure Logics (BB, PG, BM, MZ), pp. 587–598.

ICALP-v2-2010-FontaineLV #algebra #approach #automaton #using

Automata for Coalgebras: An Approach Using Predicate Liftings (GF, RAL, YV), pp. 381–392.

ICALP-v2-2010-GenestGMW #automaton

Optimal Zielonka-Type Construction of Deterministic Asynchronous Automata (BG, HG, AM, IW), pp. 52–63.

ICALP-v2-2010-GimbertO #automaton #decidability #finite #probability #problem #word

Probabilistic Automata on Finite Words: Decidable and Undecidable Problems (HG, YO), pp. 527–538.

ICALP-v2-2010-GollerHOW #automaton #model checking #parametricity

Model Checking Succinct and Parametric One-Counter Automata (SG, CH, JO, JW), pp. 575–586.

LATA-2010-BousquetL #ambiguity #automaton #equivalence #problem

Equivalence and Inclusion Problem for Strongly Unambiguous Büchi Automata (NB, CL), pp. 118–129.

LATA-2010-Ehlers #automaton

Short Witnesses and Accepting Lassos in ω-Automata (RE), pp. 261–272.

LATA-2010-GrumbergKS #automaton #infinity

Variable Automata over Infinite Alphabets (OG, OK, SS), pp. 561–572.

LATA-2010-KutribM #automaton

Reversible Pushdown Automata (MK, AM), pp. 368–379.

LATA-2010-LetichevskySS #automaton #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 #automaton #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 #automaton #named

Arbology: Trees and Pushdown Automata (BM), pp. 32–49.

LATA-2010-Muscholl #analysis #automaton #communication

Analysis of Communicating Automata (AM), pp. 50–57.

LATA-2010-NagyO

CD-Systems of Stateless Deterministic R(1)-Automata Accept All Rational Trace Languages (BN, FO), pp. 463–474.

LATA-2010-PlatekML #automaton #functional #generative

Restarting Automata with Structured Output and Functional Generative Description (MP, FM, ML), pp. 500–511.

LATA-2010-Tamm #automaton

Some Minimality Results on Biresidual and Biseparable Automata (HT), pp. 573–584.

SEFM-2010-HakimipourSW #java #named #realtime

TART: Timed-Automata to Real-Time Java Tool (NH, PAS, AJW), pp. 299–309.

SEKE-2010-Cao #automaton #interface #refinement

Refinement Checking for Interface Automata with Z Notation (ZC), pp. 399–404.

QAPL-2010-AltisenLM #automaton #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.

POPL-2010-GershenfeldDCKGDGS #automaton #configuration management #logic

Reconfigurable asynchronous logic automata: (RALA) (NG, DD, KC, AK, FG, EDD, SG, PSN), pp. 1–6.

SAC-2010-Fellah #automaton #framework #model checking

Time and alternation: an automata based framework to software model checking (AF), pp. 2498–2502.

SAC-2010-FlouriMJ #automaton #multi

Aho-Corasick like multiple subtree matching by pushdown automata (TF, BM, JJ), pp. 2157–2158.

CAV-2010-AbdullaCCHHMV #automaton #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 #automaton #framework #learning #named

libalf: The Automata Learning Framework (BB, JPK, CK, ML, DN, DRP), pp. 360–364.

CAV-2010-HerbreteauSW #automaton #performance

Efficient Emptiness Check for Timed Büchi Automata (FH, BS, IW), pp. 148–161.

CSL-2010-BenediktLP #automaton #logic #word

Automata vs. Logics on Data Words (MB, CL, GP), pp. 110–124.

ICST-2010-LodingP #automaton #generative #model checking #testing

Timed Moore Automata: Test Data Generation and Model Checking (HL, JP), pp. 449–458.

IJCAR-2010-FriedmannLL #automaton

A Decision Procedure for CTL* Based on Tableaux and Automata (OF, ML, ML), pp. 331–345.

LICS-2010-BargunoCGJV #automaton #constraints #problem

The Emptiness Problem for Tree Automata with Global Constraints (LB, CC, GG, FJ, CV), pp. 263–272.

LICS-2010-BojanczykL #automaton #xpath

An Extension of Data Automata that Captures XPath (MB, SL), pp. 243–252.

LICS-2010-EisentrautHZ #automaton #on the #probability

On Probabilistic Automata in Continuous Time (CE, HH, LZ), pp. 342–351.

LICS-2010-JenkinsORW #automaton #bound

Alternating Timed Automata over Bounded Time (MJ, JO, AR, JW), pp. 60–69.

RTA-2010-Bojanczyk #automaton #word

Automata for Data Words and Data Trees (MB), pp. 1–4.

SAT-2010-Ehlers #automaton #satisfiability #using

Minimising Deterministic Büchi Automata Precisely Using SAT Solving (RE), pp. 326–332.

VMCAI-2010-BuZL #automaton #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.

ASE-2009-YuAB #analysis #generative #source code #string #using

Generating Vulnerability Signatures for String Manipulating Programs Using Automata-Based Forward and Backward Symbolic Analyses (FY, MA, TB), pp. 605–609.

CASE-2009-MitraS #automaton #composition #hybrid

Hybrid Input Output Automata for composable conveyor systems (SM, SS), p. 29.

PODS-2009-CohenKS #automaton #probability #xml

Running tree automata on probabilistic XML (SC, BK, YS), pp. 227–236.

ITiCSE-2009-Merceron #automaton #design pattern #education

Design patterns to support teaching of automata theory (AM), p. 341.

FASE-2009-HuismanT #automaton #ml #security

A Formal Connection between Security Automata and JML Annotations (MH, AT), pp. 340–354.

FoSSaCS-2009-BerardH #automaton

Interrupt Timed Automata (BB, SH), pp. 197–211.

FoSSaCS-2009-KupfermanP #automaton #bound

Lower Bounds on Witnesses for Nonemptiness of Universal Co-Büchi Automata (OK, NP), pp. 182–196.

FoSSaCS-2009-Schewe #automaton #bound #nondeterminism

Tighter Bounds for the Determinisation of Büchi Automata (SS), pp. 167–181.

FoSSaCS-2009-Stirling #automaton #dependence

Dependency Tree Automata (CS), pp. 92–106.

CIAA-J-2008-AbdullaBHKV09 #automaton #bisimulation

Composed Bisimulation for Tree Automata (PAA, AB, LH, LK, TV), pp. 685–700.

CIAA-J-2008-CantinLW09 #automaton

Computing Convex Hulls by Automata Iteration (FC, AL, PW), pp. 647–667.

CIAA-J-2008-HolzerK09 #automaton #complexity #finite #nondeterminism

Nondeterministic Finite Automata — Recent Results on the Descriptional and Computational Complexity (MH, MK), pp. 563–580.

CIAA-J-2008-MatsumotoHT09 #automaton #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 #automaton

Deterministic Pushdown Automata and Unary Languages (GP), pp. 629–645.

CIAA-2009-CaronCM #automaton

Small Extended Expressions for Acyclic Automata (PC, JMC, LM), pp. 198–207.

CIAA-2009-CleophasH #algorithm #automaton #tool support

Forest FIRE: A Taxonomy-based Toolkit of Tree Automata and Regular Tree Algorithms (LGC, KH), pp. 245–248.

CIAA-2009-Freivalds #automaton #finite

Amount of Nonconstructivity in Finite Automata (RF), pp. 227–236.

CIAA-2009-Fujiyoshi #automaton #graph #recognition

Recognition of a Spanning Tree of Directed Acyclic Graphs by Tree Automata (AF), pp. 105–114.

CIAA-2009-GantyMR #abstraction #automaton #fixpoint #refinement

Fixpoint Guided Abstraction Refinement for Alternating Automata (PG, NM, JFR), pp. 155–164.

CIAA-2009-GruberHT #automaton #empirical #finite #regular expression

Short Regular Expressions from Finite Automata: Empirical Results (HG, MH, MT), pp. 188–197.

CIAA-2009-HeamNS #automaton #generative #random

Random Generation of Deterministic Tree (Walking) Automata (PCH, CN, SS), pp. 115–124.

CIAA-2009-HolubS #automaton #finite #implementation #on the #parallel

On Parallel Implementations of Deterministic Finite Automata (JH, SS), pp. 54–64.

CIAA-2009-IosifR #proving #termination

Automata-Based Termination Proofs (RI, AR), pp. 165–177.

CIAA-2009-Koch #automaton #xml

Applications of Automata in XML Processing (CK), p. 2.

CIAA-2009-KutribM #automaton #communication

Cellular Automata with Sparse Communication (MK, AM), pp. 34–43.

CIAA-2009-LuY #automaton #finite #question

Are Statecharts Finite Automata? (HL, SY), pp. 258–261.

CIAA-2009-Navarro #automaton #implementation #string

Implementation and Application of Automata in String Processing (GN), p. 1.

CIAA-2009-Prochazka #automaton #compilation #generative

Compiler Generator Based on Restarting Automata (JP), pp. 253–257.

CIAA-2009-Seidl #automaton #finite #program analysis

Program Analysis through Finite Tree Automata (HS), p. 3.

CIAA-2009-VuilleminG #automaton #normalisation #regular expression

Compact Normal Form for Regular Languages as Xor Automata (JV, NG), pp. 24–33.

DLT-2009-BealP #automaton #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 #automaton #finite #multi #on the

On Stateless Multihead Finite Automata and Multihead Pushdown Automata (PF, OHI), pp. 240–251.

DLT-2009-Kapoutsis #automaton #complexity #finite

Size Complexity of Two-Way Finite Automata (CAK), pp. 47–66.

ICALP-v2-2009-BaierBBB #automaton #question

When Are Timed Automata Determinizable? (CB, NB, PB, TB), pp. 43–54.

ICALP-v2-2009-ColcombetZ #automaton #bound

A Tight Lower Bound for Determinization of Transition Labeled Büchi Automata (TC, KZ), pp. 151–162.

ICALP-v2-2009-ParysW #automaton

Weak Alternating Timed Automata (PP, IW), pp. 273–284.

LATA-2009-BoigelotD #automaton #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 #automaton #multi

Multi-tilde Operators and Their Glushkov Automata (PC, JMC, LM), pp. 290–301.

LATA-2009-CattaneoDFP #automaton

Non-uniform Cellular Automata (GC, AD, EF, JP), pp. 302–313.

LATA-2009-ClarridgeS #automaton #composition

A Cryptosystem Based on the Composition of Reversible Cellular Automata (AC, KS), pp. 314–325.

LATA-2009-HolzerK #automaton #complexity #finite

Descriptional and Computational Complexity of Finite Automata (MH, MK), pp. 23–42.

LATA-2009-JacquemardKV #automaton

Rigid Tree Automata (FJ, FK, CV), pp. 446–457.

LATA-2009-JiraskovaP #automaton #self #verification

Converting Self-verifying Automata into Deterministic Automata (GJ, GP), pp. 458–468.

LATA-2009-LimayeM #automaton #multi #testing

Membership Testing: Removing Extra Stacks from Multi-stack Pushdown Automata (NL, MM), pp. 493–504.

LATA-2009-LisitsaPS #automaton #word

Automata on Gauss Words (AL, IP, RS), pp. 505–517.

LATA-2009-Nicaud #automaton #on the

On the Average Size of Glushkov’s Automata (CN), pp. 626–637.

LATA-2009-PardubskaPO #automaton #communication #correctness #on the #parallel

On Parallel Communicating Grammar Systems and Correctness Preserving Restarting Automata (DP, MP, FO), pp. 660–671.

LATA-2009-PribavkinaR #automaton

Finitely Generated Synchronizing Automata (EVP, ER), pp. 672–683.

LATA-2009-Salomaa #automaton #complexity #word

State Complexity of Nested Word Automata (KS), pp. 59–70.

LATA-2009-SumanP #automaton #integer

Determinization and Expressiveness of Integer Reset Timed Automata with Silent Transitions (PVS, PKP), pp. 728–739.

LATA-2009-VerwerWW #automaton

One-Clock Deterministic Timed Automata Are Efficiently Identifiable in the Limit (SV, MdW, CW), pp. 740–751.

REFSQ-2009-Kof #automaton #modelling #specification

Translation of Textual Specifications to Automata by Means of Discourse Context Modeling (LK), pp. 197–211.

SAC-2009-GiroD #automaton #on the #probability #verification

On the verification of probabilistic I/O automata with unspecified rates (SG, PRD), pp. 582–586.

SAC-2009-KoehlerC #automaton

Decomposing port automata (CK, DC), pp. 1369–1373.

ESEC-FSE-2009-HannaBR #automation #automaton #behaviour #composition #independence #verification

Behavioral automata composition for automatic topology independent verification of parameterized systems (YH, SB, HR), pp. 325–334.

CADE-2009-BoigelotBL #automaton #theorem

A Generalization of Semenov’s Theorem to Automata over Real Numbers (BB, JB, JL), pp. 469–484.

CSL-2009-DuparcFM #automaton #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-CaiZL #automaton #bound

An Improved Lower Bound for the Complementation of Rabin Automata (YC, TZ, HL), pp. 167–176.

LICS-2009-ChenHKM #automaton #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 #automaton #graph #infinity #reachability

Graph Reachability and Pebble Automata over Infinite Alphabets (TT), pp. 157–166.

MBT-2009-DadeauLH #automaton #generative #on the #random #testing

On the Use of Uniform Random Generation of Automata for Testing (FD, JL, PCH), pp. 37–51.

VMCAI-2009-JurdzinskiLR #automaton #game studies #hybrid

Average-Price-per-Reward Games on Hybrid Automata with Strong Resets (MJ, RL, MR), pp. 167–181.

VMCAI-2009-Oshman #bound #model checking

An Automata-Theoretic Dynamic Completeness Criterion for Bounded Model-Checking (RO), pp. 275–289.

DAC-2008-PiyachonL #automaton #design #finite #pattern matching #performance

Design of high performance pattern matching engine through compact deterministic finite automata (PP, YL), pp. 852–857.

PODS-2008-CateS #automaton #logic #transitive #xpath

XPath, transitive closure logic, and nested tree walking automata (BtC, LS), pp. 251–260.

ITiCSE-2008-Garcia-OsorioMJG #automaton #education #turing machine

Teaching push-down automata and turing machines (CGO, IMS, JJV, NGP), p. 316.

FoSSaCS-2008-BaierBG #automaton #on the #probability #problem

On Decision Problems for Probabilistic Büchi Automata (CB, NB, MG), pp. 287–301.

FoSSaCS-2008-BouyerMR #analysis #automaton #robust

Robust Analysis of Timed Automata via Channel Machines (PB, NM, PAR), pp. 157–171.

FoSSaCS-2008-DemriLS #automaton #ltl #model checking

Model Checking Freeze LTL over One-Counter Automata (SD, RL, AS), pp. 490–504.

FoSSaCS-2008-DrosteQ #automaton #theorem

A Kleene-Schützenberger Theorem for Weighted Timed Automata (MD, KQ), pp. 142–156.

TACAS-2008-AbdullaBHKV #automaton #simulation

Computing Simulations over Tree Automata (PAA, AB, LH, LK, TV), pp. 93–108.

TACAS-2008-TsayCTCL #automaton #logic #research #towards

GOAL Extended: Towards a Research Tool for ω Automata and Temporal Logic (YKT, YFC, MHT, WCC, CJL), pp. 346–350.

SAS-2008-Leroux #automaton

Convex Hull of Arithmetic Automata (JL), pp. 47–61.

DLT-J-2007-Freivalds08 #automaton #finite #probability

Non-Constructive Methods for Finite Probabilistic Automata (RF), pp. 565–580.

DLT-J-2007-JirasekJS08 #automaton #finite #nondeterminism

Deterministic blow-UPS of Minimal Nondeterministic Finite Automata over a Fixed Alphabet (JJ, GJ, AS), pp. 617–631.

DLT-J-2007-Tamm08 #automaton #on the

On Transition Minimality of Bideterministic Automata (HT), pp. 677–690.

AFL-2008-Bartha #automaton #equivalence #simulation

Simulation equivalence of automata and circuits (MB), pp. 86–99.

AFL-2008-Cruz-ReyesK #automaton

Non-Linear Subband Coding with Cellular Automata (CCR, JK), pp. 146–157.

AFL-2008-GeffertBS #automaton

Hyper-Minimizing Minimized Deterministic Automata (VG, AB, IS), pp. 9–30.

AFL-2008-KaminskiZ #automaton #nondeterminism

Extending finite-memory automata with non-deterministic reassignment (Extended abstract) (MK, DZ), pp. 195–207.

AFL-2008-Kresz #automaton

Automata associated with open conjugated systems (MK), pp. 232–244.

AFL-2008-KutribMO #automaton #on the

On Stateless Two-Pushdown Automata and Restarting Automata (MK, HM, FO), pp. 257–268.

AFL-2008-Martyugin #automaton #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 #automaton #multi #on the

On Pure Multi-Pushdown Automata that Perform Complete-Pushdown Pops (TM, AM), pp. 325–336.

AFL-2008-Sakarovitch #automaton #transducer

The sequentialisation of automata and transducers (Abstract) (JS), pp. 56–57.

CIAA-2008-AbdullaBHKV #automaton #bisimulation

Composed Bisimulation for Tree Automata (PAA, AB, LH, LK, TV), pp. 212–222.

CIAA-2008-BouajjaniHHTV #automaton #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 #automaton

Computing Convex Hulls by Automata Iteration (FC, AL, PW), pp. 112–121.

CIAA-2008-DixonES #analysis

Automata-Theoretic Analysis of Bit-Split Languages for Packet Scanning (RD, ÖE, TS), pp. 141–150.

CIAA-2008-Fujiyoshi #automaton #context-free grammar

Combination of Context-Free Grammars and Tree Automata for Unranked and Ranked Trees (AF), pp. 283–285.

CIAA-2008-GarciaPAR #automaton #finite #learning #nondeterminism #regular expression #using

Learning Regular Languages Using Nondeterministic Finite Automata (PG, MVdP, GIA, JR), pp. 92–101.

CIAA-2008-HolzerK #complexity #finite #nondeterminism

Nondeterministic Finite Automata-Recent Results on the Descriptional and Computational Complexity (MH, MK), pp. 1–16.

CIAA-2008-MatsumotoHT #automaton #implementation #pattern matching #performance #runtime

A Run-Time Efficient Implementation of Compressed Pattern Matching Automata (TM, KH, MT), pp. 201–211.

CIAA-2008-Pighizzini #automaton

Deterministic Pushdown Automata and Unary Languages (GP), pp. 232–241.

CIAA-2008-Yannakakis #automaton #probability #recursion

Automata, Probability, and Recursion (MY), pp. 23–32.

DLT-2008-AllauzenMR #algorithm #ambiguity #automaton #finite #testing

General Algorithms for Testing the Ambiguity of Finite Automata (CA, MM, AR), pp. 108–120.

DLT-2008-AtigBH #automaton #multi

Emptiness of Multi-pushdown Automata Is 2ETIME-Complete (MFA, BB, PH), pp. 121–133.

DLT-2008-BordihnKM #automaton #capacity #communication #finite #on the #parallel

On the Computational Capacity of Parallel Communicating Finite Automata (HB, MK, AM), pp. 146–157.

DLT-2008-CarpiD #automaton #problem #transitive

The Synchronization Problem for Strongly Transitive Automata (AC, FD), pp. 240–251.

DLT-2008-DennunzioF #2d #automaton #decidability

Decidable Properties of 2D Cellular Automata (AD, EF), pp. 264–275.

DLT-2008-FiliotTT #automaton #constraints

Tree Automata with Global Constraints (EF, JMT, ST), pp. 314–326.

DLT-2008-GeffertMP #automaton #regular expression #representation

More Concise Representation of Regular Languages by Automata and Regular Expressions (VG, CM, BP), pp. 359–370.

DLT-2008-Glockler #automaton #taxonomy

A Taxonomy of Deterministic Forgetting Automata (JG), pp. 371–382.

DLT-2008-GruberH #automaton #finite #regular expression

Provably Shorter Regular Expressions from Deterministic Finite Automata (HG, MH), pp. 383–395.

DLT-2008-Hirvensalo #aspect-oriented #automaton #finite #quantum

Various Aspects of Finite Quantum Automata (MH), pp. 21–33.

DLT-2008-JiraskovaO #automaton #complexity #finite #on the

On the State Complexity of Operations on Two-Way Finite Automata (GJ, AO), pp. 443–454.

DLT-2008-KapoutsisKM #automaton #complexity #on the

On the Size Complexity of Rotating and Sweeping Automata (CAK, RK, TM), pp. 455–466.

DLT-2008-KuskeM #automaton #regular expression

Construction of Tree Automata from Regular Expressions (DK, IM), pp. 491–503.

ICALP-A-2008-KahlerW #ambiguity #automaton

Complementation, Disambiguation, and Determinization of Büchi Automata Unified (DK, TW), pp. 724–735.

ICALP-B-2008-BoigelotBB #automaton #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 #automaton #nondeterminism

The Non-deterministic Mostowski Hierarchy and Distance-Parity Automata (TC, CL), pp. 398–409.

ICALP-B-2008-GruberH #automaton #finite #regular expression

Finite Automata, Digraph Connectivity, and Regular Expression Size (HG, MH), pp. 39–50.

LATA-2008-AndersonRSS #automaton #finite

Finite Automata, Palindromes, Powers, and Patterns (TA, NR, NS, JS), pp. 52–63.

LATA-2008-ArrighiNW #automaton #bound #finite #quantum

One-Dimensional Quantum Cellular Automata over Finite, Unbounded Configurations (PA, VN, RFW), pp. 64–75.

LATA-2008-BenschBHK #automaton #finite

Deterministic Input-Reversal and Input-Revolving Finite Automata (SB, HB, MH, MK), pp. 113–124.

LATA-2008-Bojanczyk #automaton

Tree-Walking Automata (MB), pp. 1–2.

LATA-2008-Capobianco #automaton

Induced Subshifts and Cellular Automata (SC), pp. 160–171.

LATA-2008-CastiglioneRS #algorithm #automaton

Hopcroft’s Algorithm and Cyclic Automata (GC, AR, MS), pp. 172–183.

LATA-2008-ChampavereGLN #automaton #performance

Efficient Inclusion Checking for Deterministic Tree Automata and DTDs (JC, RG, AL, JN), pp. 184–195.

LATA-2008-Klunder #automaton #finite #using

Characterization of Star-Connected Languages Using Finite Automata (BK), pp. 311–320.

LATA-2008-Maletti #automaton

Minimizing Deterministic Weighted Tree Automata (AM), pp. 357–372.

LATA-2008-Mercer #automaton #bound #finite #quantum

Lower Bounds for Generalized Quantum Finite Automata (MM), pp. 373–384.

LATA-2008-OttoP #2d #taxonomy

A Two-Dimensional Taxonomy of Proper Languages of Lexicalized FRR-Automata (FO, MP), pp. 409–420.

LATA-2008-RegnaultST #2d #analysis #automaton #on the #probability

On the Analysis of “Simple” 2D Stochastic Cellular Automata (DR, NS, ET), pp. 452–463.

LATA-2008-RenderK #automaton

Polycyclic and Bicyclic Valence Automata (ER, MK), pp. 464–475.

LATA-2008-Volkov #automaton

Synchronizing Automata and the Cerny Conjecture (MVV), pp. 11–27.

FM-2008-EmmiGP #automaton #interface #verification

Assume-Guarantee Verification for Interface Automata (ME, DG, CSP), pp. 116–131.

SFM-2008-Zavattaro #automaton #probability

A Gentle Introduction to Stochastic (Poly)Automata Collectives and the (Bio)Chemical Ground Form (GZ), pp. 507–523.

GT-VMT-2008-KumarM #automaton #sequence chart #verification

Improving Live Sequence Chart to Automata Transformation for Verification (RK, EGM).

AdaEurope-2008-OberH #on the #verification

On the Timed Automata-Based Verification of Ravenscar Systems (IO, NH), pp. 30–43.

ICEIS-AIDSS-2008-ZimbresBO #automaton #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.

SEKE-2008-FraserWW #automaton #testing #using

Using Observer Automata to Select Test Cases for Test Purposes (GF, MW, FW), pp. 709–714.

CAV-2008-AlurKW #automaton #game studies #ranking #requirements

Ranking Automata and Games for Prioritized Requirements (RA, AK, GW), pp. 240–253.

CSL-2008-Cardelli #automaton

Molecules as Automata (LC), p. 32.

CSL-2008-Eisinger #automaton #bound #integer #linear

Upper Bounds on the Automata Size for Integer and Mixed Real and Integer Linear Arithmetic (Extended Abstract) (JE), pp. 431–445.

IJCAR-2008-BaaderP #axiom

Automata-Based Axiom Pinpointing (FB, RP), pp. 226–241.

IJCAR-2008-BouhoulaJ #automation #automaton #induction

Automated Induction with Constrained Tree Automata (AB, FJ), pp. 539–554.

IJCAR-2008-BoyerGJ #automaton

Certifying a Tree Automata Completion Checker (BB, TG, TPJ), pp. 523–538.

LICS-2008-BaierBBBG #automaton #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-HagueMOS #automaton #recursion

Collapsible Pushdown Automata and Recursion Schemes (MH, ASM, CHLO, OS), pp. 452–461.

RTA-2008-HendrixO #automaton #equation

Combining Equational Tree Automata over AC and ACI Theories (JH, HO), pp. 142–156.

RTA-2008-JacquemardR

Closure of Hedge-Automata Languages by Hedge Rewriting (FJ, MR), pp. 157–171.

RTA-2008-KobayashiO #automaton

Tree Automata for Non-linear Arithmetic (NK, HO), pp. 291–305.

RTA-2008-KuhlmannN #automaton #logic #order

Logics and Automata for Totally Ordered Trees (MK, JN), pp. 217–231.

TestCom-FATES-2008-BochmannHJJ #automaton #partial order #testing

Testing Systems Specified as Partial Order Input/Output Automata (GvB, SH, CJ, GVJ), pp. 169–183.

VMCAI-2008-KupfermanL #automaton #game studies #logic #multi #simulation

Multi-valued Logics, Automata, Simulations, and Games (OK, YL), p. 5.

VMCAI-2008-MorgensternS #automaton #ltl

From LTL to Symbolically Represented Deterministic Automata (AM, KS), pp. 279–293.

ITiCSE-2007-RodgerLR #automaton #formal method #interactive

Increasing interaction and support in the formal languages and automata theory course (SHR, JL, SR), pp. 58–62.

ITiCSE-2007-StallmannBRBGH #automaton #correctness #named #proving

ProofChecker: an accessible environment for automata theory correctness proofs (MFS, SB, RDR, SB, MCG, SDH), pp. 48–52.

ESOP-2007-LarsenNW #automaton #interface #product line

Modal I/O Automata for Interface and Product Line Theories (KGL, UN, AW), pp. 64–79.

FoSSaCS-2007-AbdullaKY #automaton

Sampled Universality of Timed Automata (PAA, PK, WY), pp. 2–16.

FoSSaCS-2007-BouyerLM #automaton #model checking

Model-Checking One-Clock Priced Timed Automata (PB, KGL, NM), pp. 108–122.

FoSSaCS-2007-Comon-LundhJP #automaton #constraints #memory management

Tree Automata with Memory, Visibility and Structural Constraints (HCL, FJ, NP), pp. 168–182.

TACAS-2007-DAprileDSS #approach #automaton #petri net

From Time Petri Nets to Timed Automata: An Untimed Approach (DD, SD, AS, JS), pp. 216–230.

TACAS-2007-DoyenR #algorithm #approach #model checking

Improved Algorithms for the Automata-Based Approach to Model-Checking (LD, JFR), pp. 451–465.

TACAS-2007-JurdzinskiLS #automaton #model checking #probability

Model Checking Probabilistic Timed Automata with One or Two Clocks (MJ, FL, JS), pp. 170–184.

TACAS-2007-TsayCTWC #automaton #named #visual notation

GOAL: A Graphical Tool for Manipulating Büchi Automata and Temporal Formulae (YKT, YFC, MHT, KNW, WCC), pp. 466–471.

SAS-2007-GallJ #automaton #infinity #representation #verification

Lattice Automata: A Representation for Languages on Infinite Alphabets, and Some Applications to Verification (TLG, BJ), pp. 52–68.

CIAA-J-2006-AbdullaHK07 #automaton #bisimulation

Bisimulation Minimization of Tree Automata (PAA, JH, LK), pp. 699–713.

CIAA-J-2006-BloemCPR07 #automaton #implementation

Symbolic Implementation of Alternating Automata (RB, AC, IP, MR), pp. 727–743.

CIAA-J-2006-BordihnHK07 #automaton #finite #hybrid

Hybrid Extended Finite Automata (HB, MH, MK), pp. 745–760.

CIAA-J-2006-CortesMR07 #automaton #distance #equivalence #probability

LP Distance and Equivalence of Probabilistic Automata (CC, MM, AR), pp. 761–779.

CIAA-J-2006-GiraudVL07 #automaton

Path-Equivalent Developments in Acyclic Weighted Automata (MG, PV, DL), pp. 799–811.

CIAA-J-2006-Glockler07 #automaton

Forgetting Automata and Unary Languages (JG), pp. 813–827.

CIAA-J-2006-NicartCCGK07 #automaton #multi

Labelling Multi-Tape Automata with Constrained Symbol Classes (FN, JMC, TC, TG, AK), pp. 847–858.

CIAA-J-2006-SimunekM07 #automaton #finite

Borders and Finite Automata (MS, BM), pp. 859–871.

CIAA-2007-BassinoDN #automaton #library

: A Library to Randomly and Exhaustively Generate Automata (FB, JD, CN), pp. 303–305.

CIAA-2007-CarrascoDF #automaton #implementation

An Implementation of Deterministic Tree Automata Minimization (RCC, JD, MLF), pp. 122–129.

CIAA-2007-DrosteR #automaton #logic

Weighted Automata and Weighted Logics with Discounting (MD, GR), pp. 73–84.

CIAA-2007-HogbergMM #automaton #bisimulation

Backward and Forward Bisimulation Minimisation of Tree Automata (JH, AM, JM), pp. 109–121.

CIAA-2007-JonoskaP #2d #automaton #finite #representation

Finite State Automata Representing Two-Dimensional Subshifts (NJ, JBP), pp. 277–289.

CIAA-2007-KleinB #automaton #on the fly

On-the-Fly Stuttering in the Construction of Deterministic ω-Automata (JK, CB), pp. 51–61.

CIAA-2007-Klunder #automaton #finite

Finite Automata Accepting Star-Connected Languages (BK), pp. 312–313.

CIAA-2007-KutribMW #automaton #nondeterminism

Regulated Nondeterminism in Pushdown Automata (MK, AM, LW), pp. 85–96.

CIAA-2007-MohriMW #automaton

Factor Automata of Automata and Applications (MM, PJM, EW), pp. 168–179.

CIAA-2007-Vardi #automaton #linear #model checking

Linear-Time Model Checking: Automata Theory in Practice (MYV), pp. 5–10.

CIAA-2007-Volkov #automaton #partial order

Synchronizing Automata Preserving a Chain of Partial Orders (MVV), pp. 27–37.

CIAA-2007-Watson #automaton

Automata Applications in Chip-Design Software (BWW), pp. 24–26.

DLT-2007-BelovsRS #automaton #finite #multi #quantum

Multi-letter Reversible and Quantum Finite Automata (AB, AR, JS), pp. 60–71.

DLT-2007-BienvenuS #automaton #invariant

The Dynamics of Cellular Automata in Shift-Invariant Topologies (LB, MS), pp. 84–95.

DLT-2007-BordihnHK #automaton #finite

Hairpin Finite Automata (HB, MH, MK), pp. 108–119.

DLT-2007-CarotenutoMP #automaton

2-Visibly Pushdown Automata (DC, AM, AP), pp. 132–144.

DLT-2007-Freivalds #automaton #finite #probability

Non-constructive Methods for Finite Probabilistic Automata (RF), pp. 169–180.

DLT-2007-HogbergMM #automaton #bisimulation

Bisimulation Minimisation for Weighted Tree Automata (JH, AM, JM), pp. 229–241.

DLT-2007-JirasekJS #automaton #finite #nondeterminism

Deterministic Blow-Ups of Minimal Nondeterministic Finite Automata over a Fixed Alphabet (JJ, GJ, AS), pp. 254–265.

DLT-2007-Priese #automaton #finite #graph

Finite Automata on Unranked and Unordered DAGs (LP), pp. 346–360.

DLT-2007-Sakarovitch #automaton #finite

Finite Automata and the Writing of Numbers (JS), pp. 29–30.

DLT-2007-Salomaa #automaton #complexity #finite #nondeterminism

Descriptional Complexity of Nondeterministic Finite Automata (KS), pp. 31–35.

DLT-2007-SciortinoZ #automaton #standard #word

Suffix Automata and Standard Sturmian Words (MS, LQZ), pp. 382–398.

DLT-2007-Tamm #automaton #on the

On Transition Minimality of Bideterministic Automata (HT), pp. 411–421.

ICALP-2007-ArenasBL #automaton #fixpoint #regular expression #word

Regular Languages of Nested Words: Fixed Points, Automata, and Synchronization (MA, PB, LL), pp. 888–900.

ICALP-2007-BoigelotB #automaton #theorem

A Generalization of Cobham’s Theorem to Automata over Real Numbers (BB, JB), pp. 813–824.

ICALP-2007-BozzelliT #automaton #bound #parametricity #problem

Decision Problems for Lower/Upper Bound Parametric Timed Automata (LB, SLT), pp. 925–936.

ICALP-2007-JurdzinskiT #automaton #game studies

Reachability-Time Games on Timed Automata (MJ, AT), pp. 838–849.

ICALP-2007-KariantoL #automaton

Unranked Tree Automata with Sibling Equalities and Disequalities (KW, CL), pp. 875–887.

LATA-2007-BaaderHP #automaton #exclamation #logic

SI! Automata Can Show PSPACE Results for Description Logics (FB, JH, RP), pp. 67–78.

LATA-2007-BolligK #automaton #logic #message passing

Muller Message-Passing Automata and Logics (BB, DK), pp. 163–174.

LATA-2007-DinuGM #automaton #on the #word

On the syllabification of words via go-through automata (LPD, RG, FM), pp. 223–236.

LATA-2007-Domosi #automaton #network

Automata Networks without any Letichevsky Criteria (PD), pp. 237–248.

LATA-2007-FrancezK #automaton

Pushdown automata with cancellation and commutation-augmented pregroups grammars (NF, MK), pp. 7–26.

LATA-2007-Kresz #automaton #nondeterminism

Nondeterministic soliton automata with a single external vertex (MK), pp. 319–330.

LATA-2007-KutribM #automaton #performance #recognition #using

Fast Reversible Language Recognition Using Cellular Automata (MK, AM), pp. 331–342.

LATA-2007-KutribR #automaton #regular expression

Succinct Description of Regular Languages by Weak Restarting Automata (MK, JR), pp. 343–354.

LATA-2007-LenaM #automaton #complexity

Computational Complexity of Dynamical Systems: the case of Cellular Automata (PdL, LM), pp. 211–222.

LATA-2007-Martugin #automaton

A series of slowly synchronizable automata with a zero state over a small alphabet (PVM), pp. 391–402.

LATA-2007-MesserschmidtO #automaton #nondeterminism #on the

On Determinism Versus Non-Determinism for Restarting Automata (HM, FO), pp. 413–424.

LATA-2007-MrazOP #automaton

Free Word-Order and Restarting Automata (FM, FO, MP), pp. 425–436.

IFM-2007-SalaunKLM #automaton #network

Translating FSP into LOTOS and Networks of Automata (GS, JK, FL, JM), pp. 558–578.

AGTIVE-2007-BoddenV #automaton #monitoring #runtime #specification #timeline

Transforming Timeline Specifications into Automata for Runtime Monitoring (EB, HV), pp. 249–264.

SAC-2007-MengA #automaton #constraints #distributed #web #web service

Web services choreography and orchestration in Reo and constraint automata (SM, FA), pp. 346–353.

CADE-2007-Stirling #automaton #game studies

Games, Automata and Matching (CS), pp. 1–2.

CADE-2007-UnelT #incremental

An Incremental Technique for Automata-Based Decision Procedures (GÜ, DT), pp. 100–115.

CAV-2007-Segelken #abstraction #automaton #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 #automaton #first-order #locality #logic #model checking

Model-Checking First-Order Logic: Automata and Locality (AD), p. 6.

CSL-2007-Kupferman #automaton

Tightening the Exchange Rates Between Automata (OK), pp. 7–22.

ICLP-2007-UnelT #approach #logic programming

Logic Programming Approach to Automata-Based Decision Procedures (GÜ, DT), pp. 165–179.

ISSTA-2007-ShohamYFP #abstraction #mining #specification #using

Static specification mining using automata-based abstractions (SS, EY, SF, MP), pp. 174–184.

LICS-2007-Stirling #automaton #game studies #higher-order

Higher-Order Matching, Games and Automata (CS), pp. 326–335.

TestCom-FATES-2007-HaarJJ #automaton #partial order #testing

Testing Input/Output Partial Order Automata (SH, CJ, GVJ), pp. 171–185.

VMCAI-2007-KupfermanL #automaton

Lattice Automata (OK, YL), pp. 199–213.

VMCAI-2007-Vardi #formal method #model checking #revisited

Automata-Theoretic Model Checking Revisited (MYV), pp. 137–150.

DATE-2006-GuptaJL #automaton #generative #quantum #testing

Test generation for combinational quantum cellular automata (QCA) circuits (PG, NKJ, LL), pp. 311–316.

ITiCSE-2006-Bozic #algorithm #automaton #finite #modelling

Application of finite state automata to the bakery algorithm in critical section modeling (VB), p. 362.

ITiCSE-2006-HielscherW #automaton #education #formal method #learning #named

AtoCC: learning environment for teaching theory of automata and formal languages (MH, CW), p. 306.

ITiCSE-2006-Rodger #automaton #formal method #learning

Learning automata and formal languages interactively with JFLAP (SHR), p. 360.

ITiCSE-2006-SchreyerW #automaton #finite #modelling #problem

Finite automata models for CS problem with binary semaphore (BS, WW), p. 330.

FASE-2006-RaffeltS #automaton #learning #library #named

LearnLib: A Library for Automata Learning and Experimentation (HR, BS), pp. 377–380.

FoSSaCS-2006-EdalatP #automaton #hybrid #semantics

Denotational Semantics of Hybrid Automata (AE, DP), pp. 231–245.

TACAS-2006-HabermehlIV #source code #verification

Automata-Based Verification of Programs with Tree Updates (PH, RI, TV), pp. 350–364.

PLDI-2006-ErtlCG #automaton #flexibility #on-demand #performance

Fast and flexible instruction selection with on-demand tree-parsing automata (MAE, KC, DG), pp. 52–60.

CIAA-2006-AbdullaKH #automaton #bisimulation

Bisimulation Minimization of Tree Automata (PAA, LK, JH), pp. 173–185.

CIAA-2006-AntoniouHIMP #automaton #finite #using

Finding Common Motifs with Gaps Using Finite Automata (PA, JH, CSI, BM, PP), pp. 69–77.

CIAA-2006-BloemCPRS #automaton #implementation

Symbolic Implementation of Alternating Automata (RB, AC, IP, MR, SS), pp. 208–218.

CIAA-2006-BonfanteRP #ambiguity #automaton

Lexical Disambiguation with Polarities and Automata (GB, JLR, GP), pp. 283–284.

CIAA-2006-BordihnHK #automaton #finite #hybrid

Hybrid Extended Finite Automata (HB, MH, MK), pp. 34–45.

CIAA-2006-ConstantM #automaton #compilation #constraints #finite

Compiling Linguistic Constraints into Finite State Automata (MC, DM), pp. 242–252.

CIAA-2006-CortesMR #automaton #on the #probability #standard

On the Computation of Some Standard Distances Between Probabilistic Automata (CC, MM, AR), pp. 137–149.

CIAA-2006-Glockler #automaton

Forgetting Automata and Unary Languages (JG), pp. 186–197.

CIAA-2006-Leung #ambiguity #automaton #finite

Structurally Unambiguous Finite Automata (HL), pp. 198–207.

CIAA-2006-MayK #automaton #named #tool support

Tiburon: A Weighted Tree Automata Toolkit (JM, KK), pp. 102–113.

CIAA-2006-MesserschmidtMOP #complexity #correctness

Correctness Preservation and Complexity of Simple RL-Automata (HM, FM, FO, MP), pp. 162–172.

CIAA-2006-NicartCCGK #automaton #multi

Multi-tape Automata with Symbol Classes (FN, JMC, TC, TG, AK), pp. 126–136.

CIAA-2006-SimunekM #automaton #finite

Borders and Finite Automata (MS, BM), pp. 58–68.

CIAA-2006-Tischler #automaton #finite #random #refinement #video

Refinement of Near Random Access Video Coding with Weighted Finite Automata (GT), pp. 46–57.

DLT-2006-AnanichevVZ #automaton

Synchronizing Automata with a Letter of Deficiency 2 (DSA, MVV, YIZ), pp. 433–442.

DLT-2006-Caucal #automaton

Synchronization of Pushdown Automata (DC), pp. 120–132.

DLT-2006-DrosteR #automaton #infinity #logic #word

Weighted Automata and Weighted Logics on Infinite Words (MD, GR), pp. 49–58.

DLT-2006-FritzW #automaton #game studies #simulation

Simulation Relations for Alternating Parity Automata and Parity Games (CF, TW), pp. 59–70.

DLT-2006-KutribM #automaton #nondeterminism

Context-Dependent Nondeterminism for Pushdown Automata (MK, AM), pp. 133–144.

DLT-2006-MrazOP #on the

On the Gap-Complexity of Simple RL-Automata (FM, FO, MP), pp. 83–94.

DLT-2006-Ravikumar #automaton #finite #modelling #on the #probability

On Some Variations of Two-Way Probabilistic Finite Automata Models (BR), pp. 443–454.

ICALP-v1-2006-BojanczykSSS #automaton #power of

Expressive Power of Pebble Automata (MB, MS, TS, LS), pp. 157–168.

ICALP-v2-2006-BouyerHR #automaton #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 #automaton #parametricity

Flat Parametric Counter Automata (MB, RI, YL), pp. 577–588.

ICALP-v2-2006-GenestM #automaton

Constructing Exponential-Size Deterministic Zielonka Automata (BG, AM), pp. 565–576.

ICALP-v2-2006-Yan #automaton #bound

Lower Bounds for Complementation of ω-Automata Via the Full Automata Technique (QY), pp. 589–600.

FM-2006-LarsenNW #automaton #interface

Interface Input/Output Automata (KGL, UN, AW), pp. 82–97.

FM-2006-UmenoL #automaton #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.

SEFM-2006-Lodaya #algebra #automaton #process

Product Automata and Process Algebra (KL), pp. 128–136.

ICGT-2006-BerwangerJ #automaton #graph

Automata on Directed Graphs: Edge Versus Vertex Marking (DB, DJ), pp. 46–60.

SAC-2006-NasrBFI #automaton #specification #verification

Verification of a scheduler in B through a timed automata specification (ON, JPB, MF, MRI), pp. 1800–1801.

CAV-2006-BouajjaniBHIMV #automaton #source code

Programs with Lists Are Counter Automata (AB, MB, PH, RI, PM, TV), pp. 517–531.

CAV-2006-EisingerK #approach #word

Don’t Care Words with an Application to the Automata-Based Approach for Real Addition (JE, FK), pp. 67–80.

CAV-2006-HeljankoJKLL #automaton #bound #model checking

Bounded Model Checking for Weak Alternating Büchi Automata (KH, TAJ, MK, ML, TL), pp. 95–108.

CAV-2006-JuvekarP #automaton

Minimizing Generalized Büchi Automata (SJ, NP), pp. 45–58.

CAV-2006-KrcalY #automaton #communication #verification

Communicating Timed Automata: The More Synchronous, the More Difficult to Verify (PK, WY), pp. 249–262.

CAV-2006-WulfDHR #algorithm #anti #automaton #finite #named

Antichains: A New Algorithm for Checking Universality of Finite Automata (MDW, LD, TAH, JFR), pp. 17–30.

CSL-2006-Aehlig #automaton #finite #infinity #semantics

A Finite Semantics of Simply-Typed λ Terms for Infinite Runs of Automata (KA), pp. 104–118.

CSL-2006-Segoufin #automaton #infinity #logic #word

Automata and Logics for Words and Trees over an Infinite Alphabet (LS), pp. 41–57.

CSL-2006-Srba #automaton #bisimulation #equivalence #simulation

Visibly Pushdown Automata: From Language Equivalence to Simulation and Bisimulation (JS), pp. 89–103.

IJCAR-2006-JacquemardRV #automaton #constraints #equation #similarity

Tree Automata with Equality Constraints Modulo Equational Theories (FJ, MR, LV), pp. 557–571.

LICS-2006-DemriL #automaton #ltl #quantifier

LTL with the Freeze Quantifier and Register Automata (SD, RL), pp. 17–26.

LICS-2006-KahlonG #approach #ltl #model checking #thread

An Automata-Theoretic Approach for Model Checking Threads for LTL Propert (VK, AG), pp. 101–110.

LICS-2006-Piterman #automaton #nondeterminism

From Nondeterministic Buchi and Streett Automata to Deterministic Parity Automata (NP), pp. 255–264.

RTA-2006-HendrixOV #automaton

Propositional Tree Automata (JH, HO, MV), pp. 50–65.

ITiCSE-2005-Gal-EzerT #automaton #challenge #education

Challenges in teaching the pumping lemma in automata theory course (JGE, MBT), p. 369.

ITiCSE-2005-Verma #automaton #interactive #visual notation

A visual and interactive automata theory course emphasizing breadth of automata (RMV), pp. 325–329.

ITiCSE-2005-WermelingerD #automaton #formal method #prolog #tool support

A prolog toolkit for formal languages and automata (MW, AMD), pp. 330–334.

FoSSaCS-2005-BouyerCD #automaton #fault #using

Fault Diagnosis Using Timed Automata (PB, FC, DD), pp. 219–233.

FoSSaCS-2005-Fahrenberg #automaton

A Category of Higher-Dimensional Automata (UF), pp. 187–201.

FoSSaCS-2005-LarsenR #automaton #multi #reachability

Optimal Conditional Reachability for Multi-priced Timed Automata (KGL, JIR), pp. 234–249.

FoSSaCS-2005-LasotaW #automaton

Alternating Timed Automata (SL, IW), pp. 250–265.

TACAS-2005-KupfermanV #automaton #infinity #nondeterminism #word

Complementation Constructions for Nondeterministic Automata on Infinite Words (OK, MYV), pp. 206–221.

STOC-2005-BojanczykC #automaton #regular expression

Tree-walking automata do not recognize all regular languages (MB, TC), pp. 234–243.

CIAA-J-2004-GeserHWZ05 #automaton #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 #automaton #database #sequence

An automata approach to match gapped sequence tags against protein database (YH, BM, KZ), pp. 487–497.

CIAA-J-2004-HanW05 #automaton

The generalization of generalized automata: expression automata (YSH, DW), pp. 499–510.

DLT-J-2004-Maletti05 #automaton #transducer

Relating tree series transducers and weighted tree automata (AM), pp. 723–741.

CIAA-2005-AbdullaDKN #automaton #nondeterminism #scalability

Minimization of Non-deterministic Automata with Large Alphabets (PAA, JD, LK, MN), pp. 31–42.

CIAA-2005-AlthoffTW #automaton

Observations on Determinization of Büchi Automata (CSA, WT, NW), pp. 262–272.

CIAA-2005-AnselmoM #2d #automaton #queue #simulation

Simulating Two-Dimensional Recognizability by Pushdown and Queue Automata (MA, MM), pp. 43–53.

CIAA-2005-CampeanuPS #algorithm #automaton #finite #incremental

An Incremental Algorithm for Constructing Minimal Deterministic Finite Cover Automata (CC, AP, JRS), pp. 90–103.

CIAA-2005-CanoG #automaton #bound #constant #finite

Finite Automata and Unions of Regular Patterns with Bounded Constant Segments (AC, PG), pp. 104–115.

CIAA-2005-DaciukMS #automaton #incremental #pseudo

Incremental and Semi-incremental Construction of Pseudo-Minimal Automata (JD, DM, AS), pp. 341–342.

CIAA-2005-Freivalds #automaton #finite #quantum

Languages Recognizable by Quantum Finite Automata (RF), pp. 1–14.

CIAA-2005-HanW #automaton #finite #regular expression

Shorter Regular Expressions from Finite-State Automata (YSH, DW), pp. 141–152.

CIAA-2005-HigueraPT #automaton #finite #learning #probability #recognition

Learning Stochastic Finite Automata for Musical Style Recognition (CdlH, FP, FT), pp. 345–346.

CIAA-2005-JurdzinskiO #automaton #strict

Restricting the Use of Auxiliary Symbols for Restarting Automata (TJ, FO), pp. 176–187.

CIAA-2005-KleinB #automaton #linear #logic

Experiments with Deterministic ω-Automata for Formulas of Linear Temporal Logic (JK, CB), pp. 199–212.

CIAA-2005-LohreyM #automaton #xpath

Tree Automata and XPath on Compressed Trees (ML, SM), pp. 225–237.

CIAA-2005-MoraisMR #automaton #regular expression

Acyclic Automata with Easy-to-Find Short Regular Expressions (JJM, NM, RR), pp. 349–350.

CIAA-2005-PelanekS #automaton #ltl

Deeper Connections Between LTL and Alternating Automata (RP, JS), pp. 238–249.

CIAA-2005-Shcherbak #automaton #rank

The Interval Rank of Monotonic Automata (TS), pp. 273–281.

CIAA-2005-SubramanianS #automaton #documentation #finite #recursion #using #xml

Compressing XML Documents Using Recursive Finite State Automata (HS, PS), pp. 282–293.

CIAA-2005-SudaH #algorithm #automaton #backtracking #top-down

Non-backtracking Top-Down Algorithm for Checking Tree Automata Containment (TS, HH), pp. 294–306.

CIAA-2005-TammNU #automaton #multi #reduction

Size Reduction of Multitape Automata (HT, MN, EU), pp. 307–318.

CIAA-2005-Tellier #automaton

Automata and AB-Categorial Grammars (IT), pp. 353–355.

CIAA-2005-ZdarekM #2d #automaton #finite #on the #pattern matching

On Two-Dimensional Pattern Matching by Finite Automata (JZ, BM), pp. 329–340.

DLT-2005-AblayevG #automaton #complexity #quantum

Complexity of Quantum Uniform and Nonuniform Automata (FMA, AG), pp. 78–87.

DLT-2005-Ananichev #automaton

The Mortality Threshold for Partially Monotonic Automata (DSA), pp. 112–121.

DLT-2005-BordihnHK #automaton #finite

Revolving-Input Finite Automata (HB, MH, MK), pp. 168–179.

DLT-2005-GeffertMP #automaton #finite

Complementing Two-Way Finite Automata (VG, CM, GP), pp. 260–271.

DLT-2005-GruberHKK #automaton #on the

On Timed Automata with Discrete Time — Structural and Language Theoretical Characterization (HG, MH, AK, BK), pp. 272–283.

DLT-2005-JurdzinskiMOP

Monotone Deterministic RL-Automata Don’t Need Auxiliary Symbols (TJ, FM, FO, MP), pp. 284–295.

DLT-2005-Kari #automaton

Reversible Cellular Automata (JK), pp. 57–68.

DLT-2005-Karianto #automaton #graph

Adding Monotonic Counters to Automata and Transition Graphs (KW), pp. 308–319.

ICALP-2005-AbdullaDOW #automaton #complexity #decidability

Decidability and Complexity Results for Timed Automata via Channel Machines (PAA, JD, JO, JW), pp. 1089–1101.

ICALP-2005-BealLS #equivalence #on the

On the Equivalence of -Automata (MPB, SL, JS), pp. 397–409.

ICALP-2005-CzeizlerK #automaton #bound #linear

A Tight Linear Bound on the Neighborhood of Inverse Cellular Automata (EC, JK), pp. 410–420.

ICALP-2005-DrosteG #automaton #logic

Weighted Automata and Weighted Logics (MD, PG), pp. 513–525.

ICALP-2005-KnapikNUW #automaton

Unsafe Grammars and Panic Automata (TK, DN, PU, IW), pp. 1450–1461.

SEFM-2005-GebremichaelV #automaton #specification

Specifying Urgency in Timed I/O Automata (BG, FWV), pp. 64–74.

SEFM-2005-LanotteMT #analysis #automaton #data type #design #distributed

Timed Automata with Data Structures for Distributed Systems Design and Analysis (RL, AMS, AT), pp. 44–53.

SEFM-2005-WandelerJLT #automaton #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 #automaton

History-Dependent Automata: An Introduction (UM, MP), pp. 1–28.

FATES-2005-XieD #approach #concurrent #testing

Testing Systems of Concurrent Black-Boxes-An Automata-Theoretic and Decompositional Approach (GX, ZD), pp. 170–186.

LICS-2005-BaierG #automaton #probability #regular expression

Recognizing ω-regular Languages with Probabilistic Automata (CB, MG), pp. 137–146.

LICS-2005-EsparzaKM #analysis #automaton #probability

Quantitative Analysis of Probabilistic Pushdown Automata: Expectations and Variances (JE, AK, RM), pp. 117–126.

LICS-2005-KupkeV #algebra #automaton

Closure Properties of Coalgebra Automata (CK, YV), pp. 199–208.

RTA-2005-BonevaT #automaton #logic

Automata and Logics for Unranked and Unordered Trees (IB, JMT), pp. 500–515.

RTA-2005-GeserHWZ #automaton #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.

TestCom-2005-KrichenT #automaton #identification #problem

State Identification Problems for Timed Automata (MK, ST), pp. 175–191.

VMCAI-2005-DamsN #abstraction #automaton

Automata as Abstractions (DD, KSN), pp. 216–232.

VMCAI-2005-Lange #automaton #calculus #linear

Weak Automata for the Linear Time µ-Calculus (ML), pp. 267–281.

DAC-2004-AntonelliCDHKKMN #automaton #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 #automaton #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 #automaton #design #quantum #testing

Testing of Quantum Dot Cellular Automata Based Designs (MBT, FL), pp. 1408–1409.

PODS-2004-Schwentick #automaton #xml

Trees, Automata and XML (TS), p. 222.

VLDB-2004-SuRM #algebra #optimisation #query #semantics #xml #xquery

Semantic Query Optimization in an Automata-Algebra Combined XQuery Engine over XML Streams (HS, EAR, MM), pp. 1293–1296.

ITiCSE-2004-ChesnevarGM #automaton #formal method #learning

Didactic strategies for promoting significant learning in formal languages and automata theory (CIC, MPG, AGM), pp. 7–11.

ITiCSE-2004-HamadaS #automaton #education #empirical

A classroom experiment for teaching automata (MH, KS), p. 261.

ESOP-2004-CarlssonB #algorithm #automaton #constraints #finite

From Constraints to Finite Automata to Filtering Algorithms (MC, NB), pp. 94–108.

FoSSaCS-2004-Kirsten #automaton #distance #problem

Distance Desert Automata and the Star Height One Problem (DK), pp. 257–272.

TACAS-2004-BardinFL #automaton #performance

FASTer Acceleration of Counter Automata in Practice (SB, AF, JL), pp. 576–590.

TACAS-2004-BehrmannBLP #abstraction #automaton #bound

Lower and Upper Bounds in Zone Based Abstractions of Timed Automata (GB, PB, KGL, RP), pp. 312–326.

TACAS-2004-KrcalY #analysis #automaton #decidability #problem #scheduling #using

Decidable and Undecidable Problems in Schedulability Analysis Using Timed Automata (PK, WY), pp. 236–250.

TACAS-2004-LugiezNZ #approach #automaton #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 #automaton #scheduling #using

Resource-Optimal Scheduling Using Priced Timed Automata (JIR, KGL, KS), pp. 220–235.

FLOPS-2004-HagiyaTYS #abstraction #analysis #automaton #logic #using

Analysis of Synchronous and Asynchronous Cellular Automata Using Abstraction by Temporal Logic (MH, KT, MY, TS), pp. 7–21.

CIAA-2004-Couvreur #automaton #implementation

A BDD-Like Implementation of an Automata Package (JMC), pp. 310–311.

CIAA-2004-Egri-NagyN #algebra #automaton #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 #automaton #finite #regular expression

FIRE Station: An Environment for Manipulating Finite Automata and Regular Expression Views (MF, LGC, BWW), pp. 125–133.

CIAA-2004-FrishertW #automaton #regular expression

Combining Regular Expressions with (Near-)Optimal Brzozowski Automata (MF, BWW), pp. 319–320.

CIAA-2004-GeserHWZ #automaton #finite #string #termination

Finding Finite Automata That Certify Termination of String Rewriting (AG, DH, JW, HZ), pp. 134–145.

CIAA-2004-GiraudL #automaton #encoding #finite #linear

Linear Encoding Scheme for Weighted Finite Automata (MG, DL), pp. 146–155.

CIAA-2004-HanMZ #approach #automaton #database #sequence

An Automata Approach to Match Gapped Sequence Tags Against Protein Database (YH, BM, KZ), pp. 167–177.

CIAA-2004-HanW #automaton

The Generalization of Generalized Automata: Expression Automata (YSH, DW), pp. 156–166.

CIAA-2004-Ibarra #infinity

Automata-Theoretic Techniques for Analyzing Infinite-State Systems (OHI), p. 1.

CIAA-2004-Lugiez #automaton #linear #logic #set

From Automata to Semilinear Sets: A Logical Solution for Sets L(C, P) (DL), pp. 321–322.

CIAA-2004-NishimuraY #automaton #finite #interactive #proving #quantum

An Application of Quantum Finite Automata to Interactive Proof Systems (HN, TY), pp. 225–236.

CIAA-2004-PolcarM #2d #automaton #online #pattern matching

Two-Dimensional Pattern Matching by Two-Dimensional Online Tessellation Automata (TP, BM), pp. 327–328.

CIAA-2004-TammNU #automaton #multi #reduction

Size Reduction of Multitape Automata (HT, MN, EU), pp. 329–330.

CIAA-2004-Tischler #automaton #finite #parametricity

Parametric Weighted Finite Automata for Figure Drawing (GT), pp. 259–268.

CIAA-2004-XieLD #automaton #testing

Testability of Oracle Automata (GX, CL, ZD), pp. 331–332.

CIAA-2004-ZakharovZ #automaton #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 #automaton #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 #automaton #communication #effectiveness #theorem

A Kleene Theorem for a Class of Communicating Automata with Effective Algorithms (BG, AM, DK), pp. 30–48.

DLT-2004-JurdzinskiOMP #automaton #complexity #on the

On the Complexity of 2-Monotone Restarting Automata (TJ, FO, FM, MP), pp. 237–248.

DLT-2004-JurdzinskiOMP04a #automaton #on the

On Left-Monotone Deterministic Restarting Automata (TJ, FO, FM, MP), pp. 249–260.

DLT-2004-KurganskyyP #2d #automaton #finite #on the #power of

On the Computation Power of Finite Automata in Two-dimensional Environments (OK, IP), pp. 261–271.

DLT-2004-KuskeW #automaton

The Role of the Complementarity Relation in Watson-Crick Automata and Sticker Systems (DK, PW), pp. 272–283.

DLT-2004-Maletti #automaton #transducer

Relating Tree Series Transducers and Weighted Tree Automata (AM), pp. 321–333.

DLT-2004-Potapov #automaton #matrix #multi #problem #reachability

From Post Systems to the Reachability Problems for Matrix Semigroups and Multicounter Automata (IP), pp. 345–356.

ICALP-2004-BojanczykC #automaton

Tree-Walking Automata Cannot Be Determinized (MB, TC), pp. 246–256.

IFM-2004-Willemse #algebra #automaton #hybrid #process

Embeddings of Hybrid Automata in Process Algebra (TACW), pp. 343–362.

SEFM-2004-BertoliniFFO #analysis #automaton #generative #network #probability #testing #using

Test Case Generation Using Stochastic Automata Networks: Quantitative Analysis (CB, AGF, PF, FMO), pp. 251–260.

SFM-2004-AlurM #automaton #bibliography #problem

Decision Problems for Timed Automata: A Survey (RA, PM), pp. 1–24.

SAC-2004-MichaelsonHS #automaton #bound #named #programming #using

FSM-Hume: programming resource-limited systems using bounded automata (GM, KH, JS), pp. 1455–1461.

LDTA-2004-Tavernier #automaton #named #tool support #user interface #visual notation

Calife: A Generic Graphical User Interface for Automata Tools (BT), pp. 169–172.

CC-2004-ParkerC #algorithm

An Automata-Theoretic Algorithm for Counting Solutions to Presburger Formulas (EP, SC), pp. 104–119.

CAV-2004-BartzisB #automaton

Widening Arithmetic Automata (CB, TB), pp. 321–333.

CAV-2004-BrabermanGO #automaton #named #slicing

ObsSlice: A Timed Automata Slicer Based on Observers (VAB, DG, AO), pp. 470–474.

FATES-2004-BlomHJP #automaton #generative #specification #testing #using

Specifying and Generating Test Cases Using Observer Automata (JB, AH, BJ, PP), pp. 125–139.

FATES-2004-XieD #approach #component #model checking

An Automata-Theoretic Approach for Model-Checking Systems with Unspecified Components (GX, ZD), pp. 155–169.

LICS-2004-EsparzaKM #automaton #model checking #probability

Model Checking Probabilistic Pushdown Automata (JE, AK, RM), pp. 12–21.

LICS-2004-GrooteGS #automaton

Vector Addition Tree Automata (PdG, BG, SS), pp. 64–73.

LICS-2004-Klaedtke #automaton #on the

On the Automata Size for Presburger Arithmetic (FK), pp. 110–119.

LICS-2004-Latour #automaton #integer

From Automata to Formulas: Convex Integer Polyhedra (LL), pp. 120–129.

LICS-2004-OuaknineW #automaton #decidability #on the #problem

On the Language Inclusion Problem for Timed Automata: Closing a Decidability Gap (JO, JW), pp. 54–63.

RTA-2004-CarmeNT #automaton #query

Querying Unranked Trees with Stepwise Tree Automata (JC, JN, MT), pp. 105–118.

ASE-2003-Ellman #animation #automaton #hybrid #specification #synthesis

Specification and Synthesis of Hybrid Automata for Physics-Based Animation (TE), pp. 80–93.

DAC-2003-Al-YamaniM #automaton #encoding

Seed encoding with LFSRs and cellular automata (AAAY, EJM), pp. 560–565.

DAC-2003-Bernstein #automaton

Quantum-dot cellular automata: computing by field polarization (GHB), pp. 268–273.

VLDB-2003-Koch #approach #performance #query #xml

Efficient Processing of Expressive Node-Selecting Queries on XML Data in Secondary Storage: A Tree Automata-based Approach (CK), pp. 249–260.

FoSSaCS-2003-Lugiez #automaton #constraints #multi #similarity

Counting and Equality Constraints for Multitree Automata (DL), pp. 328–342.

TACAS-2003-BehrmannBFL #analysis #automaton #verification

Static Guard Analysis in Timed Automata Verification (GB, PB, EF, KGL), pp. 254–277.

TACAS-2003-DembinskiJJPPSWZ #automaton #named #specification #verification

Verics: A Tool for Verifying Timed Automata and Estelle Specifications (PD, AJ, PJ, WP, AP, MS, BW, AZ), pp. 278–283.

CIAA-2003-ChamparnaudLOZ #automaton #finite

From Regular Weighted Expressions to Finite Automata (JMC, ÉL, FO, DZ), pp. 49–60.

CIAA-2003-DaleyEM #automaton #probability #retrieval

Bag Automata and Stochastic Retrieval of Biomolecules in Solution (MD, MGE, IM), pp. 239–250.

CIAA-2003-FrishertCW #automaton #regular expression

The Effect of Rewriting Regular Expressions on Their Accepting Automata (MF, LGC, BWW), pp. 304–305.

CIAA-2003-Fritz #automaton #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-Henzinger #automaton #component #interface #specification

Automata for Specifying Component Interfaces (TAH), pp. 1–2.

CIAA-2003-Karhumaki #automaton #word

Automata on Words (JK), pp. 3–10.

CIAA-2003-KuskeM #automaton #branch #parallel

Branching Automata with Costs — A Way of Reflecting Parallelism in Costs (DK, IM), pp. 150–162.

CIAA-2003-MelicharP #approach #automaton #finite #problem #sequence

The Longest Common Subsequence Problem A Finite Automata Approach (BM, TP), pp. 294–296.

CIAA-2003-NgassamWK #automaton #finite

Preliminary Experiments in Hardcoding Finite Automata (EKN, BWW, DGK), pp. 299–300.

CIAA-2003-PrestonK #automaton #named #visualisation

AVA: An Applet for Visualizing FRACTRAN and Other Automata (NP, MSK), pp. 297–298.

CIAA-2003-TammU #automaton #regular expression

Bideterministic Automata and Minimal Representations of Regular Languages (HT, EU), pp. 61–71.

DLT-2003-AnanichevV #automaton

Synchronizing Monotonic Automata (DSA, MVV), pp. 111–121.

DLT-2003-BertoniMP #automaton #quantum

Quantum Computing: 1-Way Quantum Automata (AB, CM, BP), pp. 1–20.

DLT-2003-CarmeGLTT #automaton #finite

Residual Finite Tree Automata (JC, RG, AL, AT, MT), pp. 171–182.

DLT-2003-Csuhaj-VarjuMV #automaton #distributed

Distributed Pushdown Automata Systems: Computational Power (ECV, VM, GV), pp. 218–229.

DLT-2003-Domaratzki #automaton #on the

On Enumeration of Müller Automata (MD), pp. 254–265.

DLT-2003-Esparza #approach #verification

An Automata-Theoretic Approach to Software Verification (JE), p. 21.

DLT-2003-FreundMOP #on the

On Three Classes of Automata-Like P Systems (RF, CMV, AO, GP), pp. 292–303.

DLT-2003-Gecseg #automaton #set

Comments on Complete Sets of Tree Automata (FG), pp. 22–34.

DLT-2003-HolzerK #automaton #finite #monad #on the

On Deterministic Finite Automata and Syntactic Monoid Size, Continued (MH, BK), pp. 349–360.

DLT-2003-HolzerK03a #automaton #nondeterminism

Flip-Pushdown Automata: Nondeterminism Is Better than Determinism (MH, MK), pp. 361–372.

DLT-2003-Malcher #automaton #finite

Minimizing Finite Automata Is Computationally Hard (AM), pp. 386–397.

DLT-2003-Otto #automaton

Restarting Automata and Their Relations to the Chomsky Hierarchy (FO), pp. 55–74.

ICALP-2003-Cachat #automaton #game studies #graph #higher-order

Higher Order Pushdown Automata, the Caucal Hierarchy of Graphs and Parity Games (TC), pp. 556–569.

ICALP-2003-DenisE #automaton #probability

Residual Languages and Probabilistic Automata (FD, YE), pp. 452–463.

ICALP-2003-HolzerK #automaton

Flip-Pushdown Automata: k+1 Pushdown Reversals Are Better than k (MH, MK), pp. 490–501.

ICALP-2003-HromkovicS #automaton #comparison #multi

Pushdown Automata and Multicounter Machines, a Comparison of Computation Modes (JH, GS), pp. 66–80.

ICALP-2003-HromkovicS03a #automaton #finite #nondeterminism

Nondeterminism versus Determinism for Two-Way Finite Automata: Generalizations of Sipser’s Separation (JH, GS), pp. 439–451.

ICALP-2003-StoelingaV #automaton #probability #testing

A Testing Scenario for Probabilistic Automata (MS, FWV), pp. 464–477.

ICALP-2003-Vardi #automaton #logic

Logic and Automata: A Match Made in Heaven (MYV), pp. 64–65.

FME-2003-BeekK #automaton #composition

Team Automata Satisfying Compositionality (MHtB, JK), pp. 381–400.

SEFM-2003-LanotteMT #automaton #bisimulation #probability #security

Weak Bisimulation for Probabilistic Timed Automata and Applications to Security (RL, AMS, AT), pp. 34–43.

ICEIS-v1-2003-BouchouALD #automaton #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 #automaton #xml #xpath

Light-weight xPath processing of XML stream with deterministic automata (MO), pp. 342–349.

LOPSTR-2003-Ellman #animation #automaton #hybrid #specification #synthesis

Specification and Synthesis of Hybrid Automata for Physics-Based Animation (TE), pp. 54–55.

CADE-2003-HladikS #automaton #logic

A Translation of Looping Alternating Automata into Description Logics (JH, US), pp. 90–105.

CAV-2003-BoigelotHJ #automaton #hybrid #using

Hybrid Acceleration Using Real Vector Automata (Extended Abstract) (BB, FH, SJ), pp. 193–205.

CAV-2003-HungarNS #automaton #learning #optimisation

Domain-Specific Optimization in Automata Learning (HH, ON, BS), pp. 315–327.

CAV-2003-SeshiaB #automaton #bound #model checking #using

Unbounded, Fully Symbolic Model Checking of Timed Automata using Boolean Methods (SAS, REB), pp. 154–166.

CSL-2003-LeissR #automaton #string

Automata on Lempel-ziv Compressed Strings (HL, MdR), pp. 384–396.

LICS-2003-OuaknineW #automaton #decidability #robust

Revisiting Digitization, Robustness, and Decidability for Timed Automata (JO, JW), pp. 198–207.

RTA-2003-Dal-ZilioL #automaton #logic #xml

XML Schema, Tree Logic and Sheaves Automata (SDZ, DL), pp. 246–263.

RTA-2003-Verma #automaton #decidability #equation

Two-Way Equational Tree Automata for AC-Like Theories: Decidability and Closure Properties (KNV), pp. 180–196.

TestCom-2003-En-NouaaryD #automaton #testing

A Guided Method for Testing Timed Input Output Automata (AEN, RD), pp. 211–225.

TestCom-2003-HallalBUP #approach #testing

An Automata-Based Approach to Property Testing in Event Traces (HH, SB, AU, AP), pp. 180–196.

VMCAI-2003-Wang #automaton #performance #verification

Efficient Verification of Timed Automata with BDD-Like Data-Structures (FW), pp. 189–205.

PODS-2002-SpielmannTB #automaton #distributed #query #using #web

Distributed Computation of Web Queries Using Automata (MS, JT, JVdB), pp. 97–108.

FoSSaCS-2002-JancarKMS #automaton #bound #proving

Equivalence-Checking with One-Counter Automata: A Generic Method for Proving Lower Bounds (PJ, AK, FM, ZS), pp. 172–186.

TACAS-2002-AbdeddaimM #automaton #scheduling #using

Preemptive Job-Shop Scheduling Using Stopwatch Automata (YA, OM), pp. 113–126.

TACAS-2002-FersmanPY #automaton #decidability #process #scheduling

Timed Automata with Asynchronous Processes: Schedulability and Decidability (EF, PP, WY), pp. 67–82.

CIAA-J-2000-Bruggemann-KleinW02 #automaton #nondeterminism

The Regularity of Two-Way Nondeterministic Tree Automata Languages (ABK, DW), pp. 67–81.

CIAA-J-2000-CampeanuPY02 #algorithm #automaton #finite #performance

An Efficient Algorithm for Constructing Minimal Cover Automata for Finite Languages (CC, AP, SY), pp. 83–97.

CIAA-J-2000-Champarnaud02 #automaton #evaluation #nondeterminism #regular expression

Evaluation of Three Implicit Structures to Implement Nondeterministic Automata From Regular Expressions (JMC), pp. 99–113.

CIAA-2002-AlonsoDF #automaton #bidirectional

Tabulation of Bidirectional Push Down Automata (MAA, VJD, MVF), pp. 35–46.

CIAA-2002-AnselmoGV #automaton #finite #self

Finite Automata and Non-self-Embedding Grammars (MA, DG, SV), pp. 47–56.

CIAA-2002-BartzisB #automation #constraints #verification

Automata-Based Representations for Arithmetic Constraints in Automated Verification (CB, TB), pp. 282–288.

CIAA-2002-CampeanuP #automaton #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 #automaton #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 #automaton #implementation

Implementation of Dictionaries via Automata and Decision Trees (AF), pp. 95–105.

CIAA-2002-HolzerK #automaton #complexity #finite #nondeterminism

State Complexity of Basic Operations on Nondeterministic Finite Automata (MH, MK), pp. 148–157.

CIAA-2002-Korner #automaton #finite #on the

On Minimizing Cover Automata for Finite Languages in O(n log n) Time (HK), pp. 117–127.

CIAA-2002-Mohri #automaton

Edit-Distance of Weighted Automata (MM), pp. 1–23.

CIAA-2002-NetoB #adaptation #automaton

Adaptive Automata — A Revisited Proposal (JJN, CB), pp. 158–168.

CIAA-2002-Sutner #automaton

Reduced Power Automata (KS), pp. 194–202.

CIAA-2002-Sutner02a #automaton #hybrid

automata, a Hybrid System for Computational Automata Theory (KS), pp. 221–227.

DLT-2002-AnanichevCV #algorithm #automaton #word

An Inverse Automata Algorithm for Recognizing 2-Collapsing Words (DSA, AC, MVV), pp. 270–282.

DLT-2002-Archangelsky #algorithm #equivalence #finite #multi #performance

Efficient Algorithm for Checking Multiplicity Equivalence for the Finite Z-Σ*-Automata (KA), pp. 283–289.

DLT-2002-BruyereC #automaton #linear #order

Automata on Linear Orderings (VB, OC), pp. 103–115.

DLT-2002-Domaratzki #automaton #bound #finite

Improved Bounds on the Number of Automata Accepting Finite Languages (MD), pp. 209–219.

DLT-2002-HolzerK02a #automaton #finite #monad #on the

On Deterministic Finite Automata and Syntactic Monoid Size (MH, BK), pp. 258–269.

DLT-2002-Hoogeboom #automaton

Carriers and Counters: P Systems with Carriers vs. (Blind) Counter Automata (HJH), pp. 140–151.

DLT-2002-IbarraDS #automaton #finite #safety #verification

Safety Verification for Two-Way Finite Automata with Monotonic Counters (OHI, ZD, ZWS), pp. 326–338.

DLT-2002-Imreh #automaton

Some Remarks on Asynchronous Automata (BI), pp. 290–296.

DLT-2002-PetkovicCB #automaton

Characteristic Semigroups of Directable Automata (TP, MC, SB), pp. 417–427.

DLT-2002-Seibert #automaton #finite #performance #regular expression

Efficient Transformations from Regular Expressions to Finite Automata (SS), pp. 28–42.

DLT-2002-Svozil #automaton #concept #finite #modelling

Finite Automata Models of Quantized Systems: Conceptual Status and Outlook (KS), pp. 93–102.

ICALP-2002-Bojanczyk #automaton #finite #modelling

Two-Way Alternating Automata and Finite Models (MB), pp. 833–844.

ICALP-2002-Lombardy #automaton #on the

On the Construction of Reversible Automata for Reversible Languages (SL), pp. 170–182.

ICALP-2002-Ollinger #automaton

The Quest for Small Universal Cellular Automata (NO), pp. 318–329.

ICALP-2002-PapazianR #automaton #graph #recognition

Hyperbolic Recognition by Graph Automata (CP, ER), pp. 330–342.

ICEIS-2002-DascaluGF #automaton #modelling #using

Using Cellular Automata in Traffic Modeling (MD, SG, EF), pp. 467–472.

CIKM-2002-SistlaHC #automaton #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 #automaton #modelling #network #probability #representation

Representing software usage models with stochastic automata networks (AGF, PF, FMO), pp. 401–407.

PADL-2002-GallagherP #abstract interpretation #analysis #automaton #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 #automaton #development #distributed #model checking

An architecture-centric approach to the development of a distributed model-checker for timed automata (FS, VAB, AO), p. 710.

CSL-2002-Neven #automaton #logic #xml

Automata, Logic, and XML (FN), pp. 2–26.

ICLP-2002-BoigelotW #automaton #bibliography #constraints #finite #perspective #representation

Representing Arithmetic Constraints with Finite Automata: An Overview (BB, PW), pp. 1–19.

LICS-2002-BenediktL #algebra #automaton #logic #query

Tree Extension Algebras: Logics, Automata, and Query Languages (MB, LL), p. 203–?.

LICS-2002-Dima #automaton #reachability

Computing Reachability Relations in Timed Automata (CD), p. 177–?.

VMCAI-2002-FaellaTM #game studies

Automata-Theoretic Decision of Timed Games (MF, SLT, AM), pp. 94–108.

VMCAI-2002-TorreMN #automaton

Weak Muller Acceptance Conditions for Tree Automata (SLT, AM, MN), pp. 240–254.

ASE-2001-GiannakopoulouH #source code #verification

Automata-Based Verification of Temporal Properties on Running Programs (DG, KH), pp. 412–416.

DATE-2001-RufHKR #multi

Simulation-guided property checking based on a multi-valued AR-automata (JR, DWH, TK, WR), pp. 742–748.

FoSSaCS-2001-Bojanczyk #automaton #finite #graph #problem

The Finite Graph Problem for Two-Way Alternating Automata (MB), pp. 88–103.

FoSSaCS-2001-KingKV #automaton #complexity #on the #word

On the Complexity of Parity Word Automata (VK, OK, MYV), pp. 276–286.

TACAS-2001-CimattiRB #automaton #model checking #set

Searching Powerset Automata by Combining Explicit-State and Symbolic Model Checking (AC, MR, PB), pp. 313–327.

TACAS-2001-HuneRSV #automaton #linear #model checking #parametricity

Linear Parametric Model Checking of Timed Automata (TH, JR, MS, FWV), pp. 189–203.

TACAS-2001-KloseW #automaton #sequence chart

An Automata Based Interpretation of Live Sequence Charts (JK, HW), pp. 512–527.

TACAS-2001-NielsenS #automation #automaton #generative #testing

Automated Test Generation from Timed Automata (BN, AS), pp. 343–357.

SAS-2001-BouajjaniCLS #automaton #parametricity

Analyzing Fair Parametric Extended Automata (AB, ACA, YL, MS), pp. 335–355.

STOC-2001-Trakhtenbrot #automaton

Automata, circuits and hybrids: facets of continuous time (BAT), pp. 754–755.

STOC-2001-Vatan #automaton #probability

Distribution functions of probabilistic automata (FV), pp. 684–693.

CIAA-2001-DaciukN #automaton #finite #modelling #representation

Finite Automata for Compact Representation of Language Models in NLP (JD, GvN), pp. 65–73.

CIAA-2001-DangBIK #automaton

Past Pushdown Timed Automata (ZD, TB, OHI, RAK), pp. 74–86.

CIAA-2001-DubernardG #automaton #finite #generative #scheduling

Scheduling Hard Sporadic Tasks by Means of Finite Automata and Generating Functions (JPD, DG), pp. 87–100.

CIAA-2001-GranaBA #automaton #compilation #finite #scalability

Compilation Methods of Minimal Acyclic Finite-State Automata for Large Dictionaries (JG, FMB, MAA), pp. 135–148.

CIAA-2001-KatritzkeMT #automaton #clustering #finite #image #using

Enhancements of Partitioning Techniques for Image Compression Using Weighted Finite Automata (FK, WM, MT), pp. 177–189.

CIAA-2001-MelicharS #automaton #finite #on the

On the Size of Deterministic Finite Automata (BM, JS), pp. 202–213.

CIAA-2001-MoreySMW #automaton

Crystal Lattice Automata (JM, KS, REM, MWW), pp. 214–220.

CIAA-2001-NedjahM #adaptation #automaton #pattern matching #performance #term rewriting

Minimal Adaptive Pattern-Matching Automata for Efficient Term Rewriting (NN, LdMM), pp. 221–233.

CIAA-2001-Velinov #automaton #design #modelling #on the

On the Software Design of Cellular Automata Simulators for Ecological Modeling (YV), pp. 261–262.

CIAA-2001-Zijl01a #automaton #finite

Supernondeterministic Finite Automata (LvZ), pp. 274–288.

DLT-2001-CaludeC #automaton #named #nondeterminism #quantum

Automata: From Uncertainty to Quantum (CC, EC), pp. 1–14.

DLT-2001-CulikKK #automaton #problem

A Note on Synchronized Automata and Road Coloring Problem (KCI, JK, JK), pp. 175–185.

DLT-2001-EsikN #automaton

Automata on Series-Parallel Biposets (ZÉ, ZLN), pp. 217–227.

DLT-2001-HromkovicS #automaton #on the #power of #random

On the Power of Randomized Pushdown Automata (JH, GS), pp. 262–271.

DLT-2001-SchwentickTV #automaton

Partially-Ordered Two-Way Automata: A New Characterization of DA (TS, DT, HV), pp. 239–250.

DLT-2001-Thomas #automaton #infinity

A Short Introduction to Infinite Automata (WT), pp. 130–144.

ICALP-2001-ComonCM #automaton #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 #automaton #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-Trakhtenbrot #automaton

Automata, Circuits, and Hybrids: Facets of Continuous Time (BAT), pp. 4–23.

FME-2001-Beyer #analysis #automaton #reachability

Improvements in BDD-Based Reachability Analysis of Timed Automata (DB0), pp. 318–343.

POPL-2001-BhargavanCMG #automaton #monitoring #network #what

What packets may come: automata for network monitoring (KB, SC, PJM, CAG), pp. 206–219.

ESEC-FSE-2001-AlfaroH #automaton #interface

Interface automata (LdA, TAH), pp. 109–120.

CAV-2001-AbdeddaimM #automaton #scheduling #using

Job-Shop Scheduling Using Timed Automata (YA, OM), pp. 478–492.

CAV-2001-BhatCG #automaton #model checking #performance

Efficient Model Checking Via Büchi Tableau Automata (GB, RC, AG), pp. 38–52.

CAV-2001-Dang #analysis #automaton #reachability

Binary Reachability Analysis of Pushdown Timed Automata with Dense Clocks (ZD), pp. 506–518.

CAV-2001-GastinO #automaton #ltl #performance

Fast LTL to Büchi Automata Translation (PG, DO), pp. 53–65.

CAV-2001-LarsenBBFHPR #automaton #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 #automaton #effectiveness

An Effective Extension of the Wagner Hierarchy to Blind Counter Automata (OF), pp. 369–383.

CSL-2001-Ohsaki #automaton #commutative #equation

Beyond Regularity: Equational Tree Automata for Associative and Commutative Theories (HO), pp. 539–553.

IJCAR-2001-BaaderT #approach #automaton #satisfiability

The Inverse Method Implements the Automata Approach for Modal Satisfiability (FB, ST), pp. 92–106.

IJCAR-2001-BoigelotJW #automaton #integer #linear #on the

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 #automaton #dependence #graph #using

Approximating Dependency Graphs Using Tree Automata Techniques (AM), pp. 593–610.

RTA-2001-Lohrey #automaton #complexity #on the #parallel

On the Parallel Complexity of Tree Automata (ML), pp. 201–215.

FASE-2000-HuneS #automaton #case study #synthesis #using

A Case Study on Using Automata in Control Synthesis (TH, AS), pp. 349–362.

FoSSaCS-2000-LinY #automaton #proving

A Proof System for Timed Automata (HL, WY), pp. 208–222.

FoSSaCS-2000-Treinen #automaton #logic #testing

Predicate Logic and Tree Automata with Tests (RT), pp. 329–343.

TACAS-2000-WolperB #automaton #constraints #linear #on the

On the Construction of Automata from Linear Arithmetic Constraints (PW, BB), pp. 1–19.

CIAA-2000-BergeronH #automaton #implementation #performance

Fast Implementations of Automata Computations (AB, SH), pp. 47–56.

CIAA-2000-Bruggemann-KleinW #automaton #nondeterminism

Regularly Extended Two-Way Nondeterministic Tree Automata (ABK, DW), pp. 57–66.

CIAA-2000-Daciuk #automaton

Experiments with Automata Compression (JD), pp. 105–112.

CIAA-2000-DiehlKW #algorithm #automaton #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 #automaton

Automata for Pro-V Topologies (PCH), pp. 135–144.

CIAA-2000-Mohri #algorithm #automaton

Generic epsilon -Removal Algorithm for Weighted Automata (MM), pp. 230–242.

CIAA-2000-Neto #adaptation #automaton #problem

Solving Complex Problems Efficiently with Adaptive Automata (JJN), pp. 340–342.

CIAA-2000-PaunSY #algorithm #automaton #finite

An O(n2) Algorithm for Constructing Minimal Cover Automata for Finite Languages (AP, NS, SY), pp. 243–251.

CIAA-2000-ShankarSAR #automaton #finite #implementation

A Package for the Implementation of Block Codes as Finite Automata (PS, KS, VA, BSR), pp. 279–292.

CIAA-2000-Wareham #automaton #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 #automaton #finite #metric #nondeterminism

Measures of Nondeterminism in Finite Automata (JH, JK, HK, GS, SS), pp. 199–210.

ICALP-2000-Moszkowski #logic #proving

An Automata-Theoretic Completeness Proof for Interval Temporal Logic (BCM), pp. 223–234.

ICALP-2000-NevenS #automaton #on the #power of

On the Power of Tree-Walking Automata (FN, TS), pp. 547–560.

WLC-2000-DemenyHNN #automaton #visualisation

Visualization of Cellular Automata (MD, GH, CN, ZN), pp. 162–170.

WLC-2000-GruskaV #automaton #finite #quantum

Quantum Finite Automata (JG, RV), pp. 192–211.

WLC-2000-ImrehIP #automaton #commutative #on the

On Commutative Asynchronous Automata (BI, MI, AP), pp. 212–221.

WLC-2000-NiemannO #automaton

Further Results on Restarting Automata (GN, FO), pp. 352–369.

WLC-2000-Nishio #automaton #finite

Cellular Automata with Polynomials over Finite Fields (HN), pp. 370–377.

WLC-2000-PopovicBPC #automaton

Generalized Directable Automata (ZP, SB, TP, MC), pp. 378–395.

WLC-2000-Steinby #automaton #formal method #term rewriting

Tree Automata in the Theory of Term Rewriting (MS), pp. 434–449.

IFM-2000-BryansBBD #analysis #design #specification

Specification and Analysis of Automata-Based Designs (JB, LB, HB, JD), pp. 176–193.

ICML-2000-Veeser #approach #automaton #finite #learning

An Evolutionary Approach to Evidence-Based Learning of Deterministic Finite Automata (SV), pp. 1071–1078.

CC-2000-MaraninchiRR #implementation #named

MATOU: An Implementation of Mode-Automata (FM, YR, YR), pp. 249–263.

CAV-2000-AyariBK #automaton #induction

Decision Procedures for Inductive Boolean Functions Based on Alternating Automata (AA, DAB, FK), pp. 170–185.

CAV-2000-BouyerDFP #automaton #question

Are Timed Automata Updatable? (PB, CD, EF, AP), pp. 464–479.

CAV-2000-DangIBKS #analysis #automaton #reachability

Binary Reachability Analysis of Discrete Pushdown Timed Automata (ZD, OHI, TB, RAK, JS), pp. 69–84.

CAV-2000-KupfermanV #approach #infinity #reasoning

An Automata-Theoretic Approach to Reasoning about Infinite-State Systems (OK, MYV), pp. 36–52.

CAV-2000-SomenziB #automaton #ltl #performance

Efficient Büchi Automata from LTL Formulae (FS, RB), pp. 248–263.

CSL-2000-Vardi #automation #automaton #graph #logic #verification

Automated Verification = Graphs, Automata, and Logic (MYV), p. 139.

RTA-2000-Tison #automaton #term rewriting

Tree Automata and Term Rewrite Systems (ST), pp. 27–30.

PODS-1999-NevenS #automaton #query

Query Automata (FN, TS), pp. 205–214.

FoSSaCS-1999-BogaertST #automaton #problem

The Recognizability Problem for Tree Automata with Comparisons between Brothers (BB, FS, ST), pp. 150–164.

FoSSaCS-1999-EsparzaK #analysis #approach #data flow #interprocedural

An Automata-Theoretic Approach to Interprocedural Data-Flow Analysis (JE, JK), pp. 14–30.

SAS-1999-Monniaux #automaton #encryption #protocol

Abstracting Cryptographic Protocols with Tree Automata (DM), pp. 149–163.

STOC-1999-AmanoI #automaton #finite #quantum

Undecidability on Quantum Finite Automata (MA, KI), pp. 368–375.

STOC-1999-AmbainisNTV #automaton #bound #quantum

Dense Quantum Coding and a Lower Bound for 1-Way Quantum Automata (AA, AN, ATS, UVV), pp. 376–383.

DLT-1999-Bruggemann-KleinW #automaton #pattern matching

Caterpillars, context, tree automata and tree pattern matching (ABK, DW), pp. 270–285.

DLT-1999-BuchholzKK #automaton #on the

On tally languages and generalized interacting automata (TB, AK, MK), pp. 316–325.

DLT-1999-CaludeC #automaton #behaviour #bisimulation #nondeterminism

Bisimulations and behaviour of nondeterministic automata (CC, EC), pp. 60–70.

DLT-1999-JirickaK #automaton #finite #nondeterminism

Deterministic forgetting planar automata are more powerful than non-deterministic finite-state planar automata (PJ, JK), pp. 71–80.

DLT-1999-NiemannO #automaton

Restarting automata, Church-Rosser languages, and representations of r.e. languages (GN, FO), pp. 103–114.

DLT-1999-Platek

Weak cyclic forms of rw-automata (MP), pp. 115–124.

ICALP-1999-BouyerP #automaton #composition

Decomposition and Composition of Timed Automata (PB, AP), pp. 210–219.

ICALP-1999-DickhoferW #automaton #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 #automaton #finite #on the #power of

On the Power of Las Vegas II. Two-Way Finite Automata (JH, GS), pp. 433–442.

ICALP-1999-NichitiuR #automaton

Leader Election by d Dimensional Cellular Automata (CMN, ER), pp. 565–574.

ICALP-1999-PeichlV #automaton #finite

Finite Automata with Generalized Acceptance Criteria (TP, HV), pp. 605–614.

ICALP-1999-Rutten #automaton #induction

Automata, Power Series, and Coinduction: Taking Input Derivatives Seriously (JJMMR), pp. 645–654.

WIA-1999-AndaryCCDFL #automaton #named

SEA: A Symbolic Environment for Automata Theory (PA, PC, JMC, GD, MF, ÉL), pp. 13–26.

WIA-1999-BrauneDKW #animation #automaton #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 #automaton #encoding #finite #geometry

Finite Automata Encoding Geometric Figures (HJ, LS), pp. 101–108.

WIA-1999-SeuringG #automaton

A Structural Method for Output Compaction of Sequential Automata Implemented as Circuits (MS, MG), pp. 158–163.

WIA-1999-Trahtman #algorithm #automaton #finite #testing #verification

An Algorithm to Verify Local Threshold Testability of Deterministic Finite Automata (ANT), pp. 164–173.

WIA-1999-Watson #algorithm #automaton #finite #taxonomy

A Taxonomy of Algorithms for Constructing Minimal Acyclic Deterministic Finite Automata (BWW), pp. 174–182.

FM-v2-1999-PoizatCR #approach #automaton #concurrent #requirements

From Informal Requirements to COOP: A Concurrent Automata Approach (PP, CC, JCR), pp. 939–962.

HCI-CCAD-1999-FujishigeJK #automaton #finite #recognition #using #word

Recognition of Japanese sign language words using finite automata (EF, KJ, TK), pp. 167–171.

ICEIS-1999-FrantiDSS #automaton #data access #using

Using Intelligent Retina with Cellular Automata in Access Control (EF, MD, GS, MS), pp. 219–224.

SAC-1999-FenwickD #automaton #estimation #using

Electrical Substation Service-Area Estimation Using Cellular Automata: An Initial Report (JWF, LJD), pp. 560–565.

SAC-1999-VenkataramanaR #automaton #framework #learning

A Learning Automata Based Framework for Task Assignment in Heterogeneous Computing Systems (RDV, NR), pp. 541–547.

CAV-1999-Alur #automaton

Timed Automata (RA), pp. 8–22.

CAV-1999-DanieleGV #automaton #generative #linear #logic

Improved Automata Generation for Linear Temporal Logic (MD, FG, MYV), pp. 249–260.

CAV-1999-Etessami #automaton #invariant #logic

Stutter-Invariant Languages, ω-Automata, and Temporal Logic (KE), pp. 236–248.

CAV-1999-Klarlund #automaton #formal method #logic #strict

A Theory of Restrictions for Logics and Automata (NK), pp. 406–417.

ITiCSE-1998-RodgerG #automaton #theorem

JFLAP (poster): an aid to studying theorems in automata theory (SHR, EG), p. 302.

ESOP-1998-MaraninchiR #named

Mode-Automata: About Modes and States for Reactive Systems (FM, YR), pp. 185–199.

FASE-1998-Tapken #automaton #design #named #realtime

MOBY/PLC — A Design Tool for Hierarchical Real-Time Automata (JT), pp. 326–329.

FoSSaCS-1998-Beauquier #automaton

Pumping Lemmas for Timed Automata (DB), pp. 81–94.

TACAS-1998-AcetoBL #automaton #model checking #reachability #testing

Model Checking via Reachability Testing for Timed Automata (LA, AB, KGL), pp. 263–280.

TACAS-1998-Grahlmann #automaton #finite #parallel #petri net #source code #using

Combining Finite Automata, Parallel Programs and SDL Using Petri Nets (BG), pp. 102–117.

STOC-1998-KupfermanV #automaton

Weak Alternating Automata and Tree Automata Emptiness (OK, MYV), pp. 224–233.

ICALP-1998-BoigelotRW #automaton #integer #on the

On the Expressiveness of Real and Integer Arithmetic Automata (Extended Abstract) (BB, SR, PW), pp. 152–163.

ICALP-1998-BuchsbaumGW #automaton #finite #on the

On the Determinization of Weighted Finite Automata (ALB, RG, JW), pp. 482–493.

ICALP-1998-DamicoMM #automaton #on the

On Computing the Entropy of Cellular Automata (Md, GM, LM), pp. 470–481.

ICALP-1998-HengleinR #automaton #complexity #constraints #recursion #type system

Constraint Automata and the Complexity of Recursive Subtype Entailment (FH, JR), pp. 616–627.

ICALP-1998-Lugiez #automaton #induction #proving #theorem proving

A Good Class of Tree Automata and Application to Inductive Theorem Proving (DL), pp. 409–420.

ICALP-1998-Vardi #automaton #reasoning

Reasoning about The Past with Two-Way Automata (MYV), pp. 628–641.

WIA-1998-Augros #automaton #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 #automaton

Automata and Computational Probabilities (MCB, AB), pp. 164–177.

WIA-1998-CampeanuSY #finite

Minimal Cover-Automata for Finite Languages (CC, NS, SY), pp. 43–56.

WIA-1998-ChamparnaudZP #automaton

Determinization of Glushkov Automata (JMC, DZ, JLP), pp. 57–68.

WIA-1998-DuchampFL #automaton #multi

Operations over Automata with Multiplicities (GD, MF, ÉL), pp. 183–191.

WIA-1998-HolubM #approximate #automaton #finite #implementation #nondeterminism #pattern matching

Implementation of Nondeterministic Finite Automata for Approximate Pattern Matching (JH, BM), pp. 92–99.

WIA-1998-Karpischek #automaton

Paging Automata (RUK), pp. 192–198.

WIA-1998-LHerPM #automaton #proving #source code #using

Proving Sequential Function Chart Programs Using Automata (DL, PLP, LM), pp. 149–163.

WIA-1998-MaurelPR #automaton #predict

The Syntactic Prediction with Token Automata: Application to HandiAS System (DM, BLP, OR), pp. 100–109.

WIA-1998-MichonC #automaton #diagrams

Automata and Binary Decision Diagrams (JFM, JMC), pp. 178–182.

WIA-1998-Pedrazzini #automaton #design pattern #finite

The Finite State Automata’s Design Patterns (SP), pp. 213–219.

WIA-1998-Poibeau #automaton

Bi-directional Automata to Extract Complex Phrases from Texts (TP), pp. 110–120.

KR-1998-Kusters #automaton #finite #semantics #using

Characterizing the Semantics of Terminological Cycles in ALN Using Finite Automata (RK), pp. 499–511.

SAC-1998-BillardL #automaton #behaviour #distributed #learning #simulation

Simulation of period-doubling behavior in distributed learning automata (EB, SL), pp. 690–695.

CC-1998-BrouwerGP #analysis #automaton #finite #implementation #performance

Myths and Facts about the Efficient Implementation of Finite Automata and Lexical Analysis (KB, WG, EP), pp. 1–15.

CAV-1998-ComonJ #analysis #automaton #multi #safety

Multiple Counters Automata, Safety Analysis and Presburger Arithmetic (HC, YJ), pp. 268–279.

IWTCS-1998-Grunsky #automaton #testing

Testing of Automata: From Experiments to Representations by Means of Fragments (ISG), pp. 3–14.

IWTCS-1998-TanP #automaton #generative #specification #testing

Test Generation for Specifications Modeled by Input/Output Automata (QMT, AP), pp. 83–100.

LICS-1998-StarkS #analysis #automaton #composition #network #probability

Compositional Analysis of Expected Delays in Networks of Probabilistic I/O Automata (EWS, SAS), pp. 466–477.

LICS-1998-Thomas #automaton #logic #monad

Monadic Logic and Automata: Recent Developments (WT), pp. 136–138.

EDTC-1997-KagarisT #automaton #generative #sequence #testing

Cellular automata for generating deterministic test sequences (DK, ST), pp. 77–81.

EDTC-1997-UrsuGZ #automaton #design #logic #specification #using #verification

Design and verification of the sequential systems automata using temporal logic specifications (AU, GG, SZ), p. 623.

SAS-1997-TalbotTD #analysis #automaton #logic programming

Set-Based Analysis for Logic Programming and Tree Automata (JMT, ST, PD), pp. 127–140.

DLT-1997-CaludeCK #automaton #simulation

Deterministic Automata: Simulation, Universality and Minimality. Extended Abstract (CSC, EC, BK), pp. 519–537.

DLT-1997-GecsegI #automaton #on the #set

On complete sets of tree automata (FG, BI), pp. 37–47.

DLT-1997-JancarMPPV #automaton

Deleting Automata with a Restart Operation (PJ, FM, MP, MP, JV), pp. 191–202.

DLT-1997-Kuich #automaton #named

Semirings: A basis for a mathematical automata and language theory (WK), pp. 49–60.

DLT-1997-MrazPP #automaton

Deleting Automata with a Restart Operation and Marcus Grammars (FM, MP, MP), pp. 329–342.

DLT-1997-Neumann #ambiguity #automaton #modelling #revisited

Unambiguity of SGML Content Models — Pushdown Automata Revisited (AN), pp. 507–518.

DLT-1997-PazC #array #automaton #evolution #probability

Chaotic Evolution via Generalized Probabilistic Automata (Probabilistic Arrays) (AP, JWC), pp. 9–35.

ICALP-1997-HenzingerK97a #automaton #hybrid

Discrete-Time Control for Rectangular Hybrid Automata (TAH, PWK), pp. 582–593.

ICALP-1997-ManziniM #automaton #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 #automaton #decidability #equivalence #problem

The Equivalence Problem for Deterministic Pushdown Automata is Decidable (GS), pp. 671–681.

WIA-1997-BertaultK #automaton #using #visualisation

Visualization of Dynamic Automata Using Padnon (FB, GK), pp. 25–28.

WIA-1997-BrzozowskiN #automaton #behaviour

Automata of Asynchronous Behaviors (JAB, RN), pp. 29–45.

WIA-1997-GlennG #automaton #finite #implementation #performance

Implementing WS1S via Finite Automata: Performance Issues (JG, WIG), pp. 75–86.

WIA-1997-KirazE #automaton #implementation #multi #prolog #speech

Multi-tape Automata for Speech and Language Systems: A Prolog Implementation (GAK, EGE), pp. 87–103.

WIA-1997-LescowV #automaton #set

Minimal Separating Sets for Muller Automata (HL, JV), pp. 109–121.

WIA-1997-Maout #automaton #tool support

Tools to Implement Automata, a First Step: ASTL (VLM), pp. 104–108.

WIA-1997-Revuz #automaton

Operations on Extended Automata (DR), pp. 171–175.

WIA-1997-VogeUMB #automaton

The Automata Theory Package omega (JV, SU, OM, NB), pp. 228–231.

WIA-1997-Watson #automaton #optimisation

Practical Optimizations for Automata (BWW), pp. 232–240.

WIA-1997-Ziadi #automaton #clustering #problem #set #sorting

Sorting and Doubling Techniques for Set Partitioning and Automata Minimization Problems (DZ), pp. 241–251.

ALP-1997-NedjahWE #automaton #pattern matching

Optimal Left-to-Right Pattern-Matching Automata (NN, CDW, SEE), pp. 273–286.

CADE-1997-Vardi #automaton #logic

Alternating Automata: Unifying Truth and Validity Checking for Temporal Logics (MYV), pp. 191–206.

CAV-1997-BozgaMPY #automaton #verification

Some Progress in the Symbolic Verification of Timed Automata (MB, OM, AP, SY), pp. 179–190.

CAV-1997-Sistla #automaton #invariant #linear #network #using #verification

Parametrized Verification of Linear Networks Using Automata as Invariants (APS), pp. 412–423.

CSL-1997-ComonJ #automaton #higher-order

Higher-Order Matching and Tree Automata (HC, YJ), pp. 157–176.

LICS-1997-AsarinCM #automaton #theorem

A Kleene Theorem for Timed Automata (EA, PC, OM), pp. 160–171.

LICS-1997-BouhoulaJ #automation #induction

Automata-Driven Automated Induction (AB, JPJ), pp. 14–25.

LICS-1997-Janin #automaton #calculus #fixpoint #reduction #theorem

Automata, Tableaus and a Reduction Theorem for Fixpoint Calculi in Arbitrary Complete Lattices (DJ), pp. 172–182.

TACAS-1996-MoserM #automaton #probability #realtime

Probabilistic Duration Automata for Analyzing Real-Time Systems (LEM, PMMS), pp. 369–390.

SAS-1996-RouxR #automaton #decidability #hybrid

Uniformity for the Decidability of Hybrid Automata (OFR, VR), pp. 301–316.

ICALP-1996-Hashiguchi #automaton #bound #distance

New Upper Bounds to the Limitedness of Distance Automata (KH), pp. 324–335.

ICALP-1996-Kaivola #automaton #fixpoint

Fixpoints for Rabin Tree Automata Make Complementation Easy (RK), pp. 312–323.

WIA-1996-BiehlKR #algorithm #automaton

Algorithms for Guided Tree Automata (MB, NK, TR), pp. 6–25.

WIA-1996-BoneDGM #automaton #finite

Time Series Forecasting by Finite-State Automata (RB, CD, AG, DM), pp. 26–34.

WIA-1996-GarzonE #automaton #concurrent #implementation #nondeterminism

Dynamical Implementation of Nondeterministic Automata and Concurrent Systems (MHG, EE), pp. 35–49.

WIA-1996-GlennG #automaton #finite #implementation

Implementing WS1S via Finite Automata (JG, WIG), pp. 50–63.

WIA-1996-Maurel #automaton

Building Automata on Schemata and Acceptability Tables: Application to French Data Adverbials (DM), pp. 72–86.

WIA-1996-Noord #automaton #finite

FSA Utilities: A Toolbox to Manipulate Finite-State Automata (GvN), pp. 87–108.

ICPR-1996-Melichar #automaton #difference #finite #string

String matching with k differences by finite automata (BM), pp. 256–260.

LICS-1996-Henzinger #automaton #formal method #hybrid

The Theory of Hybrid Automata (TAH), pp. 278–292.

LICS-1996-KupfermanSV #automaton #word

Relating Word and Tree Automata (OK, SS, MYV), pp. 322–332.

TACAS-1995-MullerN #deduction #model checking

Combining Model Checking and Deduction for I/O-Automata (OM, TN), pp. 1–16.

PEPM-1995-Goubault #automaton #higher-order #interpreter

Schedulers as Abstract Interpreter of Higher Dimensional Automata (EG), pp. 134–145.

SAS-1995-WolperB #approach #constraints

An Automata-Theoretic Approach to Presburger Arithmetic Constraints (Extended Abstract) (PW, BB), pp. 21–32.

STOC-1995-HenzingerKPV #automaton #decidability #hybrid #question #what

What’s decidable about hybrid automata? (TAH, PWK, AP, PV), pp. 373–382.

DLT-1995-Cases #automaton #self

From Synonymy to Self-Modifying Automata: Q-Diam Language (BC), pp. 454–459.

DLT-1995-CattaneoFM #automaton

Rule Space Transformations and One-Dimensional Cellular Automata (GC, EF, GM), pp. 409–419.

DLT-1995-Holzer #automaton #finite #on the

On Emptiness and Counting for Alternating Finite Automata (MH), pp. 88–97.

DLT-1995-JancarMPPV #automaton #context-free grammar

Restarting Automata, Marcus Grammars and Context-Free Languages (PJ, FM, MP, MP, JV), pp. 102–111.

DLT-1995-KutribR #automaton #realtime

Real-Time One-Way Pushdown Cellular Automata Languages (MK, JR), pp. 420–429.

DLT-1995-Nederhof #automaton #bidirectional #parsing

Reversible Pushdown Automata and Bidirectional Parsing (MJN), pp. 472–481.

DLT-1995-SchieringT #automaton #first-order #logic

Counter-Free Automata, First-Order Logic and Star-Free Expressions (IS, WT), pp. 166–175.

ICALP-1995-BaoI #automaton #finite

Break Finite Automata Public Key Cryptosystem (FB, YI), pp. 147–158.

ICALP-1995-DurisG #automaton

Sensing Versus Nonsensing Automata (PD, ZG), pp. 455–463.

ICALP-1995-Henzinger95a #automaton #bisimulation #finite #hybrid

Hybrid Automata with Finite Bisimulatioins (TAH), pp. 324–335.

AdaEurope-1995-Bjornfot #ada #automaton

Ada and Timed Automata (LB), pp. 389–405.

CAV-1995-BouajjaniLR #automaton #calculus #hybrid #linear

From Duration Calculus To Linear Hybrid Automata (AB, YL, RR), pp. 196–210.

CAV-1995-EmersonS #approach #model checking #symmetry

Utilizing Symmetry when Model Checking under Fairness Assumptions: An Automata-theoretic Approach (EAE, APS), pp. 309–324.

CAV-1995-KrishnanPBV #automaton #game studies

The Rabin Index and Chain Automata, with Applications to Automatas and Games (SCK, AP, RKB, PV), pp. 253–266.

CAV-1995-Vardi #approach #synthesis

An Automata-Theoretic Approach to Fair Realizability and Synthesis (MYV), pp. 267–278.

LICS-1995-Comon #automaton #higher-order #logic #monad

Sequentiality, Second Order Monadic Logic and Tree Automata (HC), pp. 508–517.

LICS-1995-Trakhtenbrot #automaton #logic

Origins and Metamorphoses of the Trinity: Logic, Nets, Automata (BAT), pp. 506–507.

EDAC-1994-LiW #automaton #fault #logic #simulation

Logic and Fault Simulation by Cellular Automata (YLL, CWW), pp. 552–556.

EDAC-1994-YangMD #automaton #constraints #scheduling

Scheduling with Environmental Constraints based on Automata Representations (JCYY, GDM, MD), pp. 495–501.

STOC-1994-CondonHPW #automaton #finite #nondeterminism #on the #power of #probability

On the power of finite automata with both nondeterministic and probabilistic states (preliminary version) (AC, LH, SP, AW), pp. 676–685.

ICALP-1994-Cerans #automaton #relational

Deciding Properties of Integral Relational Automata (KC), pp. 35–46.

ICALP-1994-GlobermanH #automaton #complexity #logic #multi

Complexity Results for Multi-Pebble Automata and their Logics (NG, DH), pp. 73–82.

ICALP-1994-KlarlundMS #automaton

Determinizing Asynchronous Automata (NK, MM, MAS), pp. 130–141.

ICALP-1994-Muscholl #automaton #on the

On the Complementation of Büchi Asynchronous Cellular Automata (AM), pp. 142–153.

FME-1994-PaechR #automaton #behaviour #concept #modelling #refinement

A new Concept of Refinement used for Behaviour Modelling with Automata (BP, BR), pp. 154–174.

TAGT-1994-BrandenburgS #automaton #graph #linear

Graph Automata for Linear Graph Languages (FJB, KS), pp. 336–350.

CAV-1994-AlurFH #automaton

A Determinizable Class of Timed Automata (RA, LF, TAH), pp. 1–13.

CAV-1994-BernholtzVW #approach #model checking

An Automata-Theoretic Approach to Branching-Time Model Checking (Extended Abstract) (OB, MYV, PW), pp. 142–155.

CAV-1994-LamB #automaton

Criteria for the Simple Path Property in Timed Automata (WKCL, RKB), pp. 27–40.

CAV-1994-McManisV #automaton #decidability #hybrid

Suspension Automata: A Decidable Class of Hybrid Automata (JM, PV), pp. 105–117.

STOC-1993-FreundKRRSS #automaton #finite #learning #performance #random

Efficient learning of typical finite automata from random walks (YF, MJK, DR, RR, RES, LS), pp. 315–324.

ICALP-1993-BrachoD #automaton #concurrent

From Domains to Automata with Concurrency (FB, MD), pp. 669–681.

ICALP-1993-Gupta #automaton #finite #product line

Finite Automata as Characterizations of Minor Closed Tree Families (Extended Abstract) (AG), pp. 359–370.

CAV-1993-LamB #automaton

Alternating RQ Timed Automata (WKCL, RKB), pp. 237–252.

CAV-1993-ProbstL #automaton #behaviour #verification

Verifying Timed Behavior Automata with Input/Output Critical Races (DKP, HFL), pp. 424–437.

ILPS-1993-FribourgP #automaton #concurrent #constraints

Concurrent Constraint Automata (LF, MVP), p. 656.

RTA-1993-CaronCD #automaton #constraints

Encompassment Properties and Automata with Constraints (ACC, JLC, MD), pp. 328–342.

HT-ECHT-1992-StottsFR #automaton #verification

Hyperdocuments as Automata: Trace-Based Browsing Property Verification (PDS, RF, JCR), pp. 272–281.

STOC-1992-Safra #automaton #exponential

Exponential Determinization for ω-Automata with Strong-Fairness Acceptance Condition (Extended Abstract) (SS), pp. 275–282.

ICALP-1992-GastinP #automaton #infinity

Asynchronous Cellular Automata for Infinite Traces (PG, AP), pp. 583–594.

ICALP-1992-IbarraT #automaton #finite

New Results Concerning Synchronized Finite Automata (OHI, NQT), pp. 126–137.

PLILP-1992-BarthelemyC #automaton

Subsumption-oriented Push-Down Automata (FB, EVdlC), pp. 100–114.

CC-1992-Pettersson #automaton #compilation #finite

A Term Pattern-Match Compiler Inspired by Finite Automata Theory (MP), pp. 258–270.

CAV-1992-ProbstL #automaton #behaviour #constraints #verification

Verifying Timed Behavior Automata with Nonbinary Delay Constraints (DKP, HFL), pp. 123–136.

LICS-1992-Klarlund #automaton #metric #set

Progress Measures, Immediate Determinacy, and a Subset Construction for Tree Automata (NK), pp. 382–393.

ICALP-1991-KanepsF #automaton #probability #regular expression

Running Time to Recognize Nonregular Languages by 2-Way Probabilistic Automata (JK, RF), pp. 174–185.

ICALP-1991-Thomas #automaton #logic #on the

On Logics, Tilings, and Automata (WT), pp. 441–454.

ML-1991-MaclinS #automaton #finite

Refining Domain Theories Expressed as Finite-State Automata (RM, JWS), pp. 524–528.

CAV-1991-Jong #approach #automaton #logic

An Automata Theoretic Approach to Temporal Logic (GGdJ), pp. 477–487.

CSL-1991-BarguryM #automaton #multi #power of #transitive

The Expressive Power of Transitive Closue and 2-way Multihead Automata (YB, JAM), pp. 1–14.

CSL-1991-ThistleW #automaton #problem

Control of ω-Automata, Church’s Problem, and the Emptiness Problem for Tree ω-Automata (JGT, WMW), pp. 367–382.

LICS-1991-KlarlundK #automaton #metric

Rabin Measures and Their Applications to Fairness and Automata Theory (NK, DK), pp. 256–265.

LICS-1991-Vaandrager #algebra #automaton #on the #process

On the Relationship Between Process Algebra and Input/Output Automata (FWV), pp. 387–398.

RTA-1991-CoquideDGV #automaton #bottom-up #term rewriting

Bottom-Up Tree Pushdown Automata and Rewrite Systems (JLC, MD, RG, SV), pp. 287–298.

STOC-1990-HarjuK #automaton #decidability #equivalence #finite #multi

Decidability of the Multiplicity Equivalence of Multitape Finite Automata (TH, JK), pp. 477–481.

ICALP-1990-AlurD #automaton #modelling #realtime

Automata For Modeling Real-Time Systems (RA, DLD), pp. 322–335.

ICALP-1990-Anselmo #automaton #multi

Two-Way Automata with Multiplicity (MA), pp. 88–102.

ICALP-1990-Droste #automaton #concurrent

Concurrency, Automata and Domains (MD), pp. 195–208.

ICALP-1990-Kuich #algebra #automaton

ω-Continuous Semirings, Algebraic Systems and Pushdown Automata (WK), pp. 103–110.

GG-1990-Lautemann #automaton #composition

Tree Automata, Tree Decomposition and Hyperedge Replacement (CL), pp. 520–537.

POPL-1990-RameshRW #prolog

Automata-Driven Indexing of Prolog Clauses (RR, IVR, DSW), pp. 281–291.

POPL-1990-Stark #automaton #concurrent #on the

On the Relations Computable by a Class of Concurrent Automata (EWS), pp. 329–340.

CAV-1990-MadelaineV #algebra #automaton #process

Finiteness Conditions and Structural Construction of Automata for All Process Algebras (EM, DV), pp. 353–363.

CAV-1990-Yodaiken #algebra #automaton #feedback

The Algebraic Feedback Product of Automata (VY), pp. 263–271.

CSL-1990-ArnborgPS #automaton #higher-order #logic #monad

Monadic Second Order Logic, Tree Automata and Forbidden Minors (SA, AP, DS), pp. 1–16.

PODS-1989-Vardi #automaton #database

Automata Theory for Database Theoreticans (MYV), pp. 83–92.

STOC-1989-KearnsV #automaton #encryption #finite #learning

Cryptographic Limitations on Learning Boolean Formulae and Finite Automata (MJK, LGV), pp. 433–444.

STOC-1989-RivestS #automaton #finite #sequence #using

Inference of Finite Automata Using Homing Sequences (Extended Abstract) (RLR, RES), pp. 411–420.

STOC-1989-SafraV #automaton #logic #on the

On ω-Automata and Temporal Logic (Preliminary Report) (SS, MYV), pp. 127–137.

ICALP-1989-EngelfrietH #automaton #infinity #word

Automata with Storage on Infinite Words (JE, HJH), pp. 289–303.

ICALP-1989-McKenzieT #automaton #complexity

Automata Theory Meets Circuit Complexity (PM, DT), pp. 589–602.

KR-1989-Rosenschein #automaton

Synthesizing Information-Tracking Automata from Environment Descriptions (SJR), pp. 386–393.

LICS-1989-EmersonJ #automaton #on the

On Simultaneously Determinizing and Complementing ω-Automata (Extended Abstract) (EAE, CSJ), pp. 333–342.

ICALP-1988-CoriM #approximate #automaton #distributed

Approximation of a TRace, Asynchronous Automata and the Ordering of Events in a Distributed System (RC, YM), pp. 147–161.

ICALP-1988-Eppstein #automaton #design #finite #sequence

Reset Sequences for Finite Automata with Application to Design of Parts Orienters (DE), pp. 230–238.

ICALP-1988-Tao #automaton #finite #linear

Invertibility of Linear Finite Automata Over a Ring (RjT), pp. 489–501.

ALP-1988-FulopV #automaton #linear #set #term rewriting

A Characterization of Irreducible Sets Modulo Left-Linear Term Rewriting Systems by Tree Automata (ZF, SV), p. 157.

CSL-1988-Wagner #automaton #logic #on the #problem #source code

On the Emptiness Problem of Tree Automata and Completeness of Modal Logics of Programs (HW), pp. 384–399.

LICS-1988-MullerSS #automaton #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.

ICALP-1987-BarringtonT #automaton

Non-Uniform Automata Over Groups (DAMB, DT), pp. 163–173.

ICALP-1987-Metivier #algorithm #automaton #graph

An Algorithm for Computing Asynchronous Automata in the Case of Acyclic Non-Commutation Graphs (YM), pp. 226–236.

ICALP-1987-Pin #automaton #finite #on the

On the Language Accepted by Finite Reversible Automata (JÉP), pp. 237–249.

SIGIR-1987-OommenM #automaton #clustering #learning #performance #probability #using

Fast Object Partitioning Using Stochastic Learning Automata (BJO, DCYM), pp. 111–122.

POPL-1987-MannaP #concurrent #source code #specification #verification

Specification and Verification of Concurrent Programs By Forall-Automata (ZM, AP), pp. 1–12.

LICS-1987-Vardi #concurrent #framework #source code #verification

Verification of Concurrent Programs: The Automata-Theoretic Framework (MYV), pp. 167–176.

RTA-1987-Benois #algorithm #automaton #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.

ICALP-1986-GoralcikK #automaton #on the #word

On Discerning Words by Automata (PG, VK), pp. 116–122.

ICALP-1986-MullerSS #automaton #complexity #monad

Alternating Automata. The Weak Monadic Theory of the Tree, and its Complexity (DEM, AS, PES), pp. 275–283.

LICS-1986-BensonB #automaton #bisimulation

Strong Bisimulation of State Automata (DBB, OBS), pp. 77–81.

LICS-1986-PerrinS #automaton #decidability #equivalence #integer #monad

Automata on the Integers, Recurrence Distinguishability, and the Equivalence and Decidability of Monadic Theories (DP, PES), pp. 301–304.

LICS-1986-VardiW #approach #automation #verification

An Automata-Theoretic Approach to Automatic Program Verification (Preliminary Report) (MYV, PW), pp. 332–344.

ICALP-1985-Chrobak #automaton #multi

Hierarchies of One-Way Multihead Automata Languages (MC), pp. 101–110.

ICALP-1985-SistlaVW #automaton #logic #problem

The Complementation Problem for Büchi Automata with Applications to Temporal Logic (Extended Abstract) (APS, MYV, PW), pp. 465–474.

STOC-1984-VardiW #automaton #logic #source code

Automata Theoretic Techniques for Modal Logics of Programs (Extended Abstract) (MYV, PW), pp. 446–456.

STOC-1983-Engelfriet #automaton #complexity

Iterated Pushdown Automata and Complexity Classes (JE), pp. 365–373.

STOC-1983-Gacs #automaton #reliability

Reliable Computation with Cellular Automata (PG), pp. 32–41.

ICALP-1983-Kamimura #attribute grammar #automaton

Tree Automata and Attribute Grammars (TK), pp. 374–384.

STOC-1982-GurevichH #automaton #game studies

Trees, Automata, and Games (YG, LH), pp. 60–65.

ICALP-1982-DammG

An Automata-Theoretic Characterization of the OI-Hierarchy (WD, AG), pp. 141–153.

ICALP-1982-DurisG #automaton #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 #automaton #finite #multi

Multihead Finite State Automata and Concatenation (PD, JH), pp. 176–186.

STOC-1981-MullerS #automaton #graph #higher-order #logic #problem #reachability

Pushdown Automata, Graphs, Ends, Second-Order Logic, and Reachability Problems (DEM, PES), pp. 46–54.

ICALP-1981-King #automaton #finite #multi

Alternating Multihead Finite Automata (Extended Abstract) (KNK), pp. 506–520.

STOC-1980-Ukkonen #automaton #equivalence #realtime

A Decision Method for the Equivalence of some Non-Real-Time Deterministic Pushdown Automata (EU), pp. 29–38.

ICALP-1980-Berman #automaton

A Note on Sweeping Automata (PB), pp. 91–97.

STOC-1979-Sipser #automaton #bound

Lower Bounds on the Size of Sweeping Automata (MS), pp. 360–364.

ICALP-1979-Ury #automaton #composition #linear

Optimal Decomposition of Linear Automata (LÚ), pp. 659–667.

STOC-1978-SakodaS #automaton #finite #nondeterminism

Nondeterminism and the Size of Two Way Finite Automata (WJS, MS), pp. 275–286.

GG-1978-WuR #automaton #graph

Cellular Graph Automata (AYW, AR), pp. 464–475.

STOC-1977-Sudborough #automaton #bound

Separating Tape Bounded Auxiliary Pushdown Automata Classes (IHS), pp. 208–217.

ICALP-1977-BertoniMT #automaton #probability #problem #recursion

Some Recursive Unsolvable Problems Relating to Isolated Cutpoints in Probabilistic Automata (AB, GM, MT), pp. 87–94.

STOC-1976-Sudborough #automaton #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.

STOC-1974-Valiant #automaton #decidability #equivalence

The Decidability of Equivalence for Deterministic Finite-Turn Pushdown Automata (LGV), pp. 27–32.

ICALP-1974-Gecseg #automaton #composition

Composition of Automata (FG), pp. 351–363.

STOC-1972-Savitch #automaton

Maze Recognizing Automata (Extended Abstract) (WJS), pp. 151–156.

ICALP-1972-HenkeIW #automaton #recursion

Hierarchies of Primitive Recursive Wordfunctions and Transductions Defined by Automata (FWvH, KI, KW), pp. 549–561.

ICALP-1972-HsiaY #automaton #finite

Finite Automata with Markers (PH, RTY), pp. 443–451.

ICALP-1972-Monien #automaton #bound #turing machine

Relationship between Pushdown Automata and Tape-Bounded Turing Machines (BM), pp. 575–583.

ICALP-1972-PazR #approximate #automaton #linear #problem

Linear Automata — Approximation Problem (Extended Abstract) (AP, MR), pp. 99–102.

STOC-1971-Buttelmann #automaton #finite #generative #on the #strict

On Generalized Finite Automata and Unrestricted Generative Grammars (HWB), pp. 63–77.

STOC-1971-LevyJ #automaton

Some Results in Tree Automata (LSL, AKJ), pp. 78–85.

STOC-1970-Ellis #automaton #probability

Probabilistic Tree Automata (CAE), pp. 198–205.

STOC-1970-Perrot #automaton #finite #monad #on the

On The Relationship between Finite Automata, Finite Monoids, and Prefix Codes (JFP), pp. 217–220.

STOC-1969-Thatcher #automaton #finite

Transformations and Translations from the Point of View of Generalized Finite Automata Theory (JWT), pp. 129–142.