BibSLEIGH
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
finite
Google finite

Tag #finite

794 papers:

CIAACIAA-2019-Beier0 #automaton #linear
Semi-linear Lattices and Right One-Way Jumping Finite Automata (Extended Abstract) (SB, MH0), pp. 70–82.
CIAACIAA-2019-FujiyoshiP #automaton #graph #set
A Simple Extension to Finite Tree Automata for Defining Sets of Labeled, Connected Graphs (AF, DP), pp. 121–132.
CIAACIAA-2019-HanKMS #architecture #automaton #simulation
A General Architecture of Oritatami Systems for Simulating Arbitrary Finite Automata (YSH, HK, YM, SS), pp. 146–157.
DLTDLT-2019-DobronravovDO #automaton #on the #string
On the Length of Shortest Strings Accepted by Two-Way Finite Automata (ED, ND, AO), pp. 88–99.
DLTDLT-2019-KariRV #automaton #rank #word
Words of Minimum Rank in Deterministic Finite Automata (JK, AR, AV), pp. 74–87.
DLTDLT-2019-YenY #transducer
Characterizing the Valuedness of Two-Way Finite Transducers (DDY, HCY), pp. 100–112.
ICMLICML-2019-DoanMR #analysis #approximate #distributed #learning #linear #multi
Finite-Time Analysis of Distributed TD(0) with Linear Function Approximation on Multi-Agent Reinforcement Learning (TTD, STM, JR), pp. 1626–1635.
ICMLICML-2019-HaochenS #random
Random Shuffling Beats SGD after Finite Epochs (JH, SS), pp. 2624–2633.
ICMLICML-2019-SarkarR #identification #linear
Near optimal finite time identification of arbitrary linear dynamical systems (TS, AR), pp. 5610–5618.
CASECASE-2019-BaiTYZD #algorithm #evaluation #exponential #performance #robust
An Accurate and Robust Algorithm for Performance Evaluation of Exponential Serial Lines with Finite Buffers (YB, JT, MY, LZ, PD), pp. 42–47.
CASECASE-2019-ReijnenHMRR #confluence
Finite Response and Confluence of State-based Supervisory Controllers (FFHR, ATH, JMvdMF, MAR, JER), pp. 509–516.
CASECASE-2019-ThuijsmanHTRS #automaton #synthesis
Computational Effort of BDD-based Supervisor Synthesis of Extended Finite Automata (ST, DH, RJMT, MAR, RRHS), pp. 486–493.
CADECADE-2019-MeloO #on the
On the Width of Regular Classes of Finite Structures (AAdM, MdOO), pp. 18–34.
ICTSSICTSS-2019-TimoPR #multi #mutation testing #state machine #testing
Multiple Mutation Testing for Timed Finite State Machine with Timed Guards and Timeouts (ONT, DP, AR), pp. 104–120.
CIAACIAA-2018-AllauzenR #algorithm #automaton
Algorithms for Weighted Finite Automata with Failure Transitions (CA, MDR), pp. 46–58.
CIAACIAA-2018-Davies #automaton #complexity
State Complexity of Reversals of Deterministic Finite Automata with Output (SD), pp. 133–145.
CIAACIAA-2018-NozakiHYS #automaton #using
Enumeration of Cryptarithms Using Deterministic Finite Automata (YN, DH, RY, AS), pp. 286–298.
DLTDLT-2018-0001JJ #automaton #complexity #problem #self #verification
Computational Complexity of Decision Problems on Self-verifying Finite Automata (MH0, SJ, JJJ), pp. 404–415.
DLTDLT-2018-Beier0 #automaton #decidability
Decidability of Right One-Way Jumping Finite Automata (SB, MH0), pp. 109–120.
DLTDLT-2018-Fleischer #problem
The Intersection Problem for Finite Semigroups (LF), pp. 318–329.
DLTDLT-2018-Gruber0W #on the #problem
On Minimal Grammar Problems for Finite Languages (HG, MH0, SW), pp. 342–353.
DLTDLT-2018-Michielini #first-order #logic #problem #word
Uniformization Problem for Variants of First Order Logic over Finite Words (VM), pp. 516–528.
FSCDFSCD-2018-Czajka #infinity #term rewriting
Term Rewriting Characterisation of LOGSPACE for Finite and Infinite Data (LC0), p. 19.
ICMLICML-2018-0004K #infinity #lightweight #optimisation #probability
Lightweight Stochastic Optimization for Minimizing Finite Sums with Infinite Data (SZ0, JTYK), pp. 5927–5935.
ICMLICML-2018-LuZLD #architecture #difference #equation #network
Beyond Finite Layer Neural Networks: Bridging Deep Architectures and Numerical Differential Equations (YL, AZ, QL, BD0), pp. 3282–3291.
MoDELSMoDELS-2018-Petrenko #state machine #testing #towards
Towards Testing from Finite State Machines with Symbolic Inputs and Outputs (AP), p. 187.
ESEC-FSEESEC-FSE-2018-AmarBB0M #difference #modelling #using
Using finite-state models for log differencing (HA, LB, NB, DL0, SM), pp. 49–59.
CAVCAV-2018-BartocciBNR #ltl #monitoring #semantics #specification
A Counting Semantics for Monitoring LTL Specifications over Finite Traces (EB, RB, DN, FR), pp. 547–564.
CSLCSL-2018-BerardBJ #bisimulation
Finite Bisimulations for Dynamical Systems with Overlapping Trajectories (BB, PB, VJ), p. 17.
ICTSSICTSS-2018-TvardovskiiEY #fault #state machine #testing
Deriving Tests with Guaranteed Fault Coverage for Finite State Machines with Timeouts (AT, KEF, NY), pp. 149–154.
CIAACIAA-2017-Bordihn0 #automaton #nondeterminism #on the
On the Number of Active States in Deterministic and Nondeterministic Finite Automata (HB, MH0), pp. 40–51.
CIAACIAA-2017-GerdjikovMS #functional #transducer
A Simple Method for Building Bimachines from Functional Finite-State Transducers (SG, SM, KUS), pp. 113–125.
CIAACIAA-2017-KutribMW #state machine
Transducing Reversibly with Finite State Machines (MK, AM, MW), pp. 151–162.
DLTDLT-2017-Beier0K #automaton #complexity #decidability
Operational State Complexity and Decidability of Jumping Finite Automata (SB, MH0, MK), pp. 96–108.
DLTDLT-2017-EndrullisSS #automaton
Undecidability and Finite Automata (JE, JOS, TS), pp. 160–172.
CIKMCIKM-2017-YuCY #algebra #matrix #rank #recommendation
Low-Rank Matrix Completion over Finite Abelian Group Algebras for Context-Aware Recommendation (CAY, TSC, YHY), pp. 2415–2418.
ICMLICML-2017-BalleM #learning #policy
Spectral Learning from a Single Trajectory under Finite-State Policies (BB, OAM), pp. 361–370.
OOPSLAOOPSLA-2017-WangDS #automaton #synthesis #using
Synthesis of data completion scripts using finite tree automata (XW0, ID, RS), p. 26.
POPLPOPL-2017-DAntoniV #higher-order #logic #monad #sequence
Monadic second-order logic on finite sequences (LD, MV), pp. 232–245.
ICTSSICTSS-2017-Nguena-TimoPR #multi #mutation testing #state machine #testing
Multiple Mutation Testing from Finite State Machines with Symbolic Inputs (ONT, AP, SR), pp. 108–125.
CIAACIAA-2016-Axelsen0K #automaton
The Degree of Irreversibility in Deterministic Finite Automata (HBA, MH0, MK), pp. 15–26.
CIAACIAA-2016-FernauK #automaton #exponential #problem
Problems on Finite Automata and the Exponential Time Hypothesis (HF, AK), pp. 89–100.
CIAACIAA-2016-KhoussainovL #algebra #automaton #infinity #problem
Decision Problems for Finite Automata over Infinite Algebraic Structures (BK, JL), pp. 3–11.
DLTDLT-2016-JirasekJS #ambiguity #automaton
Operations on Unambiguous Finite Automata (JJJ, GJ, JS), pp. 243–255.
DLTDLT-2016-Paul #ambiguity #automaton #on the #polynomial
On Finite and Polynomial Ambiguity of Weighted Tree Automata (EP), pp. 368–379.
FMFM-2016-VakiliD #logic #similarity #using
Finite Model Finding Using the Logic of Equality with Uninterpreted Functions (AV, NAD), pp. 677–693.
ICMLICML-2016-RodomanovK #optimisation
A Superlinearly-Convergent Proximal Newton-type Method for the Optimization of Finite Sums (AR, DK), pp. 2597–2605.
ICPRICPR-2016-MezumanW #bound
A tight convex upper bound on the likelihood of a finite mixture (EM, YW), pp. 1683–1688.
FSEFSE-2016-Monteiro #bound #fixpoint #implementation #model checking #modelling
Bounded model checking of state-space digital systems: the impact of finite word-length effects on the implementation of fixed-point digital controllers based on state-space modeling (FRM), pp. 1151–1153.
CASECASE-2016-JiaZCAX #evaluation #geometry #performance
Performance evaluation in finite production run-based serial lines with geometric machines (ZJ, LZ, GC, JA, GX), pp. 450–455.
CAVCAV-2016-KafleGM #abstract interpretation #automaton #horn clause #named #using #verification
Rahft: A Tool for Verifying Horn Clauses Using Abstract Interpretation and Finite Tree Automata (BK, JPG, JFM), pp. 261–268.
CSLCSL-2016-AtseriasT
Non-Homogenizable Classes of Finite Structures (AA, ST), p. 16.
CSLCSL-2016-BaeldeLS #calculus #logic
A Sequent Calculus for a Modal Logic on Finite Data Trees (DB, SL, SS), p. 16.
CSLCSL-2016-GanardiGL #bisimulation #complexity #on the #parallel
On the Parallel Complexity of Bisimulation on Finite Systems (MG, SG, ML), p. 17.
CSLCSL-2016-KotekVZ #bound #higher-order #monad #satisfiability
Monadic Second Order Finite Satisfiability and Unbounded Tree-Width (TK, HV, FZ), p. 20.
IJCARIJCAR-2016-BansalRBT #constraints #set #smt
A New Decision Procedure for Finite Sets and Cardinality Constraints in SMT (KB, AR, CWB, CT), pp. 82–98.
CIAACIAA-J-2013-KutribMMPW15 #automaton #decidability #queue
Deterministic input-driven queue automata: Finite turns, decidability, and closure properties (MK, AM, CM, BP, MW), pp. 58–71.
CIAACIAA-2015-FernauPS #automaton #complexity
Jumping Finite Automata: Characterizations and Complexity (HF, MP, MLS), pp. 89–101.
CIAACIAA-2015-GruberHJ #automaton #nondeterminism
More on Deterministic and Nondeterministic Finite Cover Automata — Extended Abstract (HG, MH, SJ), pp. 114–126.
CIAACIAA-2015-Hulden #automaton #regular expression
From Two-Way to One-Way Finite Automata — Three Regular Expression-Based Methods (MH), pp. 176–187.
CIAACIAA-2015-KushikY #automaton #nondeterminism #sequence #state machine
Describing Homing and Distinguishing Sequences for Nondeterministic Finite State Machines via Synchronizing Automata (NK, NY), pp. 188–198.
CIAACIAA-2015-Watson #automaton #hardware #implementation #regular expression
Hardware Implementations of Finite Automata and Regular Expressions — Extended Abstract (BWW), pp. 13–17.
DLTDLT-2015-BealH
Deciding Proper Conjugacy of Classes of One-Sided Finite-Type-Dyck Shifts (MPB, PH), pp. 167–178.
DLTDLT-2015-BrandlS #analysis #automaton #complexity #monad
Complexity Analysis: Transformation Monoids of Finite Automata (CB, HUS), pp. 143–154.
DLTDLT-2015-CzybaST #automaton #infinity #modelling
Finite Automata Over Infinite Alphabets: Two Models with Transitions for Local Change (CC, CS, WT), pp. 203–214.
DLTDLT-2015-HolzerJK #automaton
Minimal Reversible Deterministic Finite Automata (MH, SJ, MK), pp. 276–287.
ICALPICALP-v1-2015-KomarathSS #bound
Comparator Circuits over Finite Bounded Posets (BK, JS, KSS), pp. 834–845.
LATALATA-2015-BachmeierLS #automaton #complexity
Finite Automata for the Sub- and Superword Closure of CFLs: Descriptional and Computational Complexity (GB, ML, MS), pp. 473–485.
LATALATA-2015-Zinoviadis #2d
Hierarchy and Expansiveness in 2D Subshifts of Finite Type (CZ), pp. 365–377.
RTARTA-2015-EndrullisZ #automaton #proving
Proving non-termination by finite automata (JE, HZ), pp. 160–176.
HCIDHM-EH-2015-Hu0LZY #3d #analysis #development
Development of a 3D Finite Element Model of the Chinese 50th Male for the Analysis of Automotive Impact (HH, LD, XL, CZ, YY), pp. 258–265.
ICMLICML-2015-AgarwalB #bound #optimisation
A Lower Bound for the Optimization of Finite Sums (AA, LB), pp. 78–86.
ICMLICML-2015-WuGS #combinator #feedback #identification #on the
On Identifying Good Options under Combinatorially Structured Feedback in Finite Noisy Environments (YW, AG, CS), pp. 1283–1291.
ECOOPECOOP-2015-BostromM #composition #source code #verification
Modular Verification of Finite Blocking in Non-terminating Programs (PB, PM), pp. 639–663.
FoSSaCSFoSSaCS-2015-Winter #bisimulation #λ-calculus
A Completeness Result for Finite λ-bisimulations (JW), pp. 117–132.
CADECADE-2015-Paulson #automaton #formal method #set #using
A Formalisation of Finite Automata Using Hereditarily Finite Sets (LCP), pp. 231–245.
CSLCSL-2015-BovaM #first-order #query
First-Order Queries on Finite Abelian Groups (SB, BM), pp. 41–59.
CSLCSL-2015-DawarW
A Definability Dichotomy for Finite Valued CSPs (AD, PW), pp. 60–77.
CSLCSL-2015-KupfermanV #on the #probability
On Relative and Probabilistic Finite Counterability (OK, GV), pp. 175–192.
ICTSSICTSS-2015-GrozSPO #identification #sequence #state machine #using
Inferring Finite State Machines Without Reset Using State Identification Sequences (RG, AdSS, AP, CO), pp. 161–177.
ICTSSICTSS-2015-KushikY #adaptation #heuristic #nondeterminism #sequence #state machine
Heuristics for Deriving Adaptive Homing and Distinguishing Sequences for Nondeterministic Finite State Machines (NK, HY), pp. 243–248.
ICTSSICTSS-2015-PetrenkoS #state machine
Checking Experiments for Finite State Machines with Symbolic Inputs (AP, AdSS), pp. 3–18.
LICSLICS-2015-AmarilliB #query #strict
Finite Open-World Query Answering with Number Restrictions (AA, MB), pp. 305–316.
LICSLICS-2015-KlinKOT #constraints #problem
Locally Finite Constraint Satisfaction Problems (BK, EK, JO, ST), pp. 475–486.
DLTDLT-J-2013-KucukSY14 #automaton
Finite Automata with Advice Tapes (UK, ACCS, AY), pp. 987–1000.
DLTDLT-J-2013-KutribMW14a #automaton #multi
Stateless One-Way Multi-Head Finite Automata with Pebbles (MK, AM, MW), pp. 1141–1160.
DLTDLT-J-2013-Shur14 #anti
Languages with a Finite antidictionary: some growth Questions (AMS), pp. 937–954.
AFLAFL-2014-BordihnKM #automaton #communication #parallel
Measuring Communication in Parallel Communicating Finite Automata (HB, MK, AM), pp. 124–138.
AFLAFL-2014-Campeanu #automaton #nondeterminism
Simplifying Nondeterministic Finite Cover Automata (CC), pp. 162–173.
AFLAFL-2014-FernauFH #distributed #hybrid
Cooperating Distributed Grammar Systems of Finite Index Working in Hybrid Modes (HF, RF, MH), pp. 246–260.
AFLAFL-2014-GruberH #automaton #complexity #regular expression #summary
From Finite Automata to Regular Expressions and Back — A Summary on Descriptional Complexity (HG, MH), pp. 25–48.
CIAACIAA-2014-AmorimMR #canonical #linear #transducer #using
Counting Equivalent Linear Finite Transducers Using a Canonical Form (IA, AM, RR), pp. 70–83.
CIAACIAA-2014-BieglerM #automaton #on the #word
On Comparing Deterministic Finite Automata and the Shuffle of Words (FB, IM), pp. 98–109.
CIAACIAA-2014-KurkaV #transducer
Analytic Functions Computable by Finite State Transducers (PK, TV), pp. 252–263.
DLTDLT-2014-DickyJ #infinity #word
Embedding Finite and Infinite Words into Overlapping Tiles — (AD, DJ), pp. 339–347.
DLTDLT-2014-Sinya #automaton #graph
Graph Spectral Properties of Deterministic Finite Automata — (RS), pp. 76–83.
ICALPICALP-v1-2014-KoppartyKS #performance
Efficient Indexing of Necklaces and Irreducible Polynomials over Finite Fields (SK, MK, MES), pp. 726–737.
ICALPICALP-v2-2014-EmekLUW #problem #state machine
Solving the ANTS Problem with Asynchronous Finite State Machines (YE, TL, JU, RW), pp. 471–482.
LATALATA-2014-AnselmoGM
Picture Codes with Finite Deciphering Delay (MA, DG, MM), pp. 88–100.
LATALATA-2014-ZhengGQ #automaton #complexity #on the
On the State Complexity of Semi-quantum Finite Automata (SZ, JG, DQ), pp. 601–612.
SEFMSEFM-2014-CasselHJS #learning #state machine
Learning Extended Finite State Machines (SC, FH, BJ, BS), pp. 250–264.
LISPILC-2014-SmithP #lisp #performance #permutation
Efficient Finite Permutation Groups and Homomesy Computation in Common Lisp (RS, BP), p. 60.
CoGCIG-2014-Tsang14a #probability #transducer
Comparing the structure of probabilistic 4- and 8-state finite transducer representations for Prisoner's Dilemma (JT), pp. 1–8.
KRKR-2014-GarciaLS #logic #reasoning
Finite Model Reasoning in Horn Description Logics (YAIG, CL, TS).
PPDPPPDP-2014-YangEMMN #encryption #unification
Theories of Homomorphic Encryption, Unification, and the Finite Variant Property (FY, SE, CM, JM, PN), pp. 123–133.
FSEFSE-2014-LiYP0H #infinity #ltl #named #satisfiability
Aalta: an LTL satisfiability checker over Infinite/Finite traces (JL, YY, GP, LZ, JH), pp. 731–734.
ASPLOSASPLOS-2014-MytkowiczMS #state machine
Data-parallel finite-state machines (TM, MM, WS), pp. 529–542.
ASPLOSASPLOS-2014-ZhaoWS #state machine
Challenging the “embarrassingly sequential”: parallelizing finite state machine-based computations through principled speculation (ZZ, BW, XS), pp. 543–558.
CASECASE-2014-XueL
Input-output finite-time stability of time-delay systems and its application to active vibration control (WX, KL), pp. 878–882.
PDPPDP-2014-BiZZZZ
A Finite Volume Model for Dam-Break Floods with Wet-Dry Fronts on Non-uniform Grids (SB, JZ, NZ, HZ, YZ), pp. 322–329.
PDPPDP-2014-GrandjeanU #2d #clustering #difference #distributed #memory management #on the #parallel
On Partitioning Two Dimensional Finite Difference Meshes for Distributed Memory Parallel Computers (AG, BU), pp. 9–16.
IJCARIJCAR-2014-BaumgartnerBW #proving #quantifier #theorem proving
Finite Quantification in Hierarchic Theorem Proving (PB, JB, UW), pp. 152–167.
IJCARIJCAR-2014-EhlersL #approximate #incremental #logic #satisfiability
A Tool That Incrementally Approximates Finite Satisfiability in Full Interval Temporal Logic (RE, ML), pp. 360–366.
ICDARICDAR-2013-HaoGZXPSK #automation #detection #fault #transducer
Automated Error Detection and Correction of Chinese Characters in Written Essays Based on Weighted Finite-State Transducer (SH, ZG, MZ, YX, HP, KS, DK), pp. 763–767.
WCREWCRE-2013-WalkinshawTD #modelling #state machine
Inferring Extended Finite State Machine models from software executions (NW, RT, JD), pp. 301–310.
CIAACIAA-J-2012-Mohri13 #ambiguity #automaton #functional #on the #transducer
On the Disambiguation of Finite Automata and Functional Transducers (MM), pp. 847–862.
CIAACIAA-2013-HanKS #approximate #automaton #context-free grammar
Approximate Matching between a Context-Free Grammar and a Finite-State Automaton (YSH, SKK, KS), pp. 146–157.
CIAACIAA-2013-KushikY #nondeterminism #on the #sequence #state machine
On the Length of Homing Sequences for Nondeterministic Finite State Machines (NK, NY), pp. 220–231.
CIAACIAA-2013-KutribMMPW #automaton #decidability #queue
Input-Driven Queue Automata: Finite Turns, Decidability, and Closure Properties (MK, AM, CM, BP, MW), pp. 232–243.
CIAACIAA-2013-MaiaMR #complexity
Incomplete Transition Complexity of Basic Operations on Finite Languages (EM, NM, RR), pp. 349–356.
CIAACIAA-2013-Veanes #automaton
Applications of Symbolic Finite Automata (MV), pp. 16–23.
DLTDLT-2013-BertoniCD #automaton #context-free grammar #decidability #linear #problem #quantum
Quantum Finite Automata and Linear Context-Free Languages: A Decidable Problem (AB, CC, FD), pp. 82–93.
DLTDLT-2013-Freivalds #automaton #turing machine
Ultrametric Finite Automata and Turing Machines (RF), pp. 1–11.
DLTDLT-2013-KucukSY #automaton
Finite Automata with Advice Tapes (UK, ACCS, AY), pp. 301–312.
DLTDLT-2013-KutribMW #automaton #multi
One-Way Multi-Head Finite Automata with Pebbles But No States (MK, AM, MW), pp. 313–324.
DLTDLT-2013-Loding #ambiguity #automaton
Unambiguous Finite Automata (CL), pp. 29–30.
DLTDLT-2013-Shur #anti #order
Languages with a Finite Antidictionary: Growth-Preserving Transformations and Available Orders of Growth (AMS), pp. 445–457.
ICALPICALP-v1-2013-Grier #game studies
Deciding the Winner of an Arbitrary Finite Poset Game Is PSPACE-Complete (DG), pp. 497–503.
ICALPICALP-v2-2013-BenaimBCKLMW #complexity #logic
Complexity of Two-Variable Logic on Finite Trees (SB, MB, WC, EK, RL, FM, JW), pp. 74–88.
ICALPICALP-v2-2013-Worrell #automaton #equivalence #multi #problem
Revisiting the Equivalence Problem for Finite Multitape Automata (JW), pp. 422–433.
CoGCIG-2013-Tsang #representation #transducer
The structure of a 3-state finite transducer representation for Prisoner's Dilemma (JT), pp. 1–7.
LOPSTRLOPSTR-2013-NishidaV #representation
A Finite Representation of the Narrowing Space (NN, GV), pp. 54–71.
PPDPPPDP-2013-AsadaHKHN #branch #calculus #graph #graph transformation #monad
A parameterized graph transformation calculus for finite graphs with monadic branches (KA, SH, HK, ZH, KN), pp. 73–84.
PPDPPPDP-2013-CaballeroST #constraints #programming
Finite type extensions in constraint programming (RC, PJS, ATF), pp. 217–227.
CASECASE-2013-ChenZAX #analysis
Analysis of production completion time in Bernoulli serial lines with finite buffers (GC, LZ, JA, GX), pp. 770–775.
CASECASE-2013-MohajeraniMF #automaton #composition #using #verification
Compositional nonblocking verification for extended finite-state automata using partial unfolding (SM, RM, MF), pp. 930–935.
DACDAC-2013-ZhouLJ #3d #complexity #linear #multi #scalability
A direct finite element solver of linear complexity for large-scale 3-D circuit extraction in multiple dielectrics (BZ, HL, DJ), p. 6.
DATEDATE-2013-ZhuDNZ #implementation #robust #state machine
Robust and extensible task implementations of synchronous finite state machines (QZ, PD, MDN, HZ), pp. 1319–1324.
PDPPDP-2013-CalandraDFLS #difference #evaluation
Evaluation of Successive CPUs/APUs/GPUs Based on an OpenCL Finite Difference Stencil (HC, RD, PF, JLL, IS), pp. 405–409.
CADECADE-2013-ReynoldsTGKDB #quantifier #smt
Quantifier Instantiation Techniques for Finite Model Finding in SMT (AR, CT, AG, SK, MD, CB), pp. 377–391.
CAVCAV-2013-DAntoniV #equivalence #transducer
Equivalence of Extended Symbolic Finite Transducers (LD, MV), pp. 624–639.
CAVCAV-2013-ReynoldsTGK #smt
Finite Model Finding in SMT (AR, CT, AG, SK), pp. 640–655.
ICTSSICTSS-2013-KushikEY #adaptation #nondeterminism #state machine
Adaptive Homing and Distinguishing Experiments for Nondeterministic Finite State Machines (NK, KEF, NY), pp. 33–48.
ISSTAISSTA-2013-PurandareDE #monitoring #optimisation
Optimizing monitoring of finite state properties through monitor compaction (RP, MBD, SGE), pp. 280–290.
LICSLICS-2013-FiliotGRS #transducer
From Two-Way to One-Way Finite State Transducers (EF, OG, PAR, FS), pp. 468–477.
LICSLICS-2013-GogaczM #convergence
Converging to the Chase — A Tool for Finite Controllability (TG, JM), pp. 540–549.
LICSLICS-2013-Otto #modelling #symmetry
Groupoids, Hypergraphs, and Symmetries in Finite Models (MO), pp. 53–62.
ITiCSEITiCSE-2012-DrorR #automaton
The effect of mathematical vs. verbal formulation for finite automata (TD, DLR), p. 382.
AFLAFL-J-2011-BenattarBLMRS12 #synthesis #transducer
Channel Synthesis for Finite Transducers (GB, BB, DL, JM, OHR, MS), pp. 1241–1260.
DLTDLT-J-2011-ZhengQL12 #automaton #quantum
Some Languages Recognized by Two-Way Finite Automata with Quantum and Classical States (SZ, DQ, LL), pp. 1117–1130.
CIAACIAA-2012-Mohri #algorithm #ambiguity #automaton #functional #transducer
A Disambiguation Algorithm for Finite Automata and Functional Transducers (MM), pp. 265–277.
DLTDLT-2012-GandhiKL #complexity #on the #word
On State Complexity of Finite Word and Tree Languages (AG, BK, JL), pp. 392–403.
DLTDLT-2012-GiambrunoMNS #bidirectional
A Generalization of Girod’s Bidirectional Decoding Method to Codes with a Finite Deciphering Delay (LG, SM, JN, CS), pp. 471–476.
DLTDLT-2012-KapoutsisL #automaton #nondeterminism #theorem
Analogs of Fagin’s Theorem for Small Nondeterministic Finite Automata (CAK, NL), pp. 202–213.
DLTDLT-2012-KutribMW #automaton #multi
States and Heads Do Count for Unary Multi-head Finite Automata (MK, AM, MW), pp. 214–225.
LATALATA-2012-Axelsen #automaton #multi
Reversible Multi-head Finite Automata Characterize Reversible Logarithmic Space (HBA), pp. 95–105.
LATALATA-2012-SaloT #automaton #on the #product line #set
On Stable and Unstable Limit Sets of Finite Families of Cellular Automata (VS, IT), pp. 502–513.
LATALATA-2012-Yamakami #automaton #quantum
One-Way Reversible and Quantum Finite Automata with Advice (TY), pp. 526–537.
FMFM-2012-CarlierDG #constraints #theorem proving
A Certified Constraint Solver over Finite Domains (MC, CD, AG), pp. 116–131.
RTARTA-2012-Lisitsa #automaton #modelling #safety #verification
Finite Models vs Tree Automata in Safety Verification (AL), pp. 225–239.
SEFMSEFM-2012-LefticaruI #algorithm #approach #generative #search-based #state machine #testing #using
An Improved Test Generation Approach from Extended Finite State Machines Using Genetic Algorithms (RL, FI), pp. 293–307.
FLOPSFLOPS-2012-Triska #constraints #prolog #theorem proving
The Finite Domain Constraint Solver of SWI-Prolog (MT), pp. 307–316.
ICFPICFP-2012-SeveriV #normalisation #recursion #type system
Pure type systems with corecursion on streams: from finite to infinitary normalisation (PS, FJdV), pp. 141–152.
ICMLICML-2012-BartokZS #adaptation #algorithm #monitoring #probability
An adaptive algorithm for finite stochastic partial monitoring (GB, NZ, CS), p. 231.
KDIRKDIR-2012-SantosGSK #behaviour #detection
Finite Belief Fusion Model for Hidden Source Behavior Change Detection (ESJ, QG, EES, JK), pp. 17–24.
POPLPOPL-2012-VeanesHLMB #algorithm #transducer
Symbolic finite state transducers: algorithms and applications (MV, PH, BL, DM, NB), pp. 137–150.
CASECASE-2012-FeiMAL #approach #automaton #scalability
A symbolic approach to large-scale discrete event systems modeled as finite automata with variables (ZF, SM, , BL), pp. 502–507.
CASECASE-2012-LiK #automation #automaton #generative #modelling #testing #using
Model-based automatic test generation for Simulink/Stateflow using extended finite automaton (ML, RK), pp. 857–862.
CASECASE-2012-ShoaeiFL #abstraction #automaton
Abstractions for nonblocking supervisory control of Extended Finite Automata (MRS, LF, BL), pp. 364–370.
DATEDATE-2012-AksoyCFM #design
Design of low-complexity digital finite impulse response filters on FPGAs (LA, EC, PFF, JCM), pp. 1197–1202.
DATEDATE-2012-ChatziparaskevasBP #difference #parallel #using
An FPGA-based parallel processor for Black-Scholes option pricing using finite differences schemes (GC, AB, IP), pp. 709–714.
DATEDATE-2012-NataleZ #implementation #state machine
Task implementation of synchronous finite state machines (MDN, HZ), pp. 206–211.
ICLPICLP-2012-FilardoE #flexibility
A Flexible Solver for Finite Arithmetic Circuits (NWF, JE), pp. 425–438.
ICLPICLP-J-2012-MetodiC #compilation #constraints #satisfiability
Compiling finite domain constraints to SAT with BEE (AM, MC), pp. 465–483.
ICSTICST-2012-EndoS #comparison #generative #state machine #testing
Experimental Comparison of Test Case Generation Methods for Finite State Machines (ATE, AdSS), pp. 549–558.
ICSTICST-2012-PetrenkoSY #generative #nondeterminism #sequence #state machine
Generating Checking Sequences for Nondeterministic Finite State Machines (AP, AdSS, NY), pp. 310–319.
ICTSSICTSS-2012-Vaandrager #learning #state machine
Active Learning of Extended Finite State Machines (FWV), pp. 5–7.
TAPTAP-2012-SulzmannZ #analysis #linear #logic
Constructive Finite Trace Analysis with Linear Temporal Logic (MS, AZ), pp. 132–148.
ICDARICDAR-2011-ChowdhuryGC #online #recognition #transducer
A Weighted Finite-State Transducer (WFST)-Based Language Model for Online Indic Script Handwriting Recognition (SC, UG, TC), pp. 599–602.
ICDARICDAR-2011-YamazoeEYT #approach #recognition #transducer
Hypothesis Preservation Approach to Scene Text Recognition with Weighted Finite-State Transducer (TY, ME, TY, KT), pp. 359–363.
CIAACIAA-J-2010-AllauzenRS11 #algorithm #composition #performance #transducer
A Filter-Based Algorithm for Efficient Composition of Finite-State Transducers (CA, MR, JS), pp. 1781–1795.
DLTDLT-J-2010-BordihnKM11 #automaton #communication #parallel
Undecidability and Hierarchy Results for Parallel Communicating Finite Automata (HB, MK, AM), pp. 1577–1592.
DLTDLT-J-2010-RigoW11 #logic #set
Logical Characterization of Recognizable Sets of polynomials over a Finite Field (MR, LW), pp. 1549–1563.
AFLAFL-2011-BenattarBLMRS #synthesis #transducer
Channel Synthesis for Finite Transducers (GB, BB, DL, JM, OHR, MS), pp. 79–92.
AFLAFL-2011-Choffrut #infinity #on the #word
On relations of finite words over infinite alphabets (CC), pp. 25–27.
AFLAFL-2011-MalettiQ #automaton
Hyper-minimisation of deterministic weighted finite automata over semifields (AM, DQ), pp. 285–299.
CIAACIAA-2011-DaciukW #automaton #representation
Smaller Representation of Finite State Automata (JD, DW), pp. 118–129.
CIAACIAA-2011-HolzerK #automaton
Gaining Power by Input Operations: Finite Automata and Beyond (MH, MK), pp. 16–29.
CIAACIAA-2011-KushikEY #adaptation #nondeterminism #state machine
Preset and Adaptive Homing Experiments for Nondeterministic Finite State Machines (NK, KEF, NY), pp. 215–224.
CIAACIAA-2011-PajicPP #approach #information management #transducer
Information Extraction from Semi-structured Resources: A Two-Phase Finite State Transducers Approach (VP, GPL, MP), pp. 282–289.
DLTDLT-2011-DrosteMST #composition
A Cascade Decomposition of Weighted Finite Transition Systems (MD, IM, BS, AT), pp. 472–473.
DLTDLT-2011-Kasprzik #automaton #query
Inference of Residual Finite-State Tree Automata from Membership Queries and Finite Positive Data (AK), pp. 476–477.
DLTDLT-2011-KuncO #automaton #using
Describing Periodicity in Two-Way Deterministic Finite Automata Using Transformation Semigroups (MK, AO), pp. 324–336.
LATALATA-2011-BareckaC #automaton #complexity #problem
The Parameterized Complexity of Chosen Problems for Finite Automata on Trees (AB, WC), pp. 129–141.
LATALATA-2011-CharlierDHS
Finite Orbits of Language Operations (EC, MD, TH, JS), pp. 204–215.
LATALATA-2011-CorranHKT #automation #monad
Singular Artin Monoids of Finite Coxeter Type Are Automatic (RC, MH, DK, RMT), pp. 250–261.
LATALATA-2011-PolicritiT #set
Well-Quasi-Ordering Hereditarily Finite Sets (AP, AIT), pp. 440–451.
TLCATLCA-2011-RehofU #combinator #logic
Finite Combinatory Logic with Intersection Types (JR, PU), pp. 169–183.
GCMGCM-2010-PlumpSS11 #automaton #graph #source code
Minimizing Finite Automata with Graph Programs (DP, RS, AS).
CASECASE-2011-FeiMA #automaton #modelling #resource management #using
Modeling sequential resource allocation systems using Extended Finite Automata (ZF, SM, ), pp. 444–449.
CASECASE-2011-MiremadiLA #automaton
BDD-based supervisory control on extended finite automata (SM, BL, ), pp. 25–31.
STOCSTOC-2011-Kopparty #complexity #on the
On the complexity of powering in finite fields (SK), pp. 489–498.
CSLCSL-2011-Straubing #algebra #word
Algebraic Characterization of the Alternation Hierarchy in FO2[<] on Finite Words (HS), pp. 525–537.
ICSTICST-2011-ChanderDSY #automaton #generative #modelling #sequence
Optimal Test Input Sequence Generation for Finite State Models and Pushdown Systems (AC, DD, KS, DY), pp. 140–149.
LICSLICS-2011-Atserias #tutorial
A Why-on-Earth Tutorial on Finite Model Theory (AA), p. 3.
ICSTSAT-2011-TanjoTB #csp #encoding #performance
A Compact and Efficient SAT-Encoding of Finite Domain CSP (TT, NT, MB), pp. 375–376.
VMCAIVMCAI-2011-GoubaultP #precise #static analysis
Static Analysis of Finite Precision Computations (EG, SP), pp. 232–247.
ICSMEICSM-2010-PradelBG #evaluation #framework #specification #state machine
A framework for the evaluation of specification miners based on finite state machines (MP, PB, TRG), pp. 1–10.
DLTDLT-J-2008-BassinoGN10 #complexity
The Average State Complexity of Rational Operations on Finite Languages (FB, LG, CN), pp. 495–516.
DLTDLT-J-2008-HolubN10 #on the #word
On the Relation between Periodicity and Unbordered Factors of Finite Words (SH, DN), pp. 633–645.
CIAACIAA-2010-AllauzenRS #composition #performance #transducer
Filters for Efficient Composition of Weighted Finite-State Transducers (CA, MR, JS), pp. 28–38.
CIAACIAA-2010-AntosM #approach #automaton #pattern matching
Finite Automata for Generalized Approach to Backward Pattern Matching (JA, BM), pp. 49–58.
CIAACIAA-2010-Egri-NagyN #on the #word
On Straight Words and Minimal Permutators in Finite Transformation Semigroups (AEN, CLN), pp. 115–124.
DLTDLT-2010-BordihnKM #automaton #communication #parallel
Undecidability and Hierarchy Results for Parallel Communicating Finite Automata (HB, MK, AM), pp. 88–99.
DLTDLT-2010-Staiger #infinity #word
Joint Topologies for Finite and Infinite Words (LS), pp. 442–443.
ICALPICALP-v2-2010-GimbertO #automaton #decidability #probability #problem #word
Probabilistic Automata on Finite Words: Decidable and Undecidable Problems (HG, YO), pp. 527–538.
LATALATA-2010-LetichevskySS #automaton #equivalence #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.
ICPRICPR-2010-HamKN #automation #detection #fuzzy
Fire-Flame Detection Based on Fuzzy Finite Automation (SH, BK, JYN), pp. 3919–3922.
ICPRICPR-2010-IsmailF #clustering #modelling #robust
Possibilistic Clustering Based on Robust Modeling of Finite Generalized Dirichlet Mixture (MMBI, HF), pp. 573–576.
ICPRICPR-2010-LlobetCPA #transducer #using
OCR Post-processing Using Weighted Finite-State Transducers (RL, JRCN, JCPC, JA), pp. 2021–2024.
SPLCSPLC-2010-KaratasOD #constraints #feature model #logic programming #modelling
Mapping Extended Feature Models to Constraint Logic Programming over Finite Domains (ASK, HO, AHD), pp. 286–299.
PPDPPPDP-2010-Tarau #declarative #modelling
Declarative modeling of finite mathematics (PT), pp. 131–142.
SACSAC-2010-LeeKWAHP #3d #random #using
Tracking random finite objects using 3D-LIDAR in marine environments (KWL, BK, WSW, MA, FSH, NMP), pp. 1282–1287.
CASECASE-2010-OuedraogoKMA #approach #automaton
Symbolic approach to nonblocking and safe control of Extended Finite Automata (LO, RK, RM, ), pp. 471–476.
DACDAC-2010-NovoLFRC #data flow #precise
Exploiting finite precision information to guide data-flow mapping (DN, ML, RF, PR, FC), pp. 248–253.
FoSSaCSFoSSaCS-2010-CateF #calculus #proving #μ-calculus
An Easy Completeness Proof for the Modal μ-Calculus on Finite Trees (BtC, GF), pp. 161–175.
TACASTACAS-2010-DoyenR #algorithm #automaton
Antichain Algorithms for Finite Automata (LD, JFR), pp. 2–22.
LICSLICS-2010-ColcombetL #cost analysis
Regular Cost Functions over Finite Trees (TC, CL), pp. 70–79.
LICSLICS-2010-He #first-order #on the #quantifier #strict
On the Strictness of the First-Order Quantifier Structure Hierarchy over Finite Structures (YH), pp. 170–178.
LICSLICS-2010-Milius #calculus
A Sound and Complete Calculus for Finite Stream Circuits (SM), pp. 421–430.
PODSPODS-2009-Libkin #database
The finite model theory toolbox of a database theoretician (LL), pp. 65–76.
CIAACIAA-J-2008-AllauzenM09 #composition #transducer
N-Way Composition of Weighted Finite-State Transducers (CA, MM), pp. 613–627.
CIAACIAA-J-2008-HolzerK09 #automaton #complexity #nondeterminism
Nondeterministic Finite Automata — Recent Results on the Descriptional and Computational Complexity (MH, MK), pp. 563–580.
CIAACIAA-2009-Barthelemy #framework #testing
A Testing Framework for Finite-State Morphology (FB), pp. 75–83.
CIAACIAA-2009-Freivalds #automaton
Amount of Nonconstructivity in Finite Automata (RF), pp. 227–236.
CIAACIAA-2009-GruberHT #automaton #empirical #regular expression
Short Regular Expressions from Finite Automata: Empirical Results (HG, MH, MT), pp. 188–197.
CIAACIAA-2009-HolubS #automaton #implementation #on the #parallel
On Parallel Implementations of Deterministic Finite Automata (JH, SS), pp. 54–64.
CIAACIAA-2009-LuY #automaton #question
Are Statecharts Finite Automata? (HL, SY), pp. 258–261.
CIAACIAA-2009-Savary #multi #named
Multiflex: A Multilingual Finite-State Tool for Multi-Word Units (AS), pp. 237–240.
CIAACIAA-2009-Seidl #automaton #program analysis
Program Analysis through Finite Tree Automata (HS), p. 3.
DLTDLT-2009-FriscoI #automaton #multi #on the
On Stateless Multihead Finite Automata and Multihead Pushdown Automata (PF, OHI), pp. 240–251.
DLTDLT-2009-Kapoutsis #automaton #complexity
Size Complexity of Two-Way Finite Automata (CAK), pp. 47–66.
ICALPICALP-v1-2009-AubrunB #decidability
Decidability of Conjugacy of Tree-Shifts of Finite Type (NA, MPB), pp. 132–143.
ICALPICALP-v2-2009-BlumensathOW #bound #higher-order #monad #word
Boundedness of Monadic Second-Order Formulae over Finite Words (AB, MO, MW), pp. 67–78.
LATALATA-2009-BoigelotD #automaton #set #visualisation
Partial Projection of Sets Represented by Finite Automata, with Application to State-Space Visualization (BB, JFD), pp. 200–211.
LATALATA-2009-HolzerK #automaton #complexity
Descriptional and Computational Complexity of Finite Automata (MH, MK), pp. 23–42.
SEFMSEFM-2009-SubramaniamGP #impact analysis #state machine #testing #using
Using Change Impact Analysis to Select Tests for Extended Finite State Machines (MS, BG, ZP), pp. 93–102.
RERE-2009-SalinesiDDMR #constraints #modelling #product line #programming
Exploiting the Versatility of Constraint Programming over Finite Domains to Integrate Product Line Models (CS, DD, OD, RM, CR), pp. 375–376.
ICSEICSE-2009-CasoBGU #abstraction #contract #using #validation
Validation of contracts using enabledness preserving finite state abstractions (GdC, VAB, DG, SU), pp. 452–462.
SACSAC-2009-BangerthJ #adaptation #problem
Adaptive finite element methods for nonlinear inverse problems (WB, AJ), pp. 1002–1006.
SACSAC-2009-Djelloul #exponential #infinity #linear
From exponential to almost linear decomposability of finite or infinite trees (KD), pp. 897–902.
SACSAC-2009-Tarau #data type #haskell #morphism
Isomorphisms, hylomorphisms and hereditarily finite data types in Haskell (PT), pp. 1898–1902.
DATEDATE-2009-KinsmanN #modulo theories #precise #using
Finite Precision bit-width allocation using SAT-Modulo Theory (ABK, NN), pp. 1106–1111.
DATEDATE-2009-NovoLBPC #precise
Finite precision processing in wireless applications (DN, ML, BB, LVdP, FC), pp. 1230–1233.
FASEFASE-2009-AndroutsopoulosCHLT #dependence #state machine
Control Dependence for Extended Finite State Machines (KA, DC, MH, ZL, LT), pp. 216–230.
CADECADE-2009-ClaessenL #automation #satisfiability
Automated Inference of Finite Unsatisfiability (KC, AL), pp. 388–403.
ICSTICST-2009-KalajiHS #generative #state machine #testing
Generating Feasible Transition Paths for Testing from an Extended Finite State Machine (EFSM) (ASK, RMH, SS), pp. 230–239.
LICSLICS-2009-KieronskiT #equivalence #first-order #logic #on the #satisfiability
On Finite Satisfiability of Two-Variable First-Order Logic with Equivalence Relations (EK, LT), pp. 123–132.
FATESTestCom-FATES-2009-El-FakihYF #fault #state machine #testing
Testing Timed Finite State Machines with Guaranteed Fault Coverage (KEF, NY, HF), pp. 66–80.
WCREWCRE-2008-AmalfitanoFT #internet #reverse engineering #state machine
Reverse Engineering Finite State Machines from Rich Internet Applications (DA, ARF, PT), pp. 69–73.
DLTDLT-J-2007-DiekertGK08 #first-order #logic #overview #word
A Survey on Small Fragments of First-Order Logic over Finite Words (VD, PG, MK), pp. 513–548.
DLTDLT-J-2007-Freivalds08 #automaton #probability
Non-Constructive Methods for Finite Probabilistic Automata (RF), pp. 565–580.
DLTDLT-J-2007-HanS08 #complexity
State Complexity of Union and Intersection of Finite Languages (YSH, KS), pp. 581–595.
DLTDLT-J-2007-JirasekJS08 #automaton #nondeterminism
Deterministic blow-UPS of Minimal Nondeterministic Finite Automata over a Fixed Alphabet (JJ, GJ, AS), pp. 617–631.
CIAACIAA-2008-AllauzenM #composition #transducer
3-Way Composition of Weighted Finite-State Transducers (CA, MM), pp. 262–273.
CIAACIAA-2008-BouajjaniHHTV #automaton #nondeterminism #testing
Antichain-Based Universality and Inclusion Testing over Nondeterministic Finite Tree Automata (AB, PH, LH, TT, TV), pp. 57–67.
CIAACIAA-2008-GarciaPAR #automaton #learning #nondeterminism #regular expression #using
Learning Regular Languages Using Nondeterministic Finite Automata (PG, MVdP, GIA, JR), pp. 92–101.
CIAACIAA-2008-HolzerK #complexity #nondeterminism
Nondeterministic Finite Automata-Recent Results on the Descriptional and Computational Complexity (MH, MK), pp. 1–16.
CIAACIAA-2008-Razet
Finite Eilenberg Machines (BR), pp. 242–251.
DLTDLT-2008-AllauzenMR #algorithm #ambiguity #automaton #testing
General Algorithms for Testing the Ambiguity of Finite Automata (CA, MM, AR), pp. 108–120.
DLTDLT-2008-BassinoGN #complexity #linear #set #word
The Average State Complexity of the Star of a Finite Set of Words Is Linear (FB, LG, CN), pp. 134–145.
DLTDLT-2008-BordihnKM #automaton #capacity #communication #on the #parallel
On the Computational Capacity of Parallel Communicating Finite Automata (HB, MK, AM), pp. 146–157.
DLTDLT-2008-GruberH #automaton #regular expression
Provably Shorter Regular Expressions from Deterministic Finite Automata (HG, MH), pp. 383–395.
DLTDLT-2008-Hirvensalo #aspect-oriented #automaton #quantum
Various Aspects of Finite Quantum Automata (MH), pp. 21–33.
DLTDLT-2008-HolubN #on the #word
On the Relation between Periodicity and Unbordered Factors of Finite Words (SH, DN), pp. 408–418.
DLTDLT-2008-JiraskovaO #automaton #complexity #on the
On the State Complexity of Operations on Two-Way Finite Automata (GJ, AO), pp. 443–454.
ICALPICALP-B-2008-BoigelotBB #automaton #multi #on the #set
On the Sets of Real Numbers Recognized by Finite Automata in Multiple Bases (BB, JB, VB), pp. 112–123.
ICALPICALP-B-2008-GruberH #automaton #regular expression
Finite Automata, Digraph Connectivity, and Regular Expression Size (HG, MH), pp. 39–50.
LATALATA-2008-AndersonRSS #automaton
Finite Automata, Palindromes, Powers, and Patterns (TA, NR, NS, JS), pp. 52–63.
LATALATA-2008-ArrighiNW #automaton #bound #quantum
One-Dimensional Quantum Cellular Automata over Finite, Unbounded Configurations (PA, VN, RFW), pp. 64–75.
LATALATA-2008-BenschBHK #automaton
Deterministic Input-Reversal and Input-Revolving Finite Automata (SB, HB, MH, MK), pp. 113–124.
LATALATA-2008-Klunder #automaton #using
Characterization of Star-Connected Languages Using Finite Automata (BK), pp. 311–320.
LATALATA-2008-Mercer #automaton #bound #quantum
Lower Bounds for Generalized Quantum Finite Automata (MM), pp. 373–384.
RTARTA-2008-EscobarMS #effectiveness
Effectively Checking the Finite Variant Property (SE, JM, RS), pp. 79–93.
RTARTA-2008-Schmidt-SchaussM #call-by #nondeterminism #simulation #λ-calculus
A Finite Simulation Method in a Non-deterministic Call-by-Need λ-Calculus with Letrec, Constructors, and Case (MSS, EM), pp. 321–335.
SEFMSEFM-2008-GuoS #impact analysis #proving #state machine #theorem proving #using
Formal Change Impact Analyses of Extended Finite State Machines Using a Theorem Prover (BG, MS), pp. 335–344.
ICPRICPR-2008-ManoharSGS #modelling
Finite element modeling of facial deformation in videos for computing strain pattern (VM, MS, DBG, SS), pp. 1–4.
KRKR-2008-HinrichsG #how #injection #logic #what
Injecting the How into the What: Investigating a Finite Classical Logic (TLH, MRG), pp. 92–192.
PPDPPPDP-2008-ChitilD #algorithm #debugging #functional #higher-order #source code
Comprehending finite maps for algorithmic debugging of higher-order functional programs (OC, TD), pp. 205–216.
PPDPPPDP-2008-FeydySS #constraints #difference
Global difference constraint propagation for finite domain solvers (TF, AS, PJS), pp. 226–235.
ASEASE-2008-WalkinshawB #constraints #modelling
Inferring Finite-State Models with Temporal Constraints (NW, KB), pp. 248–257.
DACDAC-2008-PiyachonL #automaton #design #pattern matching #performance
Design of high performance pattern matching engine through compact deterministic finite automata (PP, YL), pp. 852–857.
FoSSaCSFoSSaCS-2008-Parys #commutative #equation
Systems of Equations Satisfied in All Commutative Finite Semigroups (PP), pp. 261–272.
FoSSaCSFoSSaCS-2008-PattinsonS #algebra #logic #modelling #rank #semantics
Beyond Rank 1: Algebraic Semantics and Finite Models for Coalgebraic Logics (DP, LS), pp. 66–80.
ICLPICLP-2008-Triska #constraints #theorem proving
Generalising Constraint Solving over Finite Domains (MT), pp. 820–821.
ICSTICST-2008-El-FakihKPY #fault #state machine
Extended Finite State Machine Based Test Derivation Driven by User Defined Faults (KEF, AK, SP, NY), pp. 308–317.
LICSLICS-2008-ChadhaSV #complexity #monitoring #on the
On the Expressiveness and Complexity of Randomization in Finite State Monitors (RC, APS, MV), pp. 18–29.
TAPTAP-2008-Cao #equivalence #higher-order #π-calculus
Equivalence Checking for a Finite Higher Order π-Calculus (ZC), pp. 30–47.
FATESTestCom-FATES-2008-SimaoP #generative #sequence #state machine
Generating Checking Sequences for Partial Reduced Finite State Machines (AdSS, AP), pp. 153–168.
ICDARICDAR-2007-BeaufortM #fault #framework
A Weighted Finite-State Framework for Correcting Errors in Natural Scene OCR (RB, CMT), pp. 889–893.
ICDARICDAR-2007-KramerKKB #metadata #probability #transducer #using
Bibliographic Meta-Data Extraction Using Probabilistic Finite State Transducers (MK, HK, DK, TMB), pp. 609–613.
PODSPODS-2007-GottlobPW #bound #datalog #monad
Monadic datalog over finite structures with bounded treewidth (GG, RP, FW), pp. 165–174.
CIAACIAA-J-2006-BordihnHK07 #automaton #hybrid
Hybrid Extended Finite Automata (HB, MH, MK), pp. 745–760.
CIAACIAA-J-2006-SimunekM07 #automaton
Borders and Finite Automata (MS, BM), pp. 859–871.
CIAACIAA-2007-AllauzenRSSM #library #named #performance #transducer
OpenFst: A General and Efficient Weighted Finite-State Transducer Library (CA, MR, JS, WS, MM), pp. 11–23.
CIAACIAA-2007-BlancCW
A Finite-State Super-Chunker (OB, MC, PW), pp. 306–308.
CIAACIAA-2007-JonoskaP #2d #automaton #representation
Finite State Automata Representing Two-Dimensional Subshifts (NJ, JBP), pp. 277–289.
CIAACIAA-2007-Klunder #automaton
Finite Automata Accepting Star-Connected Languages (BK), pp. 312–313.
DLTDLT-2007-BelovsRS #automaton #multi #quantum
Multi-letter Reversible and Quantum Finite Automata (AB, AR, JS), pp. 60–71.
DLTDLT-2007-BordihnHK #automaton
Hairpin Finite Automata (HB, MH, MK), pp. 108–119.
DLTDLT-2007-Freivalds #automaton #probability
Non-constructive Methods for Finite Probabilistic Automata (RF), pp. 169–180.
DLTDLT-2007-HanS #complexity
State Complexity of Union and Intersection of Finite Languages (YSH, KS), pp. 217–228.
DLTDLT-2007-JirasekJS #automaton #nondeterminism
Deterministic Blow-Ups of Minimal Nondeterministic Finite Automata over a Fixed Alphabet (JJ, GJ, AS), pp. 254–265.
DLTDLT-2007-Priese #automaton #graph
Finite Automata on Unranked and Unordered DAGs (LP), pp. 346–360.
DLTDLT-2007-Sakarovitch #automaton
Finite Automata and the Writing of Numbers (JS), pp. 29–30.
DLTDLT-2007-Salomaa #automaton #complexity #nondeterminism
Descriptional Complexity of Nondeterministic Finite Automata (KS), pp. 31–35.
ICALPICALP-2007-CaryRS #metric
Paper Retraction: On the Hardness of Embeddings Between Two Finite Metrics (MC, AR, AS), p. 949.
LATALATA-2007-GruberH #automaton #complexity #nondeterminism
Computational Complexity of NFA Minimization for Finite and Unary Languages (HG, MH), pp. 261–272.
LATALATA-2007-Thorne #bound
Categorial Module Grammars of Bounded Size have Finite Bounded Density (CT), pp. 577–588.
CoGCIG-2007-OommenGP #bound #game studies #probability #using
Using Stochastic AI Techniques to Achieve Unbounded Resolution in Finite Player Goore Games and its Applications (BJO, OCG, AP), pp. 161–167.
HCIDHM-2007-HaoJZZ #3d #analysis
A Finite Element 3D Model of in Vivo Human Knee Joint Based on MRI for the Tibiofemoral Joint Contact Analysis (ZH, DJ, YZ, JZ), pp. 616–622.
HCIDHM-2007-HuWWJJZCZ #analysis #component
Finite Element Analysis of a Six-Component Force Sensor for the Trans-Femoral Prosthesis (XH, RW, FW, DJ, XJ, JZ, FC, SZ), pp. 633–639.
HCIDHM-2007-LeeFCBEAP #modelling #using
Finite Element Modeling to Aid in Refining the Rehabilitation of Amputees Using Osseointegrated Prostheses (WL, LF, NJC, RB, JE, CA, MJP), pp. 655–658.
HCIHCI-MIE-2007-LeePL #multi #recognition #transducer
Multi-word Expression Recognition Integrated with Two-Level Finite State Transducer (KL, KSP, YSL), pp. 124–133.
ECMFAECMDA-FA-2007-MaraeeB #diagrams #performance #reasoning #satisfiability #set #uml
Efficient Reasoning About Finite Satisfiability of UML Class Diagrams with Constrained Generalization Sets (AM, MB), pp. 17–31.
GTTSEGTTSE-2007-JuhaszSP #c++ #implementation #library #state machine
Implementation of a Finite State Machine with Active Libraries in C++ (ZJ, ÁS, ZP), pp. 474–488.
SACSAC-2007-DjelloulDF #constraints #first-order #infinity #prolog #theorem proving #towards #unification #using
Toward a first-order extension of Prolog’s unification using CHR: a CHR first-order constraint solver over finite or infinite trees (KD, TBHD, TWF), pp. 58–64.
CASECASE-2007-HablaMD #approach #capacity
A Finite Capacity Production Planning Approach for Semiconductor Manufacturing (CH, LM, RD), pp. 82–87.
SMTSMT-J-2006-KimJS #difference #integer #logic
Disequality Management in Integer Difference Logic via Finite Instantiations (HK, HJ, FS), pp. 47–66.
CSLCSL-2007-DawarR #logic #power of #strict
The Power of Counting Logics on Restricted Classes of Finite Structures (AD, DR), pp. 84–98.
LICSLICS-2007-DengGHMZ #probability #process #testing
Characterising Testing Preorders for Finite Probabilistic Processes (YD, RJvG, MH, CM, CZ), pp. 313–325.
LICSLICS-2007-Kolaitis
Reflections on Finite Model Theory (PGK), pp. 257–269.
FATESTestCom-FATES-2007-PapSKN #algorithm #bound #generative #incremental #state machine #testing
A Bounded Incremental Test Generation Algorithm for Finite State Machines (ZP, MS, GK, GÁN), pp. 244–259.
FATESTestCom-FATES-2007-ShabaldinaEY #nondeterminism #state machine #testing
Testing Nondeterministic Finite State Machines with Respect to the Separability Relation (NS, KEF, NY), pp. 305–318.
PODSPODS-2006-Rosati #database #decidability #on the #query
On the decidability and finite controllability of query processing in databases with incomplete information (RR), pp. 356–365.
ITiCSEITiCSE-2006-Bozic #algorithm #automaton #modelling
Application of finite state automata to the bakery algorithm in critical section modeling (VB), p. 362.
ITiCSEITiCSE-2006-SchreyerW #automaton #modelling #problem
Finite automata models for CS problem with binary semaphore (BS, WW), p. 330.
CIAACIAA-2006-AntoniouHIMP #automaton #using
Finding Common Motifs with Gaps Using Finite Automata (PA, JH, CSI, BM, PP), pp. 69–77.
CIAACIAA-2006-BordihnHK #automaton #hybrid
Hybrid Extended Finite Automata (HB, MH, MK), pp. 34–45.
CIAACIAA-2006-ConstantM #automaton #compilation #constraints
Compiling Linguistic Constraints into Finite State Automata (MC, DM), pp. 242–252.
CIAACIAA-2006-Fernando
Finite-State Temporal Projection (TF), pp. 230–241.
CIAACIAA-2006-GiraudVL #automaton
Path-Equivalent Removals of epsilon-transitions in a Genomic Weighted Finite Automaton (MG, PV, DL), pp. 23–33.
CIAACIAA-2006-Leung #ambiguity #automaton
Structurally Unambiguous Finite Automata (HL), pp. 198–207.
CIAACIAA-2006-RoyC #infinity #model checking
A Finite Union of DFAs in Symbolic Model Checking of Infinite Systems (SR, BC), pp. 277–278.
CIAACIAA-2006-SimunekM #automaton
Borders and Finite Automata (MS, BM), pp. 58–68.
CIAACIAA-2006-Tischler #automaton #random #refinement #video
Refinement of Near Random Access Video Coding with Weighted Finite Automata (GT), pp. 46–57.
DLTDLT-2006-DAlessandroRV #order #set
Well Quasi Orders and the Shuffle Closure of Finite Sets (FD, GR, SV), pp. 260–269.
DLTDLT-2006-DassowV #multi #string
Ciliate Bio-operations on Finite String Multisets (JD, GV), pp. 168–179.
DLTDLT-2006-Ravikumar #automaton #modelling #on the #probability
On Some Variations of Two-Way Probabilistic Finite Automata Models (BR), pp. 443–454.
DLTDLT-2006-SanteanY #ambiguity #on the #transducer
On Weakly Ambiguous Finite Transducers (NS, SY), pp. 156–167.
ICALPICALP-v1-2006-DotyLN
Finite-State Dimension and Real Arithmetic (DD, JHL, SN), pp. 537–547.
ICALPICALP-v1-2006-Kunc #algebra
Algebraic Characterization of the Finite Power Property (MK), pp. 120–131.
ICALPICALP-v2-2006-AcetoFIL #communication #equation
A Finite Equational Base for CCS with Left Merge and Communication Merge (LA, WF, AI, BL), pp. 492–503.
RTARTA-2006-Bruggink #higher-order #product line #proving #using
A Proof of Finite Family Developments for Higher-Order Rewriting Using a Prefix Property (HJSB), pp. 372–386.
KRKR-2006-Ben-Naim
Lack of Finite Characterizations for the Distance-Based Revision (JBN), pp. 239–248.
PADLPADL-2006-HawkinsS #constraints #hybrid #satisfiability #theorem proving
A Hybrid BDD and SAT Finite Domain Constraint Solver (PH, PJS), pp. 103–117.
ICSEICSE-2006-TanAC #verification
Managing space for finite-state verification (JT, GSA, LAC), pp. 152–161.
SACSAC-2006-DjelloulD #constraints #first-order #formal method #infinity
Solving first-order constraints in the theory of finite or infinite trees: introduction to the decomposable theories (KD, TBHD), pp. 7–14.
ASPLOSASPLOS-2006-Solar-LezamaTBSS #combinator #sketching #source code
Combinatorial sketching for finite programs (ASL, LT, RB, SAS, VAS), pp. 404–415.
DATEDATE-DF-2006-HabibiMT #generative #state machine
Generating finite state machines from SystemC (AH, HM, ST), pp. 76–81.
FoSSaCSFoSSaCS-2006-ChenFN #infinity #on the #simulation
On Finite Alphabets and Infinite Bases II: Completed and Ready Simulation (TC, WF, SN), pp. 1–15.
FoSSaCSFoSSaCS-2006-Schroder #algebra #logic
A Finite Model Construction for Coalgebraic Modal Logic (LS), pp. 157–171.
CAVCAV-2006-WulfDHR #algorithm #anti #automaton #named
Antichains: A New Algorithm for Checking Universality of Finite Automata (MDW, LD, TAH, JFR), pp. 17–30.
CSLCSL-2006-Aehlig #automaton #infinity #semantics
A Finite Semantics of Simply-Typed λ Terms for Infinite Runs of Automata (KA), pp. 104–118.
CSLCSL-2006-ScheweF #calculus #satisfiability #μ-calculus
Satisfiability and Finite Model Property for the Alternating-Time μ-Calculus (SS, BF), pp. 591–605.
FATESFATES-RV-2006-KrichenT #identification #problem #transducer
State-Identification Problems for Finite-State Transducers (MK, ST), pp. 148–162.
IJCARIJCAR-2006-JiaZ #morphism
A Powerful Technique to Eliminate Isomorphism in Finite Model Search (XJ, JZ), pp. 318–331.
IJCARIJCAR-2006-NivelleM #geometry #proving
Geometric Resolution: A Proof Procedure Based on Finite Model Search (HdN, JM), pp. 303–317.
IJCARIJCAR-2006-SutcliffeSCG #using
Using the TPTP Language for Writing Derivations and Finite Interpretations (GS, SS, KC, AVG), pp. 67–81.
ICTSSTestCom-2006-Ipate #bound #nondeterminism #sequence #state machine #testing
Bounded Sequence Testing from Non-deterministic Finite State Machines (FI), pp. 55–70.
ICTSSTestCom-2006-KeumKKBC #generative #state machine #testing #using #web #web service
Generating Test Cases for Web Services Using Extended Finite State Machine (CK, SK, IYK, JB, YIC), pp. 103–117.
CIAACIAA-J-2004-GeserHWZ05 #automaton #string #term rewriting #termination
Finding finite automata that certify termination of string rewriting systems (AG, DH, JW, HZ), pp. 471–486.
CIAACIAA-J-2004-KrawetzLS05 #complexity #monad #set
State complexity and the monoid of transformations of a finite set (BK, JL, JS), pp. 547–563.
CIAACIAA-2005-CampeanuPS #algorithm #automaton #incremental
An Incremental Algorithm for Constructing Minimal Deterministic Finite Cover Automata (CC, AP, JRS), pp. 90–103.
CIAACIAA-2005-CanoG #automaton #bound #constant
Finite Automata and Unions of Regular Patterns with Bounded Constant Segments (AC, PG), pp. 104–115.
CIAACIAA-2005-Freivalds #automaton #quantum
Languages Recognizable by Quantum Finite Automata (RF), pp. 1–14.
CIAACIAA-2005-HanW #automaton #regular expression
Shorter Regular Expressions from Finite-State Automata (YSH, DW), pp. 141–152.
CIAACIAA-2005-HigueraPT #automaton #learning #probability #recognition
Learning Stochastic Finite Automata for Musical Style Recognition (CdlH, FP, FT), pp. 345–346.
CIAACIAA-2005-SubramanianS #automaton #documentation #recursion #using #xml
Compressing XML Documents Using Recursive Finite State Automata (HS, PS), pp. 282–293.
CIAACIAA-2005-ZdarekM #2d #automaton #on the #pattern matching
On Two-Dimensional Pattern Matching by Finite Automata (JZ, BM), pp. 329–340.
DLTDLT-2005-BordihnHK #automaton
Revolving-Input Finite Automata (HB, MH, MK), pp. 168–179.
DLTDLT-2005-GeffertMP #automaton
Complementing Two-Way Finite Automata (VG, CM, GP), pp. 260–271.
ICALPICALP-2005-AtseriasDG
Preservation Under Extensions on Well-Behaved Finite Structures (AA, AD, MG), pp. 1437–1449.
ICALPICALP-2005-CaryRS #metric #on the
On the Hardness of Embeddings Between Two Finite Metrics (MC, AR, AS), pp. 1412–1423.
ICALPICALP-2005-CohenFIKP #automaton #graph
Label-Guided Graph Exploration by a Finite Automaton (RC, PF, DI, AK, DP), pp. 335–346.
ICALPICALP-2005-FokkinkN #semantics
A Finite Basis for Failure Semantics (WF, SN), pp. 755–765.
ICALPICALP-2005-Kayal #equation #polynomial
Solvability of a System of Bivariate Polynomial Equations over a Finite Field (NK), pp. 551–562.
FMFM-2005-BanachPJS #sequence
Retrenching the Purse: Finite Sequence Numbers, and the Tower Pattern (RB, MP, CJ, SS), pp. 382–398.
RTARTA-2005-Comon-LundhD #algebra #how
The Finite Variant Property: How to Get Rid of Some Algebraic Properties (HCL, SD), pp. 294–307.
ICMLICML-2005-SzepesvariM #bound
Finite time bounds for sampling based fitted value iteration (CS, RM), pp. 880–887.
MLDMMLDM-2005-BouguilaZ #approach #estimation
MML-Based Approach for Finite Dirichlet Mixture Estimation and Selection (NB, DZ), pp. 42–51.
MLDMMLDM-2005-ZhangZ #component #modelling
Finite Mixture Models with Negative Components (BZ, CZ), pp. 31–41.
CASECASE-2005-Hwang #approach #automation #behaviour #configuration management #generative
Generating finite-state global behavior of reconfigurable automation systems: DEVS approach (MHH), pp. 254–260.
FoSSaCSFoSSaCS-2005-DengP #axiom #behaviour #probability
Axiomatizations for Probabilistic Finite-State Behaviors (YD, CP), pp. 110–124.
STOCSTOC-2005-ChristodoulouK #game studies
The price of anarchy of finite congestion games (GC, EK), pp. 67–73.
CSLCSL-2005-MostowskiZ #modelling
Coprimality in Finite Models (MM, KZ), pp. 263–275.
LICSLICS-2005-AbdullaHM #infinity #markov #verification
Verifying Infinite Markov Chains with a Finite Attractor or the Global Coarseness Property (PAA, NBH, RM), pp. 127–136.
CIAACIAA-2004-Egri-NagyN #algebra #automaton #comparison #composition #implementation
Algebraic Hierarchical Decomposition of Finite State Automata: Comparison of Implementations for Krohn-Rhodes Theory (AEN, CLN), pp. 315–316.
CIAACIAA-2004-FerroOG #fault
Regional Finite-State Error Repair (MVF, JO, JGG), pp. 269–280.
CIAACIAA-2004-FrishertCW #automaton #regular expression
FIRE Station: An Environment for Manipulating Finite Automata and Regular Expression Views (MF, LGC, BWW), pp. 125–133.
CIAACIAA-2004-GeserHWZ #automaton #string #termination
Finding Finite Automata That Certify Termination of String Rewriting (AG, DH, JW, HZ), pp. 134–145.
CIAACIAA-2004-GiraudL #automaton #encoding #linear
Linear Encoding Scheme for Weighted Finite Automata (MG, DL), pp. 146–155.
CIAACIAA-2004-KrawetzLS #complexity #monad #set
State Complexity and the Monoid of Transformations of a Finite Set (BK, JL, JS), pp. 213–224.
CIAACIAA-2004-NishimuraY #automaton #interactive #proving #quantum
An Application of Quantum Finite Automata to Interactive Proof Systems (HN, TY), pp. 225–236.
CIAACIAA-2004-Tischler #automaton #parametricity
Parametric Weighted Finite Automata for Figure Drawing (GT), pp. 259–268.
DLTDLT-2004-KurganskyyP #2d #automaton #on the #power of
On the Computation Power of Finite Automata in Two-dimensional Environments (OK, IP), pp. 261–271.
SEFMSEFM-2004-Roy #infinity #using #verification
Symbolic Verification of Infinite Systems using a Finite Union of DFAs (SR), pp. 56–66.
ICMLICML-2004-PeltonenSK
Sequential information bottleneck for finite data (JP, JS, SK).
ICPRICPR-v1-2004-BouguilaZ #learning #modelling
A Powreful Finite Mixture Model Based on the Generalized Dirichlet Distribution: Unsupervised Learning and Applications (NB, DZ), pp. 280–283.
ICPRICPR-v2-2004-ZiouB #analysis #image #learning #using
Unsupervised Learning of a Finite Gamma Mixture Using MML: Application to SAR Image Analysis (DZ, NB), pp. 68–71.
ICPRICPR-v4-2004-ZhaiRS #detection #state machine #using
Conversation Detection in Feature Films Using Finite State Machines (YZ, ZR, MS), pp. 458–461.
KDDKDD-2004-MorinagaY #roadmap #topic #using
Tracking dynamics of topic trends using a finite mixture model (SM, KY), pp. 811–816.
LOPSTRLOPSTR-2004-SatoK
Negation Elimination for Finite PCFGs (TS, YK), pp. 117–132.
SACSAC-2004-AvinoGM #problem #reverse engineering
Applications of finite fields to dynamical systems and reverse engineering problems (MAA, ELG, OM), pp. 191–196.
DATEDATE-v2-2004-TiwariT #embedded #memory management #state machine
Saving Power by Mapping Finite-State Machines into Embedded Memory Blocks in FPGAs (AT, KAT), pp. 916–921.
ESOPESOP-2004-CarlssonB #algorithm #automaton #constraints
From Constraints to Finite Automata to Filtering Algorithms (MC, NB), pp. 94–108.
FoSSaCSFoSSaCS-2004-FokkinkN #infinity #on the
On Finite Alphabets and Infinite Bases: From Ready Pairs to Possible Worlds (WF, SN), pp. 182–194.
CSLCSL-2004-ArenasBL #game studies #locality #modelling
Game-Based Notions of Locality Over Finite Models (MA, PB, LL), pp. 175–189.
IJCARIJCAR-2004-ColtonMSM #algebra #automation #classification #generative #theorem
Automatic Generation of Classification Theorems for Finite Algebras (SC, AM, VS, RLM), pp. 400–414.
IJCARIJCAR-2004-GilHSZ #algorithm #constraints #order #performance #problem
Efficient Algorithms for Constraint Description Problems over Finite Totally Ordered Domains: Extended Abstract (ÀJG, MH, GS, BZ), pp. 244–258.
IJCARIJCAR-2004-Gottlob #higher-order #logic #research
Second-Order Logic over Finite Structures — Report on a Research Programme (GG), pp. 229–243.
LICSLICS-2004-DamsN #abstraction #branch #model checking
The Existence of Finite Abstractions for Branching Time Model Checking (DD, KSN), pp. 335–344.
CIAACIAA-2003-ChamparnaudLOZ #automaton
From Regular Weighted Expressions to Finite Automata (JMC, ÉL, FO, DZ), pp. 49–60.
CIAACIAA-2003-KellyC #state machine
Computational Linguistic Motivations for a Finite-State Machine Hierarchy (RK, JCB), pp. 301–303.
CIAACIAA-2003-KempeBGGN #compilation #named
WFSC — A New Weighted Finite State Compiler (AK, CB, TG, FG, FN), pp. 108–119.
CIAACIAA-2003-MelicharP #approach #automaton #problem #sequence
The Longest Common Subsequence Problem A Finite Automata Approach (BM, TP), pp. 294–296.
CIAACIAA-2003-NgassamWK #automaton
Preliminary Experiments in Hardcoding Finite Automata (EKN, BWW, DGK), pp. 299–300.
CIAACIAA-2003-UnoldTDT
Finite-State Molecular Computing (OU, MT, TD, AT), pp. 309–310.
CIAACIAA-2003-WallmeierHT #specification #synthesis
Symbolic Synthesis of Finite-State Controllers for Request-Response Specifications (NW, PH, WT), pp. 11–22.
DLTDLT-2003-BonizzoniFMZ #reflexive #regular expression
Regular Languages Generated by Reflexive Finite Splicing Systems (PB, CdF, GM, RZ), pp. 134–145.
DLTDLT-2003-CarmeGLTT #automaton
Residual Finite Tree Automata (JC, RG, AL, AT, MT), pp. 171–182.
DLTDLT-2003-HolzerK #automaton #monad #on the
On Deterministic Finite Automata and Syntactic Monoid Size, Continued (MH, BK), pp. 349–360.
DLTDLT-2003-Malcher #automaton
Minimizing Finite Automata Is Computationally Hard (AM), pp. 386–397.
ICALPICALP-2003-HromkovicS03a #automaton #nondeterminism
Nondeterminism versus Determinism for Two-Way Finite Automata: Generalizations of Sipser’s Separation (JH, GS), pp. 439–451.
ICALPICALP-2003-IkedaKOY #graph #random
Impact of Local Topological Information on Random Walks on Finite Graphs (SI, IK, NO, MY), pp. 1054–1067.
PPDPPPDP-2003-PaluDPR #constraints #set
Integrating finite domain constraints and CLP with sets (ADP, AD, EP, GR), pp. 219–229.
DATEDATE-2003-LeeHH #composition #design #power management #state machine
Decomposition of Extended Finite State Machine for Low Power Design (ML, TH, SYH), pp. 11152–11153.
ESOPESOP-2003-RepsSL #difference #logic #static analysis
Finite Differencing of Logical Formulas for Static Analysis (TWR, SS, AL), pp. 380–398.
CADECADE-2003-LutzST #complexity #logic #reasoning
The Complexity of Finite Model Reasoning in Description Logics (CL, US, LT), pp. 60–74.
CSLCSL-2003-GroheS #monad #query
Comparing the Succinctness of Monadic Query Languages over Finite Trees (MG, NS), pp. 226–240.
LICSLICS-2003-Rossman
Successor-Invariance in the Finite (BR), p. 148–?.
ICTSSTestCom-2003-El-FakihPYB #fault #state machine
Fault Diagnosis in Extended Finite State Machines (KEF, SP, NY, GvB), pp. 197–210.
CIAACIAA-J-2000-CampeanuPY02 #algorithm #automaton #performance
An Efficient Algorithm for Constructing Minimal Cover Automata for Finite Languages (CC, AP, SY), pp. 83–97.
CIAACIAA-2002-AnselmoGV #automaton #self
Finite Automata and Non-self-Embedding Grammars (MA, DG, SV), pp. 47–56.
CIAACIAA-2002-CampeanuP #automaton #similarity
The Number of Similarity Relations and the Number of Minimal Deterministic Finite Cover Automata (CC, AP), pp. 67–76.
CIAACIAA-2002-Daciuk #algorithm #automaton #comparison #set #string
Comparison of Construction Algorithms for Minimal, Acyclic, Deterministic, Finite-State Automata from Sets of Strings (JD), pp. 255–261.
CIAACIAA-2002-GranaAV #compilation #constraints #transducer
Compilation of Constraint-Based Contextual Rules for Part-of-Speech Tagging into Finite State Transducers (JG, GA, JV), pp. 128–137.
CIAACIAA-2002-GuingneN #lazy evaluation
Finite State Lazy Operations in NLP (FG, FN), pp. 138–147.
CIAACIAA-2002-HolzerK #automaton #complexity #nondeterminism
State Complexity of Basic Operations on Nondeterministic Finite Automata (MH, MK), pp. 148–157.
CIAACIAA-2002-Korner #automaton #on the
On Minimizing Cover Automata for Finite Languages in O(n log n) Time (HK), pp. 117–127.
DLTDLT-2002-Archangelsky #algorithm #equivalence #multi #performance
Efficient Algorithm for Checking Multiplicity Equivalence for the Finite Z-Σ*-Automata (KA), pp. 283–289.
DLTDLT-2002-Domaratzki #automaton #bound
Improved Bounds on the Number of Automata Accepting Finite Languages (MD), pp. 209–219.
DLTDLT-2002-Esik #generative #logic #monad #word
Extended Temporal Logic on Finite Words and Wreath Product of Monoids with Distinguished Generators (), pp. 43–58.
DLTDLT-2002-HolzerK02a #automaton #monad #on the
On Deterministic Finite Automata and Syntactic Monoid Size (MH, BK), pp. 258–269.
DLTDLT-2002-IbarraDS #automaton #safety #verification
Safety Verification for Two-Way Finite Automata with Monotonic Counters (OHI, ZD, ZWS), pp. 326–338.
DLTDLT-2002-Lam
Finite Completion of Comma-Free Codes. Part I (NHL), pp. 357–368.
DLTDLT-2002-Seibert #automaton #performance #regular expression
Efficient Transformations from Regular Expressions to Finite Automata (SS), pp. 28–42.
DLTDLT-2002-Svozil #automaton #concept #modelling
Finite Automata Models of Quantized Systems: Conceptual Status and Outlook (KS), pp. 93–102.
ICALPICALP-2002-Bojanczyk #automaton #modelling
Two-Way Alternating Automata and Finite Models (MB), pp. 833–844.
ICALPICALP-2002-EngebretsenHR #equation
Inapproximability Results for Equations over Finite Groups (LE, JH, AR), pp. 73–84.
ICALPICALP-2002-KarhumakiL #equivalence #problem
The Equivalence Problem of Finite Substitutions on ab*c, with Applications (JK, LPL), pp. 812–820.
SEKESEKE-2002-LeeKC #interactive #sequence chart #state machine #testing
Construction of global finite state machine for testing task interactions written in message sequence charts (NHL, THK, SDC), pp. 369–376.
PADLPADL-2002-GallagherP #abstract interpretation #analysis #automaton #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.
ASEASE-2002-OwenMC #modelling #question #what
What Makes Finite-State Models More (or Less) Testable? (DO, TM, BC), pp. 237–240.
DATEDATE-2002-GorenF #heuristic #named #reduction #state machine
CHESMIN: A Heuristic for State Reduction in Incompletely Specified Finite State Machines (SG, FJF), pp. 248–254.
DATEDATE-2002-TeichK #configuration management #implementation #self #state machine
(Self-)reconfigurable Finite State Machines: Theory and Implementation (JT, MK), pp. 559–566.
ESOPESOP-2002-Martel #approach #fault #precise #semantics
Propagation of Roundoff Errors in Finite Precision Computations: A Semantics Approach (MM), pp. 194–208.
CADECADE-2002-AudemardB #generative #reasoning #symmetry
Reasoning by Symmetry and Function Ordering in Finite Model Generation (GA, BB), pp. 226–240.
ICLPICLP-2002-Angelopoulos #overview #perspective #probability
Probabilistic Finite Domains: A Brief Overview (NA), p. 475.
ICLPICLP-2002-BoigelotW #automaton #constraints #overview #perspective #representation
Representing Arithmetic Constraints with Finite Automata: An Overview (BB, PW), pp. 1–19.
ICLPICLP-2002-FerrandL #approximate #logic programming #reduction
A Logic Program Characterization of Domain Reduction Approximations in Finite Domain CSPs (GF, AL), pp. 478–479.
ICLPICLP-2002-Thielscher #constraints #reasoning
Reasoning about Actions with CHRs and Finite Domain Constraints (MT), pp. 70–84.
ISSTAISSTA-2002-GrieskampGSV #generative #state machine
Generating finite state machines from abstract state machines (WG, YG, WS, MV), pp. 112–122.
LICSLICS-2002-Otto #theorem
Modal and Guarded Characterisation Theorems over Finite Transition Systems (MO), p. 371–?.
ICTSSTestCom-2002-SerdarT #approach #generative #sequence #state machine
A New Approach To Checking Sequence Generation for Finite State Machines (BS, KCT), p. 391–?.
CIAACIAA-2001-AlegriaAEEU #natural language #using
Using Finite State Technology in Natural Language Processing of Basque (IA, MJA, NE, AE, RU), pp. 1–12.
CIAACIAA-2001-DaciukN #automaton #modelling #representation
Finite Automata for Compact Representation of Language Models in NLP (JD, GvN), pp. 65–73.
CIAACIAA-2001-DubernardG #automaton #generative #scheduling
Scheduling Hard Sporadic Tasks by Means of Finite Automata and Generating Functions (JPD, DG), pp. 87–100.
CIAACIAA-2001-FriburgerM #transducer
Finite-State Transducer Cascade to Extract Proper Names in Texts (NF, DM), pp. 115–124.
CIAACIAA-2001-Gaal #question #transducer
Is this Finite-State Transducer Sequentiable? (TG), pp. 125–134.
CIAACIAA-2001-GranaBA #automaton #compilation #scalability
Compilation Methods of Minimal Acyclic Finite-State Automata for Large Dictionaries (JG, FMB, MAA), pp. 135–148.
CIAACIAA-2001-KatritzkeMT #automaton #clustering #image #using
Enhancements of Partitioning Techniques for Image Compression Using Weighted Finite Automata (FK, WM, MT), pp. 177–189.
CIAACIAA-2001-Kempe #transducer
Extraction of epsilon-Cyclesfrom Finite-State Transducers (AK), pp. 190–201.
CIAACIAA-2001-MelicharS #automaton #on the
On the Size of Deterministic Finite Automata (BM, JS), pp. 202–213.
CIAACIAA-2001-Savary #nearest neighbour
Typographical Nearest-Neighbor Search in a Finite-State Lexicon and Its Application to Spelling Correction (AS), pp. 251–260.
CIAACIAA-2001-Zijl01a #automaton
Supernondeterministic Finite Automata (LvZ), pp. 274–288.
ICALPICALP-2001-DaiLLM
Finite-State Dimension (JJD, JIL, JHL, EM), pp. 1028–1039.
ICALPICALP-2001-JurdzinskiK #communication #memory management
Communication Gap for Finite Memory Devices (TJ, MK), pp. 1052–1064.
ICALPICALP-2001-MuschollP #communication #protocol #sequence chart
From Finite State Communication Protocols to High-Level Message Sequence Charts (AM, DP), pp. 720–731.
ICSEICSE-2001-CobleighCO #algorithm #analysis #data flow #verification
The Right Algorithm at the Right Time: Comparing Data Flow Analysis Algorithms for Finite State Verification (JMC, LAC, LJO), pp. 37–46.
ICSEICSE-2001-DwyerHJLPRZV #abstraction #verification
Tool-Supported Program Abstraction for Finite-State Verification (MBD, JH, RJ, SL, CSP, R, HZ, WV), pp. 177–187.
DATEDATE-2001-BertoniBF #architecture #encryption #multi #performance
Efficient finite field digital-serial multiplier architecture for cryptography applications (GB, LB, PF), p. 812.
FoSSaCSFoSSaCS-2001-Bojanczyk #automaton #graph #problem
The Finite Graph Problem for Two-Way Alternating Automata (MB), pp. 88–103.
STOCSTOC-2001-Shparlinski #approximate #polynomial
Sparse polynomial approximation in finite fields (IS), pp. 209–215.
CAVCAV-2001-RodehS #equivalence #logic
Finite Instantiations in Equivalence Logic with Uninterpreted Functions (YR, OS), pp. 144–154.
CIAACIAA-2000-ChamparnaudZ #automaton #canonical
New Finite Automaton Constructions Based on Canonical Derivatives (JMC, DZ), pp. 94–104.
CIAACIAA-2000-DiehlKW #algorithm #automaton #generative #visual notation #web
Visual Exploration of Generation Algorithms for Finite Automata on the Web (SD, AK, TW), pp. 327–328.
CIAACIAA-2000-Karttunen #natural language #transducer
Applications of Finite-State Transducers in Natural Language Processing (LK), pp. 34–46.
CIAACIAA-2000-Kempe #ambiguity #transducer
Factorization of Ambiguous Finite-State Transducers (AK), pp. 170–181.
CIAACIAA-2000-PaunSY #algorithm #automaton
An O(n2) Algorithm for Constructing Minimal Cover Automata for Finite Languages (AP, NS, SY), pp. 243–251.
CIAACIAA-2000-SchmitzV #algorithm #game studies #implementation
Implementation of a Strategy Improvement Algorithm for Finite-State Parity Games (DS, JV), pp. 263–271.
CIAACIAA-2000-ShankarSAR #automaton #implementation
A Package for the Implementation of Block Codes as Finite Automata (PS, KS, VA, BSR), pp. 279–292.
CIAACIAA-2000-Wareham #automaton #complexity #composition #set
The Parameterized Complexity of Intersection and Composition Operations on Sets of Finite-State Automata (TW), pp. 302–310.
ICALPICALP-2000-BravettiG #axiom #behaviour #congruence
A Complete Axiomatization for Observational Congruence of Prioritized Finite-State Behaviors (MB, RG), pp. 744–755.
ICALPICALP-2000-BulatovKJ #algebra #constraints #problem
Constraint Satisfaction Problems and Finite Algebras (AAB, AAK, PJ), pp. 272–282.
ICALPICALP-2000-HromkovicKKSS #automaton #metric #nondeterminism
Measures of Nondeterminism in Finite Automata (JH, JK, HK, GS, SS), pp. 199–210.
ICALPICALP-2000-KarhumakiP #on the #set
On the Centralizer of a Finite Set (JK, IP), pp. 536–546.
ICALPICALP-2000-MeenakshiR #message passing #reasoning
Reasoning about Message Passing in Finite State Environments (BM, RR), pp. 487–498.
WLCWLC-2000-AlmeidaE #pseudo
Semidirect Products With the Pseudovariety of All Finite Groups (JA, APE), pp. 1–21.
WLCWLC-2000-GruskaV #automaton #quantum
Quantum Finite Automata (JG, RV), pp. 192–211.
WLCWLC-2000-Nishio #automaton
Cellular Automata with Polynomials over Finite Fields (HN), pp. 370–377.
IFMIFM-2000-BertC
Construction of Finite Labelled Transistion Systems from B Abstract Systems (DB, FC), pp. 235–254.
RTARTA-2000-TakaiKS #effectiveness #linear #term rewriting
Right-Linear Finite Path Overlapping Term Rewriting Systems Effectively Preserve Recognizability (TT, YK, HS), pp. 246–260.
ICMLICML-2000-Veeser #approach #automaton #learning
An Evolutionary Approach to Evidence-Based Learning of Deterministic Finite Automata (SV), pp. 1071–1078.
ICPRICPR-v2-2000-FigueiredoJ #estimation #modelling
Unsupervised Selection and Estimation of Finite Mixture Models (MATF, AKJ), pp. 2087–2090.
ICPRICPR-v3-2000-HongHT #gesture #performance #recognition #state machine
Constructing Finite State Machines for Fast Gesture Recognition (PH, TSH, MT), pp. 3695–3698.
KDDKDD-2000-YamanishiTWM #algorithm #detection #learning #online #using
On-line unsupervised outlier detection using finite mixtures with discounting learning algorithms (KY, JiT, GJW, PM), pp. 320–324.
KRKR-2000-GinsbergP #algorithm #quantifier #satisfiability
Satisfiability Algorithms and Finite Quantification (MLG, AJP), pp. 690–701.
ICSEICSE-2000-CorbettDHLPRZ #java #modelling #named #source code
Bandera: extracting finite-state models from Java source code (JCC, MBD, JH, SL, CSP, R, HZ), pp. 439–448.
SACSAC-2000-MortonT #3d #adaptation
A New 3D Adaptive Finite Element Scheme with l-Irregular Hexahedral Element Meshes (DM, JMT), pp. 99–104.
DACDAC-2000-HettSB #distance #state machine #traversal
Distance driven finite state machine traversal (AH, CS, BB), pp. 39–42.
PDPPDP-2000-SpyropoulosPB #clustering
Finite element computations on cluster of PCs and workstations (ANS, JAP, AGB), pp. 56–61.
ESOPESOP-2000-Muller-OlmW #on the
On the Translation of Procedures to Finite Machines (MMO, AW), pp. 290–304.
WRLAWRLA-2000-Ringeissen #rule-based
Handling Relations over Finite Domains in the Rule-Based System ELAN (CR), pp. 194–211.
CADECADE-2000-AudemardBH
Two Techniques to Improve Finite Model Search (GA, BB, LH), pp. 302–308.
ICLPCL-2000-HahnleHS #constraints #generative #proving #theorem proving
Moder Generation Theorem Proving with Finite Interval Constraints (RH, RH, YS), pp. 285–299.
ICLPCL-2000-HuiG #approach #constraints
Developing Finite Domain Constraints — A Data Model Approach (KyH, PMDG), pp. 448–462.
ICLPCL-2000-MoinardR #set
Smallest Equivalent Sets for Finite Propositional Formula Circumscription (YM, RR), pp. 897–911.
CSLCSL-2000-Laird #modelling
Finite Models and Full Completeness (JL), pp. 384–398.
ISSTAISSTA-2000-Clarke #validation #verification
Finite state verification: An emerging technology for validating software systems (LAC), p. 146.
LICSLICS-2000-LindellW #decidability #first-order
The Role of Decidability in First Order Separations over Classes of Finite Structures (SL, SW), pp. 45–50.
DLTDLT-1999-JirickaK #automaton #nondeterminism
Deterministic forgetting planar automata are more powerful than non-deterministic finite-state planar automata (PJ, JK), pp. 71–80.
DLTDLT-1999-SalomaaY #composition #on the
On the decomposition of finite languages (AS, SY), pp. 22–31.
ICALPICALP-1999-EngelfrietH #higher-order #logic #monad #transducer
Two-Way Finite State Transducers and Monadic Second-Order Logic (JE, HJH), pp. 311–320.
ICALPICALP-1999-HromkovicS #automaton #on the #power of
On the Power of Las Vegas II. Two-Way Finite Automata (JH, GS), pp. 433–442.
ICALPICALP-1999-Kirsten #monad #problem
A Connection between the Star Problem and the Finite Power Property in Trace Monoids (DK), pp. 473–482.
ICALPICALP-1999-PeichlV #automaton
Finite Automata with Generalized Acceptance Criteria (TP, HV), pp. 605–614.
CIAAWIA-1999-AmilhastreJV #heuristic
FA Minimisation Heuristics for a Class of Finite Languages (JA, PJ, MCV), pp. 1–12.
CIAAWIA-1999-BrauneDKW #animation #automaton #generative #learning
Animation of the Generation and Computation of Finite Automata for Learning Software (BB, SD, AK, RW), pp. 39–47.
CIAAWIA-1999-CampeanuCSY #complexity
State Complexity of Basic Operations on Finite Languages (CC, KCI, KS, SY), pp. 60–70.
CIAAWIA-1999-JurgensenS #automaton #encoding #geometry
Finite Automata Encoding Geometric Figures (HJ, LS), pp. 101–108.
CIAAWIA-1999-Kiraz #transducer
Compressed Storage of Sparse Finite-State Transducers (GAK), pp. 109–121.
CIAAWIA-1999-NoordG #compilation #natural language #regular expression
An Extendible Regular Expression Compiler for Finite-State Approaches in Natural Language Processing (GvN, DG), pp. 122–139.
CIAAWIA-1999-PaunT #multi #transducer
Multiset Processing by Means of Systems of Finite State Transducers (GP, GT), pp. 140–157.
CIAAWIA-1999-Trahtman #algorithm #automaton #testing #verification
An Algorithm to Verify Local Threshold Testability of Deterministic Finite Automata (ANT), pp. 164–173.
CIAAWIA-1999-Watson #algorithm #automaton #taxonomy
A Taxonomy of Algorithms for Constructing Minimal Acyclic Deterministic Finite Automata (BWW), pp. 174–182.
TLCATLCA-1999-DybjerS #axiom #recursion
A Finite Axiomatization of Inductive-Recursive Definitions (PD, AS), pp. 129–146.
HCIHCI-CCAD-1999-FujishigeJK #automaton #recognition #using #word
Recognition of Japanese sign language words using finite automata (EF, KJ, TK), pp. 167–171.
PPDPPPDP-1999-GoriL #on the #verification
On the Verification of Finite Failure (RG, GL), pp. 311–327.
PPDPPPDP-1999-Ruiz-AndinoASR #constraints #execution #modelling #parallel #programming
Parallel Execution Models for Constraint Programming over Finite Domains (ARA, LA, FS, JJR), pp. 134–151.
ICSEICSE-1999-DwyerAC #specification #verification
Patterns in Property Specifications for Finite-State Verification (MBD, GSA, JCC), pp. 411–420.
SACSAC-1999-CallahanT #implementation #parallel #platform
Parallel Implementation of a Frontal Finite Element Solver on Multiple Platforms (JDC, JMT), pp. 491–495.
SACSAC-1999-Taylor #induction #pattern matching #using
Exon/Intron Discrimination Using the Finite Induction Pattern Matching Technique (PAT), pp. 41–45.
DATEDATE-1999-HongB #analysis #reachability #scalability #state machine #using
Symbolic Reachability Analysis of Large Finite State Machines Using Don’t Cares (YH, PAB), p. 13–?.
DATEDATE-1999-Kuchcinski #constraints #graph #scheduling #using
Integrated Resource Assignment and Scheduling of Task Graphs Using Finite Domain Constraints (KK), pp. 772–773.
STOCSTOC-1999-AmanoI #automaton #quantum
Undecidability on Quantum Finite Automata (MA, KI), pp. 368–375.
TACASTACAS-1999-MontanariP #verification #π-calculus
Finite State Verification for the Asynchronous π-Calculus (UM, MP), pp. 255–269.
CAVCAV-1999-LangerakB #algebra #process
A Complete Finite Prefix for Process Algebra (RL, EB), pp. 184–195.
ICTSSIWTCS-1999-YevtushenkoCA #embedded #nondeterminism #state machine #testing
Test Suite Minimization for Embedded Nondeterministic Finite State Machines (NY, ARC, RA), pp. 237–250.
LICSLICS-1999-AtseriasK #first-order #fixpoint #logic #set
First-Order Logic vs. Fixed-Point Logic in Finite Set Theory (AA, PGK), pp. 275–284.
LICSLICS-1999-HarmerM #game studies #nondeterminism #semantics
A Fully Abstract Game Semantics for Finite Nondeterminism (RH, GM), pp. 422–430.
ICALPICALP-1998-BuchsbaumGW #automaton #on the
On the Determinization of Weighted Finite Automata (ALB, RG, JW), pp. 482–493.
ICALPICALP-1998-DurisJKL #multi #power of
Power of Cooperation and Multihead Finite Systems (PD, TJ, MK, KL), pp. 896–907.
ICALPICALP-1998-JancarKM #bisimulation #process
Deciding Bisimulation-Like Equivalences with Finite-State Processes (PJ, AK, RM), pp. 200–211.
ICALPICALP-1998-MukundKRS #protocol #robust
Robust Asynchronous Protocols Are Finite-State (MM, KNK, JR, MAS), pp. 188–199.
CIAAWIA-1998-Augros #automaton #infinity #set #word
Automata to Recognize Finite and Infinite Words with at Least Two Factorizations on a Given Finite Set (XA), pp. 220–225.
CIAAWIA-1998-CampeanuSY
Minimal Cover-Automata for Finite Languages (CC, NS, SY), pp. 43–56.
CIAAWIA-1998-HolubM #approximate #automaton #implementation #nondeterminism #pattern matching
Implementation of Nondeterministic Finite Automata for Approximate Pattern Matching (JH, BM), pp. 92–99.
CIAAWIA-1998-HuerterSWY #automaton #implementation
Implementing Reversed Alternating Finite Automaton (r-AFA) Operations (SH, KS, XW, SY), pp. 69–81.
CIAAWIA-1998-Pedrazzini #automaton #design pattern
The Finite State Automata’s Design Patterns (SP), pp. 213–219.
RTARTA-1998-OttoSM #automation #convergence #monad
Automatic Monoids Versus Monoids with Finite Convergent Presentations (FO, ASK, KM), pp. 32–46.
ICFPICFP-1998-Ennals #nondeterminism #reasoning
Controlled Temporal Non-Determinism for Reasoning with a Machine of Finite Speed (RE), p. 339.
ICMLICML-1998-Cesa-BianchiF #bound #multi #problem
Finite-Time Regret Bounds for the Multiarmed Bandit Problem (NCB, PF), pp. 100–108.
ICPRICPR-1998-HansenEL #approach #modelling #simulation
Region-of-interest based finite element modelling of the brain-an approach to brain surgery simulation (KVH, MSE, OVL), pp. 292–296.
KRKR-1998-Kusters #automaton #semantics #using
Characterizing the Semantics of Terminological Cycles in ALN Using Finite Automata (RK), pp. 499–511.
SASSAS-1998-Duggan #morphism #polymorphism #type inference #type system
Finite Subtype Inference with Explicit Polymorphism (DD), pp. 295–310.
CCCC-1998-BrouwerGP #analysis #automaton #implementation #performance
Myths and Facts about the Efficient Implementation of Finite Automata and Lexical Analysis (KB, WG, EP), pp. 1–15.
DACDAC-1998-MonteiroO #composition #power management #state machine
Finite State Machine Decomposition For Low Power (JCM, ALO), pp. 758–763.
DACDAC-1998-XieB #classification #markov #performance
Efficient State Classification of Finite State Markov Chains (AX, PAB), pp. 605–610.
TACASTACAS-1998-Grahlmann #automaton #parallel #petri net #source code #using
Combining Finite Automata, Parallel Programs and SDL Using Petri Nets (BG), pp. 102–117.
CADECADE-1998-Malik #automation #deduction #source code
Automated Deduction of Finite-State Control Programs for Reactive Systems (RM), pp. 302–316.
CAVCAV-1998-ColonU #abstraction #generative #using
Generating Finite-State Abstractions of Reactive Systems Using Decision Procedures (MC, TEU), pp. 293–304.
CAVCAV-1998-Mitchell #analysis #protocol #security
Finite-State Analysis of Security Protocols (JCM), pp. 71–76.
CSLCSL-1998-Pezzoli #complexity #game studies
Computational Complexity of Ehrenfeucht-Fraïssé Games on Finite Structures (EP), pp. 159–170.
CSLCSL-1998-YannakakisL #testing
Testing for Finite State Systems (MY, DL), pp. 29–44.
ICTSSIWTCS-1998-Boroday #nondeterminism #state machine #testing
Distinguishing Tests for Nondeterministic Finite State Machines (SB), pp. 101–108.
ICLPJICSLP-1998-DovierPRP #on the #representation #set
On the Representation and Management of Finite Sets in CLP Languages (AD, CP, GR, EP), pp. 40–54.
LICSLICS-1998-BaldwinB #embedded #modelling #order
Embedded Finite Models, Stability Theory and the Impact of Order (JTB, MB), pp. 490–500.
LICSLICS-1998-DawarHS #quantifier
Ordering Finite Variable Types with Generalized Quantifiers (AD, LH, AS), pp. 28–43.
ICALPICALP-1997-BeaudryLT
Finite Loops Recognize Exactly the Regular Open Languages (MB, FL, DT), pp. 110–120.
ICALPICALP-1997-NarendranO #confluence #decidability #problem #string #term rewriting #word
The Word Matching Problem Is Undecidable For Finite Special String-Rewriting Systems That Are Confluent (PN, FO), pp. 638–648.
CIAAWIA-1997-GarzonGRMDFS #implementation #state machine
In Vitro Implementation of Finite-State Machines (MHG, YG, JAR, RCM, RJD, DRF, SESJ), pp. 56–74.
CIAAWIA-1997-GlennG #automaton #implementation #performance
Implementing WS1S via Finite Automata: Performance Issues (JG, WIG), pp. 75–86.
CIAAWIA-1997-MohriPR #design #library #transducer
A Rational Design for a Weighted Finite-State Transducer Library (MM, FCNP, MR), pp. 144–158.
CIAAWIA-1997-Trahtman #automaton #estimation #order #precise #testing
A Precise Estimation of the Order of Local Testability of a Deterministic Finite Automaton (ANT), pp. 198–212.
RTARTA-1997-Oostrom #product line
Finite Family Developments (VvO), pp. 308–322.
TOOLSTOOLS-ASIA-1997-Zhang #development #generative #specification
Finite Model Generation and Formal Specification Development (JZ0), pp. 350–355.
AdaEuropeAdaEurope-1997-HolzmullerP #ada
Finite Unions for Ada 95 (BH, EP), pp. 1–12.
PPDPPLILP-1997-CarlssonOC #constraints #theorem proving
An Open-Ended Finite Domain Constraint Solver (MC, GO, BC), pp. 191–206.
SACSAC-1997-KhuriSC #approach #string
Randomness of finite strings: a reconstructive approach (SK, FS, TC), pp. 527–531.
SACSAC-1997-ShumskyWME #constraints #first-order #generative #heuristic
Direct finite first-order model generation with negative constraint propagation heuristic (OS, RWW, WM, FE), pp. 25–29.
DACDAC-1997-MarculescuMP #analysis #probability #sequence #state machine
Sequence Compaction for Probabilistic Analysis of Finite-State Machines (DM, RM, MP), pp. 12–15.
DATEEDTC-1997-PomeranzR97a #on the #state machine #testing
On the use of reset to increase the testability of interconnected finite-state machines (IP, SMR), pp. 554–559.
CADECADE-1997-NiehrenPR #constraints #on the #similarity #unification
On Equality Up-to Constraints over Finite Trees, Context Unification, and One-Step Rewriting (JN, MP, PR), pp. 34–48.
LICSLICS-1997-Grohe #scalability
Large Finite Structures with Few Lk-Types (MG), pp. 216–227.
LICSLICS-1997-Libkin #locality #modelling #on the
On the Forms of Locality over Finite Models (LL), pp. 204–215.
ICALPICALP-1996-ShuklaHRS #complexity #on the #problem #process #relational
On the Complexity of Relational Problems for Finite State Processes (SKS, HBHI, DJR, RES), pp. 466–477.
CIAAWIA-1996-BoneDGM #automaton
Time Series Forecasting by Finite-State Automata (RB, CD, AG, DM), pp. 26–34.
CIAAWIA-1996-GlennG #automaton #implementation
Implementing WS1S via Finite Automata (JG, WIG), pp. 50–63.
CIAAWIA-1996-Noord #automaton
FSA Utilities: A Toolbox to Manipulate Finite-State Automata (GvN), pp. 87–108.
CIAAWIA-1996-SalomaaY #automaton #nondeterminism
NFA to DFA Transformation for Finite Languages (KS, SY), pp. 149–158.
RTARTA-1996-FettigL #higher-order #unification #λ-calculus
Unification of Higher-Order patterns in a Simply Typed λ-Calculus with Finite Products and terminal Type (RF, BL), pp. 347–361.
ICPRICPR-1996-Melichar #automaton #difference #string
String matching with k differences by finite automata (BM), pp. 256–260.
KDDKDD-1996-KontkanenMT #data mining #mining #predict
Predictive Data Mining with Finite Mixtures (PK, PM, HT), pp. 176–182.
KRKR-1996-Calvanese #logic #reasoning
Finite Model Reasoning in Description Logics (DC), pp. 292–303.
SASSAS-1996-RehofM #constraints
Tractable Constraints in Finite Semilattices (JR, TÆM), pp. 285–300.
DACDAC-1996-HiguchiM #algorithm #performance #reduction #state machine
A Fast State Reduction Algorithm for Incompletely Specified Finite State Machines (HH, YM), pp. 463–466.
LICSLICS-1996-Nurmonen #order #quantifier
Counting Modulo Quantifiers on Finite Linearly Ordered Trees (JN), pp. 484–493.
LICSLICS-1996-Selinger #modelling
Order-Incompleteness and Finite λ Models (PS), pp. 432–439.
PODSPODS-1995-StoloboushkinT #effectiveness #query #syntax
Finite Queries do not Have Effective Syntax (APS, MAT), pp. 277–285.
DLTDLT-1995-Giammarresi #2d #overview
Finite State Recognizability for Two-Dimensional Languages: A Brief Survey (DG), pp. 299–308.
DLTDLT-1995-Holzer #automaton #on the
On Emptiness and Counting for Alternating Finite Automata (MH), pp. 88–97.
DLTDLT-1995-LitovskyS #infinity #word
Finite Acceptance of Infinite Words (IL, LS), pp. 360–369.
ICALPICALP-1995-BaoI #automaton
Break Finite Automata Public Key Cryptosystem (FB, YI), pp. 147–158.
ICALPICALP-1995-CulikK #image
Finite State Transformations of Images (KCI, JK), pp. 51–62.
ICALPICALP-1995-DawarHK #logic
Implicit Definability and Infinitary Logic in Finite Model Theory (AD, LH, PGK), pp. 624–635.
ICALPICALP-1995-Henzinger95a #automaton #bisimulation #hybrid
Hybrid Automata with Finite Bisimulatioins (TAH), pp. 324–335.
ICMLICML-1995-Cussens #algorithm #analysis #learning
A Bayesian Analysis of Algorithms for Learning Finite Functions (JC), pp. 142–149.
FSEFSE-1995-CheungK #analysis #composition #constraints #distributed #reachability
Compositional Reachability Analysis of Finite-State Distributed Systems with User-Specified Constraints (SCC, JK), pp. 140–150.
LCTESLCT-RTS-1995-CamposCMM #analysis #named #realtime
Verus: A Tool for Quantitative Analysis of Finite-State Real-Time Systems (SVAC, EMC, WRM, MM), pp. 70–78.
STOCSTOC-1995-KaltofenS
Subquadratic-time factoring of polynomials over finite fields (EK, VS), pp. 398–406.
TACASTACAS-1995-FrancescoFGI #approximate #model checking #process
Model Checking of Non-Finite State Processes by Finite Approximations (NDF, AF, SG, PI), pp. 195–215.
TAPSOFTTAPSOFT-1995-Potthoff #first-order #logic
First-Order Logic on Finite Trees (AP), pp. 125–139.
CAVCAV-1995-AzizBBDS #state machine
Supervisory Control of Finite State Machines (AA, FB, RKB, MDD, AS), pp. 279–292.
CAVCAV-1995-Lescow #game studies #on the #source code
On Polynomial-Size Programs Winning Finite-State Games (HL), pp. 239–252.
ICLPICLP-1995-BarthB
Finite Domain and Cutting Plane Techniques in CLP(PB) (PB, AB), pp. 133–147.
ICLPICLP-1995-CarlsonC #compilation #constraints
Compiling and Executing Disjunctions of Finite Domain Constraints (BC, MC), pp. 117–131.
LICSLICS-1995-Gottlob #quantifier
Relativized Logspace and Generalized Quantifiers over Finite Structures (GG), pp. 65–78.
LICSLICS-1995-ParedaensBG #first-order #query
First-order Queries on Finite Structures over the Reals (JP, JVdB, DVG), pp. 79–87.
SIGMODSIGMOD-1994-SwamiS
Estimating Page Fetches for Index Scans with Finite LRU Buffers (ANS, KBS), pp. 173–184.
POPLPOPL-1994-NielsonN #communication #concurrent #higher-order #source code
Higher-Order Concurrent Programs with Finite Communication Topology (HRN, FN), pp. 84–97.
SASSAS-1994-Jorgensen #analysis #fixpoint #using
Finding Fixpoints in Finite Function Spaces Using Neddedness Analysis and Chaotic Iteration (NJ), pp. 329–345.
SACSAC-1994-InsallMW
Conjugating polynomials on finite rings (MI, LM, RWW), pp. 277–280.
SACSAC-1994-MortonTBS #2d #adaptation #simulation
An adaptive finite element methodology for 2D simulation of two-phase flow through porous media (DJM, JMT, ATB, PAS), pp. 357–362.
DACDAC-1994-AzizTB #state machine
BDD Variable Ordering for Interacting Finite State Machines (AA, ST, RKB), pp. 283–288.
DACDAC-1994-HachtelMPS #analysis #probability #scalability #state machine
Probabilistic Analysis of Large Finite State Machines (GDH, EM, AP, FS), pp. 270–275.
DACDAC-1994-LamBS #state machine
Exact Minimum Cycle Times for Finite State Machines (WKCL, RKB, ALSV), pp. 100–105.
DATEEDAC-1994-Damiani #nondeterminism #state machine
Nondeterministic finite-state machines and sequential don’t cares (MD), pp. 192–198.
DATEEDAC-1994-HachtelMPS #algorithm #state machine
Symbolic Algorithms to Calculate Steady-State Probabilities of a Finite State Machine (GDH, EM, AP, FS), pp. 214–218.
HPDCHPDC-1994-Benslimane #bound #communication #state machine
Deciding Boundedness for Systems of Two Communicating Finite State Machines (AB), pp. 262–269.
STOCSTOC-1994-CondonHPW #automaton #nondeterminism #on the #power of #probability
On the power of finite automata with both nondeterministic and probabilistic states (AC, LH, SP, AW), pp. 676–685.
CADECADE-1994-Slaney #automation #reasoning
The Crisis in Finite Mathematics: Automated Reasoning as Cause and Cure (JKS), pp. 1–13.
CADECADE-1994-Slaney94a #named
FINDER: Finite Domain Enumerator — System Description (JKS), pp. 798–801.
CADECADE-1994-Zhang #generative #modelling #problem
Problems on the Generation of Finite Models (JZ0), pp. 753–757.
ICLPICLP-1994-CarlsonCD #constraints
Entailment of Finite Domain Constraints (BC, MC, DD), pp. 339–353.
ICLPICLP-1994-Gervet #constraints #named #set
Conjunto: Constraint Propagation over Set Constraints with Finite Set Domain Variables (CG), p. 733.
ICLPILPS-1994-Gervet #constraints #logic programming #named #set
Conjunto: Constraint Logic Programming with Finite Set Domains (CG), pp. 339–358.
LICSLICS-1994-Clarke #automation #concurrent #verification
Automatic Verification of Finite-State Concurrent Systems (EMC), p. 126.
LICSLICS-1994-HellaKL #how #linear #modelling #order
How to Define a Linear Order on Finite Models (LH, PGK, KL), pp. 40–49.
ICALPICALP-1993-CohenF #state machine
Products of Finite State Machines with Full Coverage (DMC, MLF), pp. 469–477.
ICALPICALP-1993-Gupta #automaton #product line
Finite Automata as Characterizations of Minor Closed Tree Families (AG), pp. 359–370.
ICALPICALP-1993-JategaonkarM #concurrent
Deciding True Concurrency Equivalences on Finite Sate Nets (LJ, ARM), pp. 519–531.
ICALPICALP-1993-Schonhage #adaptation #parallel #performance
Fast Parallel Computation of Characteristic Polynomials by Leverrier’s POwer Sum Method Adapted to Fields of Finite Characteristic (AS), pp. 410–417.
RTARTA-1993-NiehrenPT #constraints #equation
Equational and Membership Constraints for Finite Trees (JN, AP, RT), pp. 106–120.
FPCAFPCA-1993-GrantSWZ #algorithm #functional #implementation
Some Issues in a Functional Implementation of a Finite Element Algorithm (PWG, JAS, MFW, XZ), pp. 12–17.
LOPSTRLOPSTR-1993-MartensS
Some Further Issues in Finite Unfolding (BM, DDS), pp. 159–161.
PPDPPLILP-1993-CorsiniMRC #abstract interpretation #bottom-up #constraints #performance #prolog #theorem proving
Efficient Bottom-up Abstract Interpretation of Prolog by Means of Constraint Solving over Symbolic Finite Domains (MMC, KM, AR, BLC), pp. 75–91.
SACSAC-1993-LuWC #design #object-oriented #programming
Applying Object-Oriented Design to Finite Element Programming (JL, DW, WFC), pp. 424–429.
DACDAC-1993-ChengK #automation #functional #generative #state machine #testing #using
Automatic Functional Test Generation Using the Extended Finite State Machine Model (KTC, ASK), pp. 86–91.
DACDAC-1993-ChouCC #modelling #performance #simulation #using
High-Speed Interconnect Modeling and High-Accuracy Simulation Using SPICE and Finite Element Methods (TYC, JC, ZJC), pp. 684–690.
DACDAC-1993-ChuML #performance #state machine
An Efficient Critical Race-Free State Assignment Technique for Asynchronous Finite State Machines (TAC, NM, CKCL), pp. 2–6.
DACDAC-1993-RhoSP #sequence #state machine
Minimum Length Synchronizing Sequences of Finite State Machine (JKR, FS, CP), pp. 463–468.
PDPPDP-1993-PrasadW #analysis #communication
Communication vs. computation-experiences within a finite element analysis application on transputers (JCP, RW), pp. 3–10.
STOCSTOC-1993-FreundKRRSS #automaton #learning #performance #random
Efficient learning of typical finite automata from random walks (YF, MJK, DR, RR, RES, LS), pp. 315–324.
CAVCAV-1993-Krishnakumar #composition #reachability #state machine
Reachability and Recurrence in Extended Finite State Machines: Modular Vector Addition Systems (ASK), pp. 110–122.
ICLPILPS-1993-DelzannoM #bottom-up
A Bottom-Up Characterization of Finite Success (GD, MM), p. 676.
ICLPILPS-1993-DovierR #set
Embedding extensional finite sets in CLP (AD, GR), pp. 540–556.
ICTSSIWPTS-1993-LuoDBVG #distributed #generative #sequence #state machine #testing
Generating Synchronizable Test Sequences Based on Finite State Machine with Distributed Ports (GL, RD, GvB, PV, AG), pp. 139–153.
ICALPICALP-1992-IbarraT #automaton
New Results Concerning Synchronized Finite Automata (OHI, NQT), pp. 126–137.
ICALPICALP-1992-Rabinovich #concurrent
Checking Equivalences Between Concurrent Systems of Finite Agents (AMR), pp. 696–707.
LISPLFP-1992-ChuangG #approach #fixpoint
A Syntactic Approach to Fixed Point Computation on Finite Domains (TRC, BG), pp. 109–118.
KRKR-1992-Davis #infinity
Infinite Loops in Finite Time: Some Observations (ED), pp. 47–58.
TOOLSTOOLS-PACIFIC-1992-Miller #analysis #architecture #interactive
A Class Architecture for Interactive Finite Element Analysis (GRM), pp. 101–108.
SASWSA-1992-CorsiniMR #calculus #prolog #semantics #μ-calculus
The μ-Calculus over Finite Domains as an Abstract Semantics of Prolog (MMC, KM, AR), pp. 51–59.
CCCC-1992-Pettersson #automaton #compilation
A Term Pattern-Match Compiler Inspired by Finite Automata Theory (MP), pp. 258–270.
DACDAC-1992-ChakradharKA #fault tolerance #state machine #synthesis
Finite State Machine Synthesis with Fault Tolerant Test Function (STC, SK, VDA), pp. 562–567.
STOCSTOC-1992-Ben-David #detection #question
Can Finite Samples Detect Singularities of Real-Valued Functions? (SBD), pp. 390–399.
CAVCAV-1992-HiguchiSSFK #communication #invariant #state machine #verification
A Verification Procedure via Invariant for Extended Communicating Finite-State Machines (MH, OS, HS, MF, TK), pp. 384–395.
CSLCSL-1992-GradelO #induction
Inductive Definability with Counting on Finite Structures (EG, MO), pp. 231–247.
ICTSSIWPTS-1992-GhedamsiDB #fault #nondeterminism #state machine #testing
Diagnostic Tests for Single Transition Faults in Non-Deterministic Finite State Machines (AG, RD, GvB), pp. 105–116.
ICTSSIWPTS-1992-Kloosterman #nondeterminism #state machine
Test Derivation from Non-Deterministic Finite State Machines (HK), pp. 297–308.
ICTSSIWPTS-1992-TripathyN #adaptation #generative #modelling #nondeterminism #testing
Generation of Adaptive Test Cases from Nondeterministic Finite State Models (PT, KN), pp. 309–320.
ICLPJICSLP-1992-KirchnerR #algebra #algorithm #constraints #theorem proving #unification
A Constraint Solver in Finite Algebras and Its Combination with Unification Algorithms (HK, CR), pp. 225–239.
LICSLICS-1992-Stolboushkin #axiom #linear #modelling #order
Axiomatizable Classes of Finite Models and Definability of Linear Order (APS), pp. 64–70.
LICSLICS-1992-VaananenK #game studies #quantifier
Generalized Quantifiers and Pebble Games on Finite Structures (PGK, JAV), pp. 348–359.
PODSPODS-1991-ImmermanPS #product line #set
The Expressiveness of a Family of Finite Set Languages (NI, SP, DWS), pp. 37–52.
ICALPICALP-1991-AcetoH #algebra #process #refinement
Adding Action Refinement to a Finite Process Algebra (LA, MH), pp. 506–519.
ICALPICALP-1991-LagergrenA #congruence #using
Finding Minimal Forbidden Minors Using a Finite Congruence (JL, SA), pp. 532–543.
RTARTA-1991-NarendranR #canonical #commutative
Any Gound Associative-Commutative Theory Has a Finite Canonical System (PN, MR), pp. 423–434.
ICMLML-1991-MaclinS #automaton
Refining Domain Theories Expressed as Finite-State Automata (RM, JWS), pp. 524–528.
PPDPPLILP-1991-HentenryckD #constraints #logic programming #semantics
Operational Semantics of Constraint Logic Programming over Finite Domains (PVH, YD), pp. 395–406.
DACDAC-1991-EschermannW #approach #self #state machine #synthesis
A Unified Approach for the Synthesis of Self-Testable Finite State Machines (BE, HJW), pp. 372–377.
DACDAC-1991-LaddB #multi #state machine #synthesis
Synthesis of Multiple-Input Change Asynchronous Finite state Machines (ML, WPB), pp. 309–314.
TAPSOFTADC-1991-BouajjaniS #verification
Verification for Finite Systems (Extended Abstract) (AB, JS), pp. 55–57.
STOCSTOC-1991-Babai #generative #graph #random #transitive
Local Expansion of Vertex-Transitive Graphs and Random Generation in Finite Groups (LB), pp. 164–174.
STOCSTOC-1991-BuchmannS
Constructing Nonresidues in Finite Fields and the Extended Riemann Hypothesis (JAB, VS), pp. 72–79.
STOCSTOC-1991-MenezesVO
Reducing Elliptic Curve Logarithms to Logarithms in a Finite Field (AM, SAV, TO), pp. 80–89.
STOCSTOC-1991-YannakakisL #state machine #testing
Testing Finite State Machines (MY, DL), pp. 476–485.
CAVCAV-1991-MaoM #automation #equivalence #proving #state machine
An Automated Proof Technique for Finite-State Machine Equivalence (WM, GJM), pp. 233–243.
CAVCAV-1991-Rasse #communication #fault
Error Diagnosis in Finite Communicating Systems (AR), pp. 114–124.
ICLPICLP-1991-DovierOPR #logic programming #programming language #set
{log}: A Logic Programming Language with Finite Sets (AD, EGO, EP, GR), pp. 111–124.
ICTSSIWPTS-1991-DubucDB #design #incremental #modelling #named #testing
TESTL: An Environment for Incremental Test Suite Design Based on Finite-State Models (MD, RD, GvB), pp. 195–206.
PPDPALP-1990-Bundgen #term rewriting
Applying Term Rewriting Methods to Finite Groups (RB), pp. 332–346.
POPLPOPL-1990-HeintzeJ #approximate #logic programming #source code #theorem
A Finite Presentation Theorem for Approximating Logic Programs (NH, JJ), pp. 197–209.
ESOPESOP-1990-Paige #difference
Symbolic Finite Differencing — Part I (RP), pp. 36–56.
STOCSTOC-1990-HarjuK #automaton #decidability #equivalence #multi
Decidability of the Multiplicity Equivalence of Multitape Finite Automata (TH, JK), pp. 477–481.
STOCSTOC-1990-Shoup
Searching for Primitive Roots in Finite Fields (VS), pp. 546–554.
CAVCAV-1990-GrafS #composition
Compositional Minimization of Finite State Systems (SG, BS), pp. 186–196.
CAVCAV-1990-PengP #approach #communication #concurrent #detection #network #problem #state machine
A Unified Approach to the Deadlock Detection Problem in Networks of Communicating Finite State Machines (WP, SP), pp. 243–252.
LICSLICS-1990-Kolaitis #ambiguity
Implicit Definability on Finite Structures and Unambiguous Computations (PGK), pp. 168–180.
LICSLICS-1990-Moller #axiom
The Nonexistence of Finite Axiomatisations for CCS Congruences (FM), pp. 142–153.
ICALPICALP-1989-Bruyere
Completion of Finite Codes with Finite Deciphering Delay (VB), pp. 151–163.
RTARTA-1989-Otto #canonical #congruence #strict #string #term rewriting
Restrictions of Congruence Generated by Finite Canonical String-Rewriting Systems (FO), pp. 359–370.
DACDAC-1989-MeijsG #performance
An Efficient Finite Element Method for Submicron IC Capacitance Extraction (NPvdM, AJvG), pp. 678–681.
DACDAC-1989-Paulin #clustering #state machine
Horizontal Partitioning of PLA-based Finite State Machines (PGP), pp. 333–338.
DACDAC-1989-VillaS #implementation #logic #named #state machine
NOVA: State Assignment of Finite State Machines for Optimal Two-level Logic Implementations (TV, ALSV), pp. 327–332.
STOCSTOC-1989-KearnsV #automaton #encryption #learning
Cryptographic Limitations on Learning Boolean Formulae and Finite Automata (MJK, LGV), pp. 433–444.
STOCSTOC-1989-RivestS #automaton #sequence #using
Inference of Finite Automata Using Homing Sequences (RLR, RES), pp. 411–420.
ICALPICALP-1988-Eppstein #automaton #design #sequence
Reset Sequences for Finite Automata with Application to Design of Parts Orienters (DE), pp. 230–238.
ICALPICALP-1988-Tao #automaton #linear
Invertibility of Linear Finite Automata Over a Ring (RjT), pp. 489–501.
CADECADE-1988-Buttner #algebra #unification
Unification in Finite Algebras is Unitary (?) (WB), pp. 368–377.
CADECADE-1988-GallierNPRS #canonical #equation #polynomial #set #term rewriting
Finding Canonical Rewriting Systems Equivalent to a Finite Set of Ground Equations in Polynomial Time (JHG, PN, DAP, SR, WS), pp. 182–196.
CSLCSL-1988-DaneluttoM #approach #concurrent #logic
A temporal Logic Approach to Specify and to Prove Properties of Finite State Concurrent Systems (MD, AM), pp. 63–79.
LICSLICS-1988-Maher #algebra #axiom #infinity
Complete Axiomatizations of the Algebras of Finite, Rational and Infinite Trees (MJM), pp. 348–357.
VLDBVLDB-1987-Sacco
Index Access with a Finite Buffer (GMS), pp. 301–309.
ICALPICALP-1987-Johnson
Single-Valued Finite Transduction (JHJ), pp. 202–211.
ICALPICALP-1987-Pin #automaton #on the
On the Language Accepted by Finite Reversible Automata (JÉP), pp. 237–249.
RTARTA-1987-MadlenerO #string #term rewriting
Groups Presented by Certain Classes of Finite Length-Reducing String-Rewriting Systems (KM, FO), pp. 133–144.
RTARTA-1987-SquierO #canonical #monad #problem #term rewriting #word
Th Word Problem for Finitely Presented Monoids and Finite Canonical Rewriting Systems (CCS, FO), pp. 74–82.
FPCAFPCA-1987-MartinH #fixpoint
Finding fixed points in finite lattices (CM, CH), pp. 426–445.
TAPSOFTCAAP-1987-MarongiuT #algebra #data type #specification
Finite Algebraic Specifications of Semicomputable Data Types (GM, ST), pp. 111–122.
STOCSTOC-1987-BarringtonT #monad
Finite Monoids and the Fine Structure of NC¹ (DAMB, DT), pp. 101–109.
CSLCSL-1987-BohmP #combinator #reduction #set
Surjectivity for Finite Sets of Combinators by Weak Reduction (CB, AP), pp. 27–43.
CSLCSL-1987-BryM #database #deduction #proving #satisfiability
Proving Finite Satisfiability of Deductive Databases (FB, RM), pp. 44–55.
ICLPICLP-1987-OKeefe87 #fixpoint #problem
Finite Fixed-Point Problems (RAO), pp. 729–743.
PODSPODS-1986-SagivS86a #on the
On Finite FD-Acyclicity (YS, OS), pp. 173–182.
ICALPICALP-1986-Felice #graph #set
Finite Biprefix Sets of Path in a Graph (CdF), pp. 89–94.
ICALPICALP-1986-RosierY #complexity #concurrent #on the #probability #source code #termination
On The Complexity of Deciding Fair Termination of Probabilistic Concurrent Finite-State Programs (LER, HCY), pp. 334–343.
STOCSTOC-1986-AdlemanL
Finding Irreducible Polynomials over Finite Fields (LMA, HWLJ), pp. 350–355.
LICSLICS-1986-Browne #algorithm #automation #logic #using #verification
An Improved Algorithm for the Automatic Verification of Finite State Systems Using Temporal Logic (MCB), pp. 260–266.
LICSLICS-1986-Csirmaz #correctness
Program Correctness on Finite Fields (LC, BH), pp. 4–10.
ICALPICALP-1985-BakkerMO #concurrent #infinity #semantics
Infinite Streams and Finite Observations in the Semantics of Uniform Concurrency (JWdB, JJCM, ERO), pp. 149–157.
ICALPICALP-1985-Pin #for free #monad
Finite Group Topology and p-Adic Topology for Free Monoids (JÉP), pp. 445–455.
RTARTA-1985-Otto #algebra #monad
Deciding Algebraic Properties of Monoids Presented by Finite Church-Rosser Thue Systems (FO), pp. 95–106.
POPLPOPL-1985-LichtensteinP #concurrent #linear #source code #specification
Checking That Finite State Concurrent Programs Satisfy Their Linear Specification (OL, AP), pp. 97–107.
DACDAC-1985-Barke
Resistance calculation from mask artwork data by finite element method (EB), pp. 305–311.
STOCSTOC-1985-FichT #complexity #parallel
The Parallel Complexity of Exponentiating Polynomials over Finite Fields (FEF, MT), pp. 38–47.
STOCSTOC-1985-Huang
Riemann Hypothesis and Finding Roots over Finite Fields (MDAH), pp. 121–130.
ICALPICALP-1984-Girault-Beauquier #automaton #behaviour #infinity
Some Results About Finite and Infinite Behaviours of a Pushdown Automaton (DB), pp. 187–195.
ICALPICALP-1984-GoudaR #communication #state machine
Communicating Finite State Machines with Priority Channels (MGG, LER), pp. 209–221.
ICALPICALP-1984-GrafS #congruence
A Modal Characterization of Observational Congruence on Finite Terms of CCS (SG, JS), pp. 222–234.
STOCSTOC-1984-HartS #bound #logic #modelling #probability
Probabilistic Temporal Logics for Finite and Bounded Models (SH, MS), pp. 1–13.
STOCSTOC-1984-Huang #algebra
Factorization of Polynomials over Finite Fields and Factorization of Primes in Algebraic Number Fields (MDAH), pp. 175–182.
STOCSTOC-1984-Rougemont
Uniform Definability on Finite Structures with Successor (MdR), pp. 409–417.
ICALPICALP-1983-GathenK #multi #polynomial
Polynomial-Time Factorization of Multivariate Polynomials over Finite Fields (JvzG, EK), pp. 250–263.
ICALPICALP-1983-RestM #complexity #on the
On the Group Complexity of a Finite Language (EBLR, SWM), pp. 433–444.
POPLPOPL-1983-ClarkeES #approach #automation #concurrent #logic #specification #using #verification
Automatic Verification of Finite State Concurrent Systems Using Temporal Logic Specifications: A Practical Approach (EMC, EAE, APS), pp. 117–126.
STOCSTOC-1983-Lenstra #multi
Factoring Multivariate Polynomials over Finite Fields (AKL), pp. 189–192.
PODSPODS-1982-Vardi #dependence #problem
The Implication and Finite Implication Problems for Typed Template Dependencies (MYV), pp. 230–238.
ICALPICALP-1982-DurisH #automaton #multi
Multihead Finite State Automata and Concatenation (PD, JH), pp. 176–186.
DACDAC-1982-EustaceM #approach #automaton #design
A Deterministic finite automaton approach to design rule checking for VLSI (RAE, AM), pp. 712–717.
ICALPICALP-1981-Ben-AriHP #logic #modelling
Finite Models for Deterministic Propositional Dynamic Logic (MBA, JYH, AP), pp. 249–263.
ICALPICALP-1981-King #automaton #multi
Alternating Multihead Finite Automata (KNK), pp. 506–520.
ICALPICALP-1980-BergstraT #data type #equation #specification
A Characterisation of Computable Data Types by Means of a Finite Equational Specification Method (JAB, JVT), pp. 76–90.
ICALPICALP-1980-GoralcikovaGK #algebra #testing
Testing of Properties of Finite Algebras (AG, PG, VK), pp. 273–281.
ICALPICALP-1979-RozenbergV
Extending the Notion of Finite Index (GR, DV), pp. 479–488.
ICSEICSE-1979-Horejs #semantics #testing
Finite Semantics for Program Testing (JH), pp. 433–441.
DACDAC-1979-Preiss #2d #3d #consistency
A procedure for checking the topological consistency of a 2-D or 3-D finite element mesh (KP), pp. 200–206.
ICALPICALP-1978-CoppoDR #set #λ-calculus
(Semi)-separability of Finite Sets of Terms in Scott’s D∞-Models of the λ-Calculus (MC, MDC, SRDR), pp. 142–164.
STOCSTOC-1978-SakodaS #automaton #nondeterminism
Nondeterminism and the Size of Two Way Finite Automata (WJS, MS), pp. 275–286.
ICALPICALP-1977-ChytilJ #composition #source code #string #transducer
Serial Composition of 2-Way Finite-State Transducers and Simple Programs on Strings (MC, VJ), pp. 135–147.
ICALPICALP-1977-RozenbergV
L Systems of Finite Index (GR, DV), pp. 430–439.
ICALPICALP-1977-Streinu #ll
LL(k) Languages are Closed Under Union with Finite Languages (IS), pp. 504–508.
DACDAC-1976-LeeR #generative
Finite element mesh generation employing satellite graphics (SKL, WSR), pp. 1–6.
STOCSTOC-1976-Schaefer #complexity #game studies #problem
Complexity of Decision Problems Based on Finite Two-Person Perfect-Information Games (TJS), pp. 41–49.
ICALPICALP-1972-HoschL
Finite Delay Solutions for Sequential Conditions (FAH, LHL), pp. 45–60.
ICALPICALP-1972-HsiaY #automaton
Finite Automata with Markers (PH, RTY), pp. 443–451.
ICALPICALP-1972-Linna #regular expression
Finite Power Property of Regular Languages (ML), pp. 87–98.
STOCSTOC-1972-Symes
The Computation of Finite Functions (DMS), pp. 177–182.
STOCSTOC-1971-Buttelmann #automaton #generative #on the #strict
On Generalized Finite Automata and Unrestricted Generative Grammars (HWB), pp. 63–77.
STOCSTOC-1971-Rajlich #parallel #transducer
Absolutely Parallel Grammars and Two-Way Deterministic Finite-State Transducers (VR), pp. 132–137.
DACDAC-1970-RockwellP #analysis
Computer aided input/output for use with the finite element method of structural analysis (RDR, DSP), pp. 315–334.
STOCSTOC-1970-Perrot #automaton #monad #on the
On The Relationship between Finite Automata, Finite Monoids, and Prefix Codes (JFP), pp. 217–220.
STOCSTOC-1969-Thatcher #automaton
Transformations and Translations from the Point of View of Generalized Finite Automata Theory (JWT), pp. 129–142.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.