The following pages link to Acta Informatica (Q161641):
Displaying 50 items.
- Machine structure oriented control code logic (Q731332) (← links)
- Two-way pebble transducers for partial functions and their composition (Q748432) (← links)
- Gray code orders for \(q\)-ary words avoiding a given factor (Q748433) (← links)
- Deterministic ordered restarting automata for picture languages (Q748435) (← links)
- Automating the Knuth Bendix ordering (Q751830) (← links)
- The virtual feedback problem in hierarchical representations of combinational circuits (Q753507) (← links)
- The ''Hoare logic'' of concurrent programs (Q754637) (← links)
- Intersections de langages algébriques bornes (Q754651) (← links)
- Resource finding in store-and-forward networks (Q758183) (← links)
- Efficient comparison of program slices (Q758192) (← links)
- PROCOL. A concurrent object-oriented language with protocols delegation and constraints (Q758195) (← links)
- Receptive process theory (Q758200) (← links)
- Priority systems with many identical processes (Q758201) (← links)
- Opportunistic algorithms for eliminating supersets (Q758205) (← links)
- A fixed point approach to parallel discrete event simulation (Q758225) (← links)
- Choosing a storage schema (Q758865) (← links)
- Space sweep solves intersection of convex polyhedra (Q759486) (← links)
- Analysis of tree algorithms for the simulation event list (Q760216) (← links)
- A priority queue with interruptions of service permitted after a time quantum (Q760337) (← links)
- A probabilistic analysis of the height of tries and of the complexity of triesort (Q760797) (← links)
- Global storage cells for attributes in an attribute grammar (Q761046) (← links)
- Simulation output analysis for local area computer networks (Q761938) (← links)
- Ramsey numbers and an approximation algorithm for the vertex cover problem (Q762496) (← links)
- Avoidable binary patterns in partial words (Q766156) (← links)
- A characterization of rational D0L power series (Q766157) (← links)
- New bounds for the query complexity of an algorithm that learns DFAs with correction and equivalence queries (Q766158) (← links)
- Some properties of the disjunctive languages contained in \(Q\) (Q766159) (← links)
- Efficient systematic clustering method for \(k\)-anonymization (Q766161) (← links)
- Testing for refinement in \textsf{Circus} (Q766162) (← links)
- Nonatomic dual bakery algorithm with bounded tokens (Q766163) (← links)
- MAT learners for tree series: an abstract data type and two realizations (Q766165) (← links)
- One-sided random context grammars (Q766166) (← links)
- Refined typing to localize the impact of forced strictness on free theorems (Q766167) (← links)
- A Markovian queue with varying number of servers and applications to the performance comparison of HSDPA user equipment (Q766170) (← links)
- Connectivity of workflow nets: The foundations of stepwise verification (Q766173) (← links)
- Multi-letter quantum finite automata: decidability of the equivalence and minimization of states (Q766174) (← links)
- CHAP and rewrite components (Q766175) (← links)
- Finite optimal control for time-bounded reachability in CTMDPs and continuous-time Markov games (Q766176) (← links)
- Correct hardware synthesis (Q766178) (← links)
- Solving a weak NP-complete problem in polynomial time by using mutual mobile membrane systems (Q766179) (← links)
- On \(\alpha _{2} - \nu _{2}\)-products of automata (Q766182) (← links)
- The query complexity of estimating weighted averages (Q766183) (← links)
- Erratum to: ``Avoidable binary patterns in partial words'' (Q766184) (← links)
- Equational weighted tree transformations (Q766185) (← links)
- An efficient algorithm for finding ideal schedules (Q766186) (← links)
- Using transition set sequences to partition behaviors of Petri nets (Q766188) (← links)
- Is text compression by prefixes and suffixes practical? (Q786547) (← links)
- An optimality theory of concurrency control for databases (Q786557) (← links)
- Data management support for database management (Q787688) (← links)
- The temporal logic of branching time (Q789895) (← links)
