The following pages link to Acta Informatica (Q161641):
Displaying 50 items.
- A note on autodense related languages (Q977173) (← links)
- Quantum loop programs (Q977174) (← links)
- On regular temporal logics with past (Q977176) (← links)
- View selection for real conjunctive queries (Q995748) (← links)
- Dual unbounded nondeterminacy, recursion, and fixpoints (Q995749) (← links)
- Translational lemmas for DLOGTIME-uniform circuits, alternating TMs, and PRAMs (Q995752) (← links)
- A general exhaustive generation algorithm for Gray structures (Q995753) (← links)
- M-nets: a survey (Q1006339) (← links)
- Regular autodense languages (Q1006340) (← links)
- A type safe state abstraction for coordination in JAVA-like languages (Q1006341) (← links)
- Charting the completeness frontier of inference systems for multivalued dependencies (Q1006342) (← links)
- Scattered context grammars that erase nonterminals in a generalized \(k\)-limited way (Q1006344) (← links)
- On decidability of LTL model checking for process rewrite systems (Q1006890) (← links)
- Semi-synchronous transductions (Q1006891) (← links)
- Exploiting colored Petri nets to decide on permutation admissibility (Q1006895) (← links)
- A complexity tradeoff in ranking-function termination proofs (Q1006896) (← links)
- A queue based mutual exclusion algorithm (Q1006897) (← links)
- The time complexity of typechecking tree-walking tree transducers (Q1014274) (← links)
- Random walks for selected Boolean implication and equivalence problems (Q1014275) (← links)
- A theory of structural stationarity in the \(\pi\)-calculus (Q1014276) (← links)
- Hardness of equivalence checking for composed finite-state systems (Q1015390) (← links)
- On the closure of pattern expressions languages under intersection with regular languages (Q1015391) (← links)
- Liveness of a mutex algorithm in a fair process algebra (Q1015393) (← links)
- A decomposition theorem for finite persistent transition systems (Q1015394) (← links)
- Reasoning about faulty quantum programs (Q1031864) (← links)
- STG decomposition strategies in combination with unfolding (Q1031867) (← links)
- Preserving key in XML data transformation (Q1037616) (← links)
- On the power of deep pushdown stacks (Q1037618) (← links)
- On regular tree languages and deterministic pushdown automata (Q1037619) (← links)
- Extended multi bottom-up tree transducers (Q1038420) (← links)
- Strongly transitive automata and the Černý conjecture (Q1038421) (← links)
- Early action in an Earley parser (Q1038423) (← links)
- LR parsing for affix grammars (Q1050125) (← links)
- General predicate transformer and the semantics of a programming language with go to statement (Q1050764) (← links)
- On hierarchies of abstract data types (Q1050767) (← links)
- Computation sequences: A way to characterize classes of attribute grammars (Q1051438) (← links)
- A lower time bound for the knapsack problem on random access machines (Q1052091) (← links)
- Maintaining order in a generalized linked list (Q1052093) (← links)
- On the performance evaluation of extendible hashing and trie searching (Q1052098) (← links)
- Speeding up circularity tests for attribute grammars (Q1052103) (← links)
- Optimal multiway search trees for variable size keys (Q1053461) (← links)
- LALR(1,1) parser generation for regular right part grammars (Q1053465) (← links)
- Rational set of trees and the algebraic semantics of logic programming (Q1055186) (← links)
- Axiomatising finite delay operators (Q1055190) (← links)
- A characterization of systolic binary tree automata and applications (Q1055191) (← links)
- Bicentres de langages algébriques (Q1055201) (← links)
- On sets of Boolean \(n\)-vectors with all \(k\)-projections surjective (Q1055392) (← links)
- An approach to automating the verification of compact parallel coordination programs. I (Q1056221) (← links)
- NP-complete problems simplified on tree schemas (Q1056539) (← links)
- Performances of an algorithm constructing a nearly optimal binary tree (Q1056546) (← links)
