60 papers:
CIAA-2015-Szykula #automaton- Checking Whether an Automaton Is Monotonic Is NP-complete (MS), pp. 279–291.
DLT-2015-KlimannPS #automaton #infinity- A Connected 3-State Reversible Mealy Automaton Cannot Generate an Infinite Burnside Group (IK, MP, DS), pp. 313–325.
- DLT-J-2013-CarninoL14 #automaton
- Factorizations and Universal Automaton of ω-Languages (VC, SL), pp. 1111–1126.
- CIAA-2014-Roche-LimaDF #automaton #kernel
- Pairwise Rational Kernels Obtained by Automaton Operations (ARL, MD, BF), pp. 332–345.
TACAS-2013-RenaultDKP #automaton #composition #model checking #performance- Strength-Based Decomposition of the Property Büchi Automaton for Faster Model Checking (ER, ADL, FK, DP), pp. 580–593.
- CIAA-J-2012-IbarraT13 #automaton #how #multi
- How to synchronize the Heads of a Multitape Automaton (OHI, NQT), pp. 799–814.
- CIAA-2013-HanKS #approximate #automaton #context-free grammar #finite
- Approximate Matching between a Context-Free Grammar and a Finite-State Automaton (YSH, SKK, KS), pp. 146–157.
- DLT-2013-CarninoL #automaton
- Factorizations and Universal Automaton of ω Languages (VC, SL), pp. 338–349.
ICALP-v2-2013-Basset #automaton #probability #process- A Maximal Entropy Stochastic Process for a Timed Automaton, (NB), pp. 61–73.
LATA-2013-LaugerotteSZ #automaton- From Regular Tree Expression to Position Tree Automaton (ÉL, NOS, DZ), pp. 395–406.
CASE-2012-LiK #automation #automaton #finite #generative #modelling #testing #using- Model-based automatic test generation for Simulink/Stateflow using extended finite automaton (ML, RK), pp. 857–862.
- CIAA-2012-IbarraT #automaton #how #multi
- How to Synchronize the Heads of a Multitape Automaton (OHI, NQT), pp. 192–204.
- CIAA-2012-KlimannMP #automaton #implementation
- Implementing Computations in Automaton (Semi)groups (IK, JM, MP), pp. 240–252.
- ICALP-v2-2012-Velner #automaton #complexity
- The Complexity of Mean-Payoff Automaton Expression (YV), pp. 390–402.
- LATA-2012-NikolicS #analysis #array
- Automaton-Based Array Initialization Analysis (DN, FS), pp. 420–432.
- LATA-2012-Woryna #automaton #self
- Automaton Ranks of Some Self-similar Groups (AW), pp. 514–525.
CAV-2012-DriscollTR #automaton #library #named- OpenNWA: A Nested-Word Automaton Library (ED, AVT, TWR), pp. 665–671.
- CIAA-2011-HanK #automaton
- A Cellular Automaton Model for Car Traffic with a Form-One-Lane Rule (YSH, SKK), pp. 154–165.
- LATA-2010-ArrighiG #automaton #quantum
- A Simple n-Dimensional Intrinsically Universal Quantum Cellular Automaton (PA, JG), pp. 70–81.
- CIAA-2009-ClarridgeS #automaton
- A Cellular Automaton Model for Car Traffic with a Slow-to-Stop Rule (AC, KS), pp. 44–53.
- CIAA-2009-HolzerM #algorithm #automaton
- An nlogn Algorithm for Hyper-minimizing States in a (Minimized) Deterministic Automaton (MH, AM), pp. 4–13.
- CIAA-2009-LiuYLT #automaton
- A Table Compression Method for Extended Aho-Corasick Automaton (YL, YY, PL, JT), pp. 84–93.
VLDB-2008-SilvastiSS #automaton- XML-document-filtering automaton (PS, SS, ESS), pp. 1666–1671.
- CIAA-2008-ChamparnaudDJ #automaton #geometry #regular expression #testing
- Testing Whether a Binary and Prolongeable Regular Language LIs Geometrical or Not on the Minimal Deterministic Automaton of Pref(L) (JMC, JPD, HJ), pp. 68–77.
ICPR-2008-KauffmannP #automaton #gpu- Cellular automaton for ultra-fast watershed transform on GPU (CK, NP), pp. 1–4.
CSL-2008-TorreMP #automaton #exponential #infinity- An Infinite Automaton Characterization of Double Exponential Time (SLT, PM, GP), pp. 33–48.
- CIAA-2007-AnselmoGM #2d #automaton
- Tiling Automaton: A Computational Model for Recognizable Two-Dimensional Languages (MA, DG, MM), pp. 290–302.
- CIAA-2007-CrochemoreEGM #automaton #on the
- On the Suffix Automaton with Mismatches (MC, CE, AG, FM), pp. 144–156.
- CIAA-2007-KucherovNR #automaton #set
- Subset Seed Automaton (GK, LN, MAR), pp. 180–191.
- DLT-2007-ChamparnaudOZ #equation #performance
- An Efficient Computation of the Equation K-Automaton of a Regular K-Expression (JMC, FO, DZ), pp. 145–156.
WCRE-2006-LoK #assessment #empirical #named #specification- QUARK: Empirical Assessment of Automaton-based Specification Miners (DL, SCK), pp. 51–60.
- CIAA-2006-GiraudVL #automaton #finite
- Path-Equivalent Removals of epsilon-transitions in a Genomic Weighted Finite Automaton (MG, PV, DL), pp. 23–33.
- CIAA-2006-Thurston #automaton #parsing #regular expression
- Parsing Computer Languages with an Automaton Compiled from a Single Regular Expression (ADT), pp. 285–286.
- ICALP-v1-2006-NearyW #automaton
- P-completeness of Cellular Automaton Rule 110 (TN, DW), pp. 132–143.
- CIAA-2005-FujiyoshiK #automaton #linear #recognition
- Deterministic Recognition of Trees Accepted by a Linear Pushdown Tree Automaton (AF, IK), pp. 129–140.
- CIAA-2005-Sakarovitch #automaton
- The Language, the Expression, and the (Small) Automaton (JS), pp. 15–30.
- ICALP-2005-CohenFIKP #automaton #finite #graph
- Label-Guided Graph Exploration by a Finite Automaton (RC, PF, DI, AK, DP), pp. 335–346.
- CIAA-2004-ChamparnaudNZ #automaton
- Computing the Follow Automaton of an Expression (JMC, FN, DZ), pp. 90–101.
- CIAA-2004-Polak #automaton #nondeterminism #using
- Minimalizations of NFA Using the Universal Automaton (LP), pp. 325–326.
- CIAA-2003-GuingneKN #automaton #complexity
- Running Time Complexity of Printing an Acyclic Automaton (FG, AK, FN), pp. 131–140.
- DLT-2003-KlimannLMP #ambiguity #automaton
- Deciding the Sequentiality of a Finitely Ambiguous Max-Plus Automaton (IK, SL, JM, CP), pp. 373–385.
- DLT-2003-Polak #automaton
- Syntactic Semiring and Universal Automaton (LP), pp. 411–422.
- CIAA-2002-Okhotin #linear #performance #recognition
- Efficient Automaton-Based Recognition for Linear Conjunctive Languages (AO), pp. 169–181.
- CIAA-2002-Tronicek #automaton #sequence
- Common Subsequence Automaton (ZT), pp. 270–275.
- DLT-2002-Okhotin #automaton #linear #representation
- Automaton Representation of Linear Conjunctive Languages (AO), pp. 393–404.
- DLT-2002-UmeoK #automaton #communication #infinity #realtime #sequence
- An Infinite Prime Sequence Can Be Generated in Real-Time by a 1-Bit Inter-cell Communication Cellular Automaton (HU, NK), pp. 339–348.
- CIAA-2000-ChamparnaudZ #automaton #canonical #finite
- New Finite Automaton Constructions Based on Canonical Derivatives (JMC, DZ), pp. 94–104.
- CIAA-2000-IbarraS #automaton
- Generalizing the Discrete Timed Automaton (OHI, JS), pp. 157–169.
- CIAA-2000-LodayaR #automaton #navigation #web
- An Automaton Model of User-Controlled Navigation on the Web (KL, RR), pp. 208–216.
- WIA-1999-Eramian #image
- Computing Entropy Maps of Finite-Automaton-Encoded Binary Images (MGE), pp. 81–90.
IWTCS-1999-HigashinoNTC #automaton #generative #testing- Generating Test Cases for a Timed I/O Automaton Model (TH, AN, KT, ARC), pp. 197–214.
- WIA-1998-HuerterSWY #automaton #finite #implementation
- Implementing Reversed Alternating Finite Automaton (r-AFA) Operations (SH, KS, XW, SY), pp. 69–81.
- WIA-1997-Caron #automaton #named #regular expression
- LANGAGE: A Maple Package for Automaton Characterization of Regular Languages (PC), pp. 46–55.
- WIA-1997-Trahtman #automaton #estimation #finite #order #precise #testing
- A Precise Estimation of the Order of Local Testability of a Deterministic Finite Automaton (ANT), pp. 198–212.
- CSL-1997-Klarlund
- Mona & Fido: The Logic-Automaton Connection in Practice (NK), pp. 311–326.
- WIA-1996-PontyZC #algorithm #automaton #polynomial #regular expression
- A New Quadratic Algorithm to Convert a Regular Expression into an Automaton (JLP, DZ, JMC), pp. 109–119.
- ICALP-1987-Beauquier #automaton
- Minimal Automaton of a Rational Cover (DB), pp. 174–189.
- ICALP-1984-Girault-Beauquier #automaton #behaviour #finite #infinity
- Some Results About Finite and Infinite Behaviours of a Pushdown Automaton (DB), pp. 187–195.
DAC-1982-EustaceM #approach #automaton #design #finite- A Deterministic finite automaton approach to design rule checking for VLSI (RAE, AM), pp. 712–717.
STOC-1981-DurisG #automaton- Fooling a Two-Way Automaton or One Pushdown Store Is Better Than One Counter for Two Way Machines (Preliminary Version) (PD, ZG), pp. 177–188.
