https://scifaro.com/en/abs/efficient-divide-and-conquer-implementations-of-symmetric-fsas-0708.05802010-08-06 https://scifaro.com/en/abs/decidability-of-the-equivalence-of-multi-letter-quantum-finite-automata-0812.10612010-11-01 https://scifaro.com/en/abs/weak-mso-with-the-unbounding-quantifier-0902.10422009-03-09 https://scifaro.com/en/abs/qualitative-concurrent-stochastic-games-with-imperfect-information-0902.21082011-08-31 https://scifaro.com/en/abs/ambiguity-and-communication-0902.21402009-03-02 https://scifaro.com/en/abs/b-uchi-complementation-made-tight-0902.21522009-03-02 https://scifaro.com/en/abs/pseudorandom-generators-against-advised-context-free-languages-0902.27742016-10-25 https://scifaro.com/en/abs/on-the-morse-hedlund-complexity-gap-0903.16272012-02-02 https://scifaro.com/en/abs/a-new-universal-cellular-automaton-on-the-ternary-heptagrid-0903.21082009-03-13 https://scifaro.com/en/abs/bottom-up-rewriting-for-words-and-terms-0903.25542013-08-01 https://scifaro.com/en/abs/fuzzy-chemical-abstract-machines-0903.35132009-03-23 https://scifaro.com/en/abs/the-equality-problem-for-infinite-words-generated-by-primitive-morphisms-0904.22572009-04-16 https://scifaro.com/en/abs/state-complexity-of-orthogonal-catenation-0904.33662009-04-23 https://scifaro.com/en/abs/relation-between-the-usual-order-and-the-enumeration-orders-of-elements-of-r-e-sets-0904.36072010-02-03 https://scifaro.com/en/abs/linear-space-computation-of-the-edit-distance-between-a-string-and-a-finite-automaton-0904.46862009-04-30 https://scifaro.com/en/abs/descriptional-complexity-of-bounded-context-free-languages-0905.10452009-05-08 https://scifaro.com/en/abs/deterministic-pushdown-automata-and-unary-languages-0905.12482009-05-11 https://scifaro.com/en/abs/nondeterministic-one-tape-off-line-turing-machines-and-their-time-complexity-0905.12712009-05-11 https://scifaro.com/en/abs/answers-to-questions-formulated-in-the-paper-on-states-observability-in-deterministic-finite-automata-0905.41932009-05-27 https://scifaro.com/en/abs/lexicographically-least-words-in-the-orbit-closure-of-the-rudin-shapiro-word-0905.49232010-10-06 https://scifaro.com/en/abs/the-cost-of-being-co-buchi-is-nonlinear-0906.00722009-06-07 https://scifaro.com/en/abs/2d-cellular-automata-dynamics-and-undecidability-0906.08572009-09-29 https://scifaro.com/en/abs/on-the-representation-of-finite-automata-0906.24772009-06-16 https://scifaro.com/en/abs/detecting-patterns-in-finite-regular-and-context-free-languages-0906.32202009-06-18 https://scifaro.com/en/abs/aspects-of-enumeration-and-generation-with-a-string-automata-representation-0906.38532009-06-23 https://scifaro.com/en/abs/the-computational-complexity-of-universality-problems-for-prefixes-suffixes-factors-and-subwords-of-regular-languages-0907.01592009-07-03 https://scifaro.com/en/abs/multidimensional-generalized-automatic-sequences-and-shape-symmetric-morphic-words-0907.06152009-07-06 https://scifaro.com/en/abs/a-decision-problem-for-ultimately-periodic-sets-in-non-standard-numeration-systems-0907.06202009-07-06 https://scifaro.com/en/abs/a-note-on-syndeticity-recognizable-sets-and-cobham-s-theorem-0907.06242009-07-06 https://scifaro.com/en/abs/algebraic-ordinals-0907.08772010-02-08 https://scifaro.com/en/abs/representing-real-numbers-in-a-generalized-numeration-systems-0907.09422009-07-07 https://scifaro.com/en/abs/self-assembling-systems-are-distributed-systems-0907.10722011-07-21 https://scifaro.com/en/abs/algebraic-properties-of-structured-context-free-languages-old-approaches-and-novel-developments-0907.21302009-07-14 https://scifaro.com/en/abs/wave-propagation-in-filamental-cellular-automata-0907.32462009-11-14 https://scifaro.com/en/abs/primitive-recursive-presentations-of-automata-and-their-products-0907.41692010-01-10 https://scifaro.com/en/abs/on-descriptional-complexity-of-the-planarity-problem-for-gauss-words-0907.41802009-07-27 https://scifaro.com/en/abs/algorithms-for-glushkov-k-graphs-0907.42962011-11-22 https://scifaro.com/en/abs/quotient-complexity-of-regular-languages-0907.45472009-07-28 https://scifaro.com/en/abs/the-nondeterministic-waiting-time-algorithm-a-review-0907.45542009-07-28 https://scifaro.com/en/abs/slowly-synchronizing-automata-with-zero-and-incomplete-sets-0907.45762009-07-28 https://scifaro.com/en/abs/probabilistic-automata-over-infinite-words-expressiveness-efficiency-and-decidability-0907.47602009-07-29 https://scifaro.com/en/abs/mutation-of-directed-graphs-corresponding-regular-expressions-and-complexity-of-their-generation-0907.50552009-07-30 https://scifaro.com/en/abs/testing-the-equivalence-of-regular-languages-0907.50582009-07-30 https://scifaro.com/en/abs/on-measuring-non-recursive-trade-offs-0907.50632009-07-30 https://scifaro.com/en/abs/nondeterministic-state-complexity-of-positional-addition-0907.50722009-07-30 https://scifaro.com/en/abs/serializing-the-parallelism-in-parallel-communicating-pushdown-automata-systems-0907.50832009-07-30 https://scifaro.com/en/abs/on-the-shuffle-automaton-size-for-words-0907.51112009-07-30 https://scifaro.com/en/abs/on-the-size-complexity-of-non-returning-context-free-pc-grammar-systems-0907.51192009-07-30 https://scifaro.com/en/abs/on-the-number-of-membranes-in-unary-p-systems-0907.51202009-07-30 https://scifaro.com/en/abs/on-languages-accepted-by-p-t-systems-composed-of-joins-0907.51212009-07-30 https://scifaro.com/en/abs/state-complexity-approximation-0907.51242009-07-30 https://scifaro.com/en/abs/translation-from-classical-two-way-automata-to-pebble-two-way-automata-0907.51272009-07-30 https://scifaro.com/en/abs/bounded-languages-meet-cellular-automata-with-sparse-communication-0907.51282009-07-30 https://scifaro.com/en/abs/small-universal-accepting-networks-of-evolutionary-processors-with-filtered-connections-0907.51302009-07-30 https://scifaro.com/en/abs/descriptional-complexity-of-three-nonterminal-scattered-context-grammars-an-improvement-0907.51322009-07-30 https://scifaro.com/en/abs/capacity-bounded-grammars-and-petri-nets-0907.51362009-07-30 https://scifaro.com/en/abs/proceedings-eleventh-international-workshop-on-descriptional-complexity-of-formal-systems-0907.52572010-02-23 https://scifaro.com/en/abs/localization-dynamics-in-a-binary-two-dimensional-cellular-automaton-the-diffusion-rule-0908.08282015-05-13 https://scifaro.com/en/abs/operating-binary-strings-using-gliders-and-eaters-in-reaction-diffusion-cellular-automaton-0908.08532010-11-23 https://scifaro.com/en/abs/quotient-complexity-of-ideal-languages-0908.20832009-08-17 https://scifaro.com/en/abs/exact-generation-of-acyclic-deterministic-finite-automata-0908.33152009-08-25 https://scifaro.com/en/abs/on-continuous-weighted-finite-automata-0908.37842009-08-27 https://scifaro.com/en/abs/approximating-the-minimum-length-of-synchronizing-words-is-hard-0909.37872015-05-14 https://scifaro.com/en/abs/on-carpi-and-alessandro-conjecture-0909.37902010-02-15 https://scifaro.com/en/abs/the-averaging-trick-and-the-cerny-conjecture-0910.04102010-05-11 https://scifaro.com/en/abs/mutual-mobile-membranes-with-timers-0910.12172009-10-08 https://scifaro.com/en/abs/length-of-the-shortest-word-in-the-intersection-of-regular-languages-0910.15282009-10-09 https://scifaro.com/en/abs/the-complexity-of-translation-membership-for-macro-tree-transducers-0910.23152009-10-14 https://scifaro.com/en/abs/a-unifying-approach-to-picture-grammars-0910.28292011-01-11 https://scifaro.com/en/abs/automata-and-reduced-words-in-the-free-group-0910.45552009-10-26 https://scifaro.com/en/abs/on-pebble-automata-for-data-languages-with-decidable-emptiness-problem-0910.58442015-05-14 https://scifaro.com/en/abs/entropy-sensitivity-of-languages-defined-by-infinite-automata-via-markov-chains-with-forbidden-transitions-0911.01422010-12-14 https://scifaro.com/en/abs/on-the-maximal-number-of-cubic-subwords-in-a-string-0911.13702015-05-14 https://scifaro.com/en/abs/almost-linear-b-uchi-automata-0911.20332009-11-12 https://scifaro.com/en/abs/pseudo-power-avoidance-0911.22332009-11-13 https://scifaro.com/en/abs/circular-languages-generated-by-complete-splicing-systems-and-pure-unitary-languages-0911.23202009-11-13 https://scifaro.com/en/abs/a-tighter-bound-for-the-determinization-of-visibly-pushdown-automata-0911.32752009-11-18 https://scifaro.com/en/abs/on-external-presentations-of-infinite-graphs-0911.32832009-11-18 https://scifaro.com/en/abs/a-type-system-for-a-stochastic-cls-0911.49852009-11-30 https://scifaro.com/en/abs/quotient-complexity-of-closed-languages-0912.10342015-05-14 https://scifaro.com/en/abs/adaptive-scheduling-of-data-paths-using-uppaal-tiga-0912.18972009-12-12 https://scifaro.com/en/abs/undecidability-results-for-finite-interactive-systems-1001.01432010-01-05 https://scifaro.com/en/abs/ultimate-traces-of-cellular-automata-1001.02512011-02-15 https://scifaro.com/en/abs/integer-reset-timed-automata-clock-reduction-and-determinizability-1001.12152010-01-11 https://scifaro.com/en/abs/evolving-multialgebras-unify-all-usual-sequential-computation-models-1001.21602010-03-26 https://scifaro.com/en/abs/on-equations-over-sets-of-integers-1001.29322013-10-28 https://scifaro.com/en/abs/toward-a-compositional-theory-of-leftist-grammars-and-transformations-1001.50472012-03-19 https://scifaro.com/en/abs/bulking-ii-classifications-of-cellular-automata-1001.54712010-09-27 https://scifaro.com/en/abs/enumeration-order-reducibility-1002.00632010-03-03 https://scifaro.com/en/abs/on-functionality-of-visibly-pushdown-transducers-1002.14432015-05-18 https://scifaro.com/en/abs/algebraic-linear-orderings-1002.16242010-02-10 https://scifaro.com/en/abs/on-the-minimal-uncompletable-word-problem-1002.19282010-04-26 https://scifaro.com/en/abs/a-proof-procedure-for-testing-membership-in-regular-expressions-1002.22032010-02-11 https://scifaro.com/en/abs/a-weakly-universal-cellular-automaton-in-the-hyperbolic-3d-space-with-three-states-1002.42902010-03-02 https://scifaro.com/en/abs/complete-context-calculus-design-and-implementation-in-gipsy-1002.43922010-02-24 https://scifaro.com/en/abs/digital-circuits-as-moore-machines-1003.05222026-01-16 https://scifaro.com/en/abs/zigzags-in-turing-machines-1003.05882015-05-18 https://scifaro.com/en/abs/complexity-of-problems-for-commutative-grammars-1003.41052010-03-23 https://scifaro.com/en/abs/on-building-minimal-automaton-for-subset-matching-queries-1004.09022010-10-04 https://scifaro.com/en/abs/construction-of-minimal-dfas-from-biological-motifs-1004.12982010-12-10 https://scifaro.com/en/abs/an-undecidable-property-of-context-free-languages-1004.17362010-04-13 https://scifaro.com/en/abs/about-the-embedding-of-one-dimensional-cellular-automata-into-hyperbolic-cellular-automata-1004.18302010-04-13 https://scifaro.com/en/abs/a-note-on-decidability-of-cellularity-1004.19462010-04-13 https://scifaro.com/en/abs/simulation-vs-equivalence-1004.24262015-03-14 https://scifaro.com/en/abs/the-complexity-of-codiagnosability-for-discrete-event-and-timed-systems-1004.25502010-04-16 https://scifaro.com/en/abs/fault-diagnosis-with-dynamic-observers-1004.28102010-04-19 https://scifaro.com/en/abs/computing-critical-pairs-in-2-dimensional-rewriting-systems-1004.31352010-05-02 https://scifaro.com/en/abs/the-complexity-of-finding-reset-words-in-finite-automata-1004.32462011-02-21 https://scifaro.com/en/abs/comparison-of-two-context-free-rewriting-systems-with-simple-context-checking-mechanisms-1004.36352010-04-22 https://scifaro.com/en/abs/finite-optimal-control-for-time-bounded-reachability-in-ctmdps-and-continuous-time-markov-games-1004.40052010-06-07 https://scifaro.com/en/abs/slowly-synchronizing-automata-and-digraphs-1005.01292014-11-25 https://scifaro.com/en/abs/rankers-over-infinite-words-1005.05052015-03-17 https://scifaro.com/en/abs/the-cerny-conjecture-for-one-cluster-automata-with-prime-length-cycle-1005.18352010-05-12 https://scifaro.com/en/abs/simulations-of-weighted-tree-automata-1005.20792015-05-18 https://scifaro.com/en/abs/a-note-on-ordinal-dfas-1005.23292010-05-14 https://scifaro.com/en/abs/a-new-weakly-universal-cellular-automaton-in-the-3d-hyperbolic-space-with-two-states-1005.48262010-05-27 https://scifaro.com/en/abs/symbolic-dynamics-1006.12652011-02-08 https://scifaro.com/en/abs/the-morphisms-with-unstackable-image-words-1006.12732010-06-08 https://scifaro.com/en/abs/turing-automata-and-graph-machines-1006.14282010-06-09 https://scifaro.com/en/abs/partially-ordered-two-way-b-uchi-automata-1006.27192015-05-19 https://scifaro.com/en/abs/an-upper-bound-on-the-number-of-states-for-a-strongly-universal-hyperbolic-cellular-automaton-on-the-pentagrid-1006.34512010-06-18 https://scifaro.com/en/abs/monitorability-of-omega-regular-languages-1006.36382010-06-21 https://scifaro.com/en/abs/state-complexity-of-union-and-intersection-combined-with-star-and-reversal-1006.37552010-06-21 https://scifaro.com/en/abs/parikh-s-theorem-a-simple-and-direct-automaton-construction-1006.38252012-07-03 https://scifaro.com/en/abs/abelian-primitive-words-1006.41042010-06-25 https://scifaro.com/en/abs/state-complexity-of-two-combined-operations-reversal-catenation-and-star-catenation-1006.46462010-06-25 https://scifaro.com/en/abs/dynamic-observers-for-fault-diagnosis-of-timed-systems-1006.46812010-06-25 https://scifaro.com/en/abs/quotient-complexity-of-bifix-factor-and-subword-free-regular-languages-1006.48432011-05-13 https://scifaro.com/en/abs/optimal-time-abstract-schedulers-for-ctmdps-and-markov-games-1006.51032010-06-29 https://scifaro.com/en/abs/a-saturation-method-for-the-modal-mu-calculus-with-backwards-modalities-over-pushdown-systems-1006.59062010-07-01 https://scifaro.com/en/abs/weighted-automata-and-recurrence-equations-for-regular-languages-1007.10452010-07-27 https://scifaro.com/en/abs/compositional-closure-for-bayes-risk-in-probabilistic-noninterference-1007.10542010-07-08 https://scifaro.com/en/abs/minimisation-of-deterministic-parity-and-buchi-automata-and-relative-minimisation-of-deterministic-finite-automata-1007.13332011-03-15 https://scifaro.com/en/abs/a-measure-of-state-transition-of-collective-of-stateless-automata-in-discrete-environment-1007.23532010-07-15 https://scifaro.com/en/abs/sampled-semantics-of-timed-automata-1007.27832015-07-01 https://scifaro.com/en/abs/the-roles-of-advice-to-one-tape-linear-time-turing-machines-and-finite-automata-1007.30212011-07-21 https://scifaro.com/en/abs/a-state-of-a-dynamic-computational-structure-distributed-in-an-environment-a-model-and-its-corollaries-1007.38362010-07-23 https://scifaro.com/en/abs/proceedings-twelfth-annual-workshop-on-descriptional-complexity-of-formal-systems-1008.12702010-08-10 https://scifaro.com/en/abs/free-iterative-and-iteration-k-semialgebras-1008.15072011-04-14 https://scifaro.com/en/abs/state-complexity-of-catenation-combined-with-star-and-reversal-1008.16482010-08-11 https://scifaro.com/en/abs/representing-small-ordinals-by-finite-automata-1008.16502010-08-11 https://scifaro.com/en/abs/graph-controlled-insertion-deletion-systems-1008.16512010-08-11 https://scifaro.com/en/abs/transition-complexity-of-incomplete-dfas-1008.16522010-08-11 https://scifaro.com/en/abs/the-magic-number-problem-for-subregular-language-families-1008.16532010-08-11 https://scifaro.com/en/abs/ciliate-gene-unscrambling-with-fewer-templates-1008.16542010-08-11 https://scifaro.com/en/abs/descriptional-complexity-of-the-languages-kal-automata-monoids-and-varieties-1008.16552010-08-11 https://scifaro.com/en/abs/state-elimination-ordering-strategies-some-experimental-results-1008.16562010-08-11 https://scifaro.com/en/abs/operational-state-complexity-of-deterministic-unranked-tree-automata-1008.16572010-08-11 https://scifaro.com/en/abs/transformations-between-different-types-of-unranked-bottom-up-tree-automata-1008.16582010-08-11 https://scifaro.com/en/abs/the-maximal-subword-complexity-of-quasiperiodic-infinite-words-1008.16592010-08-11 https://scifaro.com/en/abs/on-the-descriptional-complexity-of-limited-propagating-lindenmayer-systems-1008.16602010-08-11 https://scifaro.com/en/abs/nondeterministic-state-complexity-for-suffix-free-regular-languages-1008.16612010-08-11 https://scifaro.com/en/abs/complexity-in-prefix-free-regular-languages-1008.16622010-08-11 https://scifaro.com/en/abs/learning-residual-finite-state-automata-using-observation-tables-1008.16632010-08-11 https://scifaro.com/en/abs/remembering-chandra-kintala-1008.16652010-08-11 https://scifaro.com/en/abs/finite-state-complexity-and-the-size-of-transducers-1008.16672010-08-11 https://scifaro.com/en/abs/state-complexity-of-testing-divisibility-1008.16682010-08-11 https://scifaro.com/en/abs/inverse-star-borders-and-palstars-1008.24402010-09-01 https://scifaro.com/en/abs/an-individual-based-probabilistic-model-for-fish-stock-simulation-1008.33032010-08-20 https://scifaro.com/en/abs/a-non-ergodic-probabilistic-cellular-automaton-with-a-unique-invariant-measure-1009.01432011-07-11 https://scifaro.com/en/abs/minimization-strategies-for-maximally-parallel-multiset-rewriting-systems-1009.27062010-09-15 https://scifaro.com/en/abs/tree-languages-defined-in-first-order-logic-with-one-quantifier-alternation-1009.28542019-03-14 https://scifaro.com/en/abs/small-nfas-from-regular-expressions-some-experimental-results-1009.35992010-09-21 https://scifaro.com/en/abs/numerical-values-of-the-growth-rates-of-power-free-languages-1009.44152012-04-05 https://scifaro.com/en/abs/free-inductive-k-semialgebras-1009.48202011-02-24 https://scifaro.com/en/abs/canonizable-partial-order-generators-and-regular-slice-languages-1009.53412012-06-27 https://scifaro.com/en/abs/on-ternary-square-free-circular-words-1009.57592010-10-26 https://scifaro.com/en/abs/regular-expressions-au-point-1010.26042010-10-14 https://scifaro.com/en/abs/syntactic-complexity-of-ideal-and-closed-languages-1010.32632010-10-19 https://scifaro.com/en/abs/on-the-iterated-hairpin-completion-1010.36402015-03-17 https://scifaro.com/en/abs/a-short-decidability-proof-for-dpda-language-equivalence-via-first-order-grammars-1010.47602011-03-10 https://scifaro.com/en/abs/minimization-of-automata-1010.53182011-01-04 https://scifaro.com/en/abs/multi-dimensional-sets-recognizable-in-all-abstract-numeration-systems-1010.53912010-10-27 https://scifaro.com/en/abs/combinatorial-characterization-of-formal-languages-1010.54562010-10-27 https://scifaro.com/en/abs/proceedings-12th-international-workshop-on-verification-of-infinite-state-systems-1010.61122010-11-01 https://scifaro.com/en/abs/enumerating-finitary-processes-1011.00362012-12-18 https://scifaro.com/en/abs/on-selective-unboundedness-of-vass-1011.02172010-11-02 https://scifaro.com/en/abs/on-interleaving-in-p-a-time-petri-nets-with-strong-semantics-1011.02182010-11-02 https://scifaro.com/en/abs/on-zone-based-analysis-of-duration-probabilistic-automata-1011.02192010-11-02 https://scifaro.com/en/abs/a-decidable-characterization-of-a-graphical-pi-calculus-with-iterators-1011.02202010-11-02 https://scifaro.com/en/abs/implicit-real-vector-automata-1011.02212010-11-02 https://scifaro.com/en/abs/probabilistic-regular-graphs-1011.02222010-11-02 https://scifaro.com/en/abs/imitator-ii-a-tool-for-solving-the-good-parameters-problem-in-timed-automata-1011.02232010-11-02 https://scifaro.com/en/abs/on-three-alternative-characterizations-of-combined-traces-1011.10302011-10-19 https://scifaro.com/en/abs/orbits-of-linear-maps-and-regular-languages-1011.18422010-12-07 https://scifaro.com/en/abs/smooth-infinite-words-over-n-letter-alphabets-having-same-remainder-when-divided-by-n-1011.44382010-12-16 https://scifaro.com/en/abs/probabilistic-arithmetic-automata-and-their-applications-1011.57782010-11-29 https://scifaro.com/en/abs/relating-timed-and-register-automata-1011.64322019-02-20 https://scifaro.com/en/abs/an-introduction-to-finite-automata-and-their-connection-to-logic-1011.64912012-02-16 https://scifaro.com/en/abs/pumping-lemmas-for-linear-and-nonlinear-context-free-languages-1012.00232010-12-02 https://scifaro.com/en/abs/decomposition-complexity-1012.12832010-12-07 https://scifaro.com/en/abs/groups-defined-by-automata-1012.15312015-03-17 https://scifaro.com/en/abs/rational-subsets-of-groups-1012.15322010-12-08 https://scifaro.com/en/abs/a-collective-of-stateless-automata-in-a-n-dimensional-environment-as-a-distributed-dynamic-automaton-like-object-a-model-and-its-corollaries-1012.22032010-12-13 https://scifaro.com/en/abs/precedence-automata-and-languages-1012.23212011-12-01 https://scifaro.com/en/abs/bacteria-inspired-patterns-grown-with-hyperbolic-cellular-automata-1012.27712010-12-14 https://scifaro.com/en/abs/negative-bases-and-automata-1012.37212010-12-17 https://scifaro.com/en/abs/quotient-complexity-of-star-free-languages-1012.39622010-12-20 https://scifaro.com/en/abs/matrix-insertion-deletion-systems-1012.52482010-12-24 https://scifaro.com/en/abs/the-growth-function-of-s-recognizable-sets-1101.00362011-01-04 https://scifaro.com/en/abs/first-order-fragments-with-successor-over-infinite-words-1101.01152015-03-17 https://scifaro.com/en/abs/coordinates-for-a-new-triangular-tiling-of-the-hyperbolic-plane-1101.05302011-01-04 https://scifaro.com/en/abs/on-the-expressiveness-of-parikh-automata-and-related-models-1101.15472011-07-05 https://scifaro.com/en/abs/restarting-automata-with-auxiliary-symbols-and-small-lookahead-1101.16402018-07-12 https://scifaro.com/en/abs/finite-orbits-of-language-operations-1101.16672011-03-02 https://scifaro.com/en/abs/finitary-languages-1101.17272012-02-03 https://scifaro.com/en/abs/determinization-of-omega-automata-unified-1101.18412015-03-17 https://scifaro.com/en/abs/languages-of-dot-depth-one-over-infinite-words-1101.41522015-03-17 https://scifaro.com/en/abs/an-automaton-over-data-words-that-captures-emso-logic-1101.44752012-01-10 https://scifaro.com/en/abs/it-is-nl-complete-to-decide-whether-a-hairpin-completion-of-regular-languages-is-regular-1101.48242011-01-26 https://scifaro.com/en/abs/jancar-s-formal-system-for-deciding-bisimulation-of-first-order-grammars-and-its-non-soundness-1101.50462011-01-27 https://scifaro.com/en/abs/synthese-des-controleurs-optimaux-pour-les-systemes-a-evenements-discrets-1102.03712011-02-03 https://scifaro.com/en/abs/scattered-context-free-linear-orderings-1102.08502015-03-18 https://scifaro.com/en/abs/splicing-systems-and-the-chomsky-hierarchy-1102.09472011-02-07 https://scifaro.com/en/abs/efficient-analysis-of-probabilistic-programs-with-an-unbounded-counter-1102.25292011-02-15 https://scifaro.com/en/abs/isomorphism-of-regular-trees-and-words-1102.27822011-02-15 https://scifaro.com/en/abs/towards-nominal-formal-languages-1102.31742011-02-17 https://scifaro.com/en/abs/b-uchi-automata-can-have-smaller-quotients-1102.32852011-04-27 https://scifaro.com/en/abs/on-the-hairpin-incompletion-1102.35032011-11-28 https://scifaro.com/en/abs/traced-communication-complexity-of-cellular-automata-1102.35222011-02-18 https://scifaro.com/en/abs/enumeration-and-decidable-properties-of-automatic-sequences-1102.36982011-10-14 https://scifaro.com/en/abs/theory-of-atomata-1102.39012013-08-20 https://scifaro.com/en/abs/fife-s-theorem-revisited-1102.39322011-07-28 https://scifaro.com/en/abs/almost-overlap-free-words-and-the-word-problem-for-the-free-burnside-semigroup-satisfying-x-2-x-3-1102.43152011-02-22 https://scifaro.com/en/abs/regular-ideal-languages-and-their-boolean-combinations-1102.50132015-03-19 https://scifaro.com/en/abs/nondeterministic-automata-equivalence-bisimulations-and-uniform-relations-1102.54492011-03-01 https://scifaro.com/en/abs/reduction-of-fuzzy-automata-by-means-of-fuzzy-quasi-orders-1102.54512011-03-01 https://scifaro.com/en/abs/bisimulations-for-fuzzy-automata-1102.54522011-05-09 https://scifaro.com/en/abs/on-minimising-automata-with-errors-1102.56822011-03-01 https://scifaro.com/en/abs/around-dot-depth-one-1103.13532015-03-19 https://scifaro.com/en/abs/decidability-and-shortest-strings-in-formal-languages-1103.16222011-03-22 https://scifaro.com/en/abs/syntactic-complexity-of-prefix-suffix-bifix-and-factor-free-regular-languages-1103.29862011-11-21 https://scifaro.com/en/abs/on-the-capabilities-of-grammars-automata-and-transducers-controlled-by-monoids-1103.33612011-03-18 https://scifaro.com/en/abs/remarks-on-separating-words-1103.45132011-03-24 https://scifaro.com/en/abs/algorithms-for-computing-the-greatest-simulations-and-bisimulations-between-fuzzy-automata-1103.50782014-04-01 https://scifaro.com/en/abs/on-primary-and-secondary-repetitions-in-words-1103.52302011-03-29 https://scifaro.com/en/abs/context-free-ordinals-1103.54212015-03-19 https://scifaro.com/en/abs/on-non-complete-sets-and-restivo-s-conjecture-1104.03882011-04-05 https://scifaro.com/en/abs/the-critical-exponent-is-computable-for-automatic-sequences-1104.23032011-12-13 https://scifaro.com/en/abs/on-the-regularity-of-iterated-hairpin-completion-of-a-single-word-1104.23852011-04-14 https://scifaro.com/en/abs/streaming-tree-transducers-1104.25992012-02-23 https://scifaro.com/en/abs/optimal-hyper-minimization-1104.30072015-05-27 https://scifaro.com/en/abs/pushing-undecidability-of-the-isolation-problem-for-probabilistic-automata-1104.30542011-04-18 https://scifaro.com/en/abs/deciding-the-value-1-problem-of-probabilistic-leaktight-automata-1104.30552012-01-27 https://scifaro.com/en/abs/on-direct-product-and-quotient-of-strongly-connected-automata-1104.33142024-05-07 https://scifaro.com/en/abs/fife-s-theorem-for-7-3-powers-1104.35002011-08-19 https://scifaro.com/en/abs/iupc-identification-and-unification-of-process-constraints-1104.36092011-04-20 https://scifaro.com/en/abs/primitive-words-and-roots-of-words-1104.44272011-04-25 https://scifaro.com/en/abs/selected-operations-algorithms-and-applications-of-n-tape-weighted-finite-state-machines-1104.53622011-05-02 https://scifaro.com/en/abs/computational-aspects-of-asynchronous-ca-1105.00652011-05-03 https://scifaro.com/en/abs/approximating-petri-net-reachability-along-context-free-traces-1105.16572015-03-19 https://scifaro.com/en/abs/experimental-study-of-the-shortest-reset-word-of-random-automata-1105.17042015-03-19 https://scifaro.com/en/abs/pattern-avoidance-with-involution-1105.28492011-05-17 https://scifaro.com/en/abs/on-the-number-of-dejean-words-over-alphabets-of-5-6-7-8-9-and-10-letters-1105.31162011-05-17 https://scifaro.com/en/abs/on-the-finiteness-problem-for-automaton-semi-groups-1105.47252013-01-11 https://scifaro.com/en/abs/regular-realizability-problems-and-models-of-a-generalized-nondeterminism-1105.58942015-03-19 https://scifaro.com/en/abs/construction-of-fuzzy-automata-from-fuzzy-regular-expressions-1105.61902014-04-01 https://scifaro.com/en/abs/arenas-of-finite-state-machines-1106.03422011-12-13 https://scifaro.com/en/abs/a-decidable-extension-of-data-automata-1106.12352011-06-08 https://scifaro.com/en/abs/reactive-safety-1106.12402011-06-08 https://scifaro.com/en/abs/a-game-theoretic-approach-to-fault-diagnosis-of-hybrid-systems-1106.12442011-06-08 https://scifaro.com/en/abs/fixed-points-avoiding-abelian-k-powers-1106.18422011-07-05 https://scifaro.com/en/abs/quantum-finite-automata-and-probabilistic-reversible-automata-r-trivial-idempotent-languages-1106.25302011-09-07 https://scifaro.com/en/abs/shuffling-and-unshuffling-1106.57672011-07-12 https://scifaro.com/en/abs/parameterized-regular-expressions-and-their-languages-1107.05772015-03-19 https://scifaro.com/en/abs/computing-distances-between-probabilistic-automata-1107.12062011-07-07 https://scifaro.com/en/abs/decidable-problems-for-probabilistic-automata-on-infinite-words-1107.20912011-07-12 https://scifaro.com/en/abs/non-uniform-cellular-automata-classes-dynamics-and-decidability-1107.52282011-07-27 https://scifaro.com/en/abs/a-state-based-characterisation-of-the-conflict-preorder-1108.02302011-08-02 https://scifaro.com/en/abs/decoupled-execution-of-synchronous-coordination-models-via-behavioural-automata-1108.02322011-08-02 https://scifaro.com/en/abs/non-uniform-cellular-automata-and-distributions-of-rules-1108.14192011-08-09 https://scifaro.com/en/abs/deciding-regularity-of-hairpin-completions-of-regular-languages-in-polynomial-time-1108.24272011-08-12 https://scifaro.com/en/abs/absoluteness-of-subword-inequality-is-undecidable-1108.27582011-08-16 https://scifaro.com/en/abs/some-problems-in-automata-theory-which-depend-on-the-models-of-set-theory-1108.28642012-02-02 https://scifaro.com/en/abs/proceedings-8th-international-conference-words-2011-1108.34122011-08-18 https://scifaro.com/en/abs/multiscale-modelling-a-mobile-membrane-approach-1108.34342011-08-18 https://scifaro.com/en/abs/infinite-permutations-vs-infinite-words-1108.36162011-08-19 https://scifaro.com/en/abs/combinatorics-on-words-in-information-security-unavoidable-regularities-in-the-construction-of-multicollision-attacks-on-iterated-hash-functions-1108.36172011-08-19 https://scifaro.com/en/abs/circular-words-and-applications-1108.36182011-08-19 https://scifaro.com/en/abs/finite-repetition-threshold-for-infinite-ternary-words-1108.36192011-08-19 https://scifaro.com/en/abs/uniformly-balanced-words-with-linear-complexity-and-prescribed-letter-frequencies-1108.36202011-08-19 https://scifaro.com/en/abs/pattern-1-j0-i-avoiding-binary-words-1108.36212011-08-19 https://scifaro.com/en/abs/pattern-avoidability-with-involution-1108.36222011-08-19 https://scifaro.com/en/abs/monoids-and-maximal-codes-1108.36242011-08-19 https://scifaro.com/en/abs/bounded-parikh-automata-1108.36252011-08-19 https://scifaro.com/en/abs/from-regular-to-strictly-locally-testable-languages-1108.36262011-08-19 https://scifaro.com/en/abs/dynamical-generalizations-of-the-lagrange-spectrum-1108.36282011-08-19 https://scifaro.com/en/abs/a-classification-of-trapezoidal-words-1108.36292011-08-19 https://scifaro.com/en/abs/on-pansiot-words-avoiding-3-repetitions-1108.36302011-08-19 https://scifaro.com/en/abs/a-new-proof-for-the-decidability-of-d0l-ultimate-periodicity-1108.36312011-08-19 https://scifaro.com/en/abs/unambiguous-1-uniform-morphisms-1108.36332011-08-19 https://scifaro.com/en/abs/constructing-premaximal-binary-cube-free-words-of-any-level-1108.36342011-08-19 https://scifaro.com/en/abs/abelian-returns-in-sturmian-words-1108.36352011-08-19 https://scifaro.com/en/abs/systems-of-word-equations-and-polynomials-a-new-approach-1108.36372011-08-19 https://scifaro.com/en/abs/on-the-delone-property-of-beta-integers-1108.36402011-08-19 https://scifaro.com/en/abs/power-of-randomization-in-automata-on-infinite-strings-1109.25362015-07-01 https://scifaro.com/en/abs/syntactic-complexity-of-star-free-languages-1109.33812011-09-16 https://scifaro.com/en/abs/a-regularity-measure-for-context-free-grammars-1109.56152011-09-27 https://scifaro.com/en/abs/asymptotic-enumeration-of-minimal-automata-1109.56832011-09-27 https://scifaro.com/en/abs/a-decidable-characterization-of-locally-testable-tree-languages-1109.58512015-07-01 https://scifaro.com/en/abs/parameterised-pushdown-systems-with-non-atomic-writes-1109.62642011-09-29 https://scifaro.com/en/abs/iterated-hairpin-completions-of-non-crossing-words-1110.07602011-10-05 https://scifaro.com/en/abs/feasible-automata-for-two-variable-logic-with-successor-on-data-words-1110.12212015-03-19 https://scifaro.com/en/abs/two-way-automata-making-choices-only-at-the-endmarkers-1110.12632011-10-07 https://scifaro.com/en/abs/treating-insomnia-amnesia-and-acalculia-in-regular-expression-matching-1110.17162011-11-08 https://scifaro.com/en/abs/compressed-membership-for-nfa-dfa-with-compressed-labels-is-in-np-p-1110.23182013-10-28 https://scifaro.com/en/abs/automatic-sets-of-rational-numbers-1110.23822015-09-02 https://scifaro.com/en/abs/graph-reachability-and-pebble-automata-over-infinite-alphabets-1110.27762012-04-11 https://scifaro.com/en/abs/the-non-abelian-squares-are-not-context-free-1110.41362011-10-20 https://scifaro.com/en/abs/b-uchi-complementation-and-size-change-termination-1110.61832015-07-01 https://scifaro.com/en/abs/equational-theories-of-profinite-structures-1111.04762011-11-03 https://scifaro.com/en/abs/regular-functions-cost-register-automata-and-generalized-min-cost-problems-1111.06702012-02-23 https://scifaro.com/en/abs/quantitative-languages-defined-by-functional-automata-1111.08622017-01-11 https://scifaro.com/en/abs/on-context-free-languages-of-scattered-words-1111.34392015-03-19 https://scifaro.com/en/abs/star-free-languages-are-church-rosser-congruential-1111.43002012-08-28 https://scifaro.com/en/abs/reaction-automata-1111.50382011-11-29 https://scifaro.com/en/abs/independent-sets-of-words-and-the-synchronization-problem-1111.54672011-11-24 https://scifaro.com/en/abs/autonomous-push-down-automaton-built-on-dna-1111.58072011-11-28 https://scifaro.com/en/abs/unique-decodability-of-bigram-counts-by-finite-automata-1111.64312011-11-29 https://scifaro.com/en/abs/an-extension-of-parikh-s-theorem-beyond-idempotence-1112.28642013-02-06 https://scifaro.com/en/abs/a-new-approach-to-cross-bifix-free-sets-1112.31682011-12-15 https://scifaro.com/en/abs/an-alternative-interpretation-of-linguistic-variables-as-linguistic-finite-automata-1112.34352011-12-16 https://scifaro.com/en/abs/filtrations-of-formal-languages-by-arithmetic-progressions-1112.37582012-04-02 https://scifaro.com/en/abs/the-rank-and-hanna-neumann-property-of-some-submonoids-of-a-free-monoid-1112.42502013-01-29 https://scifaro.com/en/abs/a-sufficient-condition-for-hanna-neumann-property-of-submonoids-of-a-free-monoid-1112.42562013-06-12 https://scifaro.com/en/abs/on-the-complexity-of-the-equivalence-problem-for-probabilistic-automata-1112.46442012-01-09 https://scifaro.com/en/abs/deciding-whether-a-regular-language-is-generated-by-a-splicing-system-1112.48972012-08-31 https://scifaro.com/en/abs/automata-finiteness-criterion-in-terms-of-van-der-put-series-of-automata-functions-1112.50892012-05-10 https://scifaro.com/en/abs/random-context-and-semi-conditional-insertion-deletion-systems-1112.59472011-12-30 https://scifaro.com/en/abs/quotient-complexities-of-atoms-of-regular-languages-1201.02952012-03-09 https://scifaro.com/en/abs/ltl-to-b-uchi-automata-translation-fast-and-more-deterministic-1201.06822012-04-02 https://scifaro.com/en/abs/an-entertaining-example-of-using-the-concepts-of-context-free-grammar-and-pushdown-automation-1201.10952013-01-24 https://scifaro.com/en/abs/on-the-properties-of-language-classes-defined-by-bounded-reaction-automata-1201.30822012-01-17 https://scifaro.com/en/abs/a-perfect-model-for-bounded-verification-1201.31942012-08-28 https://scifaro.com/en/abs/strictness-of-the-collapsible-pushdown-hierarchy-1201.32502012-06-15 https://scifaro.com/en/abs/regular-languages-are-church-rosser-congruential-1202.11482012-02-07 https://scifaro.com/en/abs/a-family-of-weakly-universal-cellular-automata-in-the-hyperbolic-plane-with-two-states-1202.17092012-02-09 https://scifaro.com/en/abs/lattices-of-logical-fragments-over-words-1202.33552015-03-20 https://scifaro.com/en/abs/late-weak-bisimulation-for-markov-automata-1202.41162014-01-15 https://scifaro.com/en/abs/the-dissecting-power-of-regular-languages-1202.48832015-03-20 https://scifaro.com/en/abs/periodic-scheduling-of-marked-graphs-using-balanced-binary-words-1202.49122012-02-23 https://scifaro.com/en/abs/synthesis-of-succinct-systems-1202.54492012-05-07 https://scifaro.com/en/abs/the-fc-rank-of-a-context-free-language-1202.62752015-03-20 https://scifaro.com/en/abs/finitely-presented-monoids-with-linear-dehn-function-need-not-have-regular-cross-sections-1203.04732015-10-21 https://scifaro.com/en/abs/how-much-could-we-cover-a-set-by-c-e-sets-1203.08412012-03-06 https://scifaro.com/en/abs/enumeration-and-structure-of-trapezoidal-words-1203.12032013-01-22 https://scifaro.com/en/abs/tree-regular-model-checking-for-lattice-based-automata-1203.14952012-03-09 https://scifaro.com/en/abs/on-quotients-of-formal-power-series-1203.22362012-03-13 https://scifaro.com/en/abs/a-fast-algorithm-finding-the-shortest-reset-words-1203.28222014-12-15 https://scifaro.com/en/abs/syntactic-complexity-of-finite-cofinite-definite-and-reverse-definite-languages-1203.28732012-06-22 https://scifaro.com/en/abs/synchronizing-automata-on-quasi-eulerian-digraph-1203.34022012-03-16 https://scifaro.com/en/abs/recompression-a-simple-and-powerful-technique-for-word-equations-1203.37052014-03-19 https://scifaro.com/en/abs/automatic-theorem-proving-in-combinatorics-on-words-1203.37582012-03-30 https://scifaro.com/en/abs/the-state-complexity-of-star-complement-star-1203.53532012-03-27 https://scifaro.com/en/abs/interrupt-timed-automata-verification-and-expressiveness-1203.64532012-03-30 https://scifaro.com/en/abs/asynchronous-games-over-tree-architectures-1204.00772013-02-18 https://scifaro.com/en/abs/bounded-counter-languages-1204.08332014-08-07 https://scifaro.com/en/abs/the-cerny-conjecture-1204.08562015-03-13 https://scifaro.com/en/abs/a-characterization-of-bispecial-sturmian-words-1204.16722015-03-20 https://scifaro.com/en/abs/an-efficient-finite-tree-automata-library-1204.32402012-04-17 https://scifaro.com/en/abs/first-order-quantifiers-and-the-syntactic-monoid-of-height-fragments-of-picture-languages-1204.44432012-04-24 https://scifaro.com/en/abs/logic-characterization-of-floyd-languages-1204.46392012-04-23 https://scifaro.com/en/abs/the-join-levels-of-the-trotter-weil-hierarchy-are-decidable-1204.46722015-03-20 https://scifaro.com/en/abs/enumerating-regular-expressions-and-their-languages-1204.49822012-04-24 https://scifaro.com/en/abs/the-join-of-the-varieties-of-r-trivial-and-l-trivial-monoids-via-combinatorics-on-words-1204.53682015-03-20 https://scifaro.com/en/abs/implementing-turing-machines-in-dynamic-field-architectures-1204.54622012-07-19 https://scifaro.com/en/abs/numeration-systems-a-link-between-number-theory-and-formal-language-theory-1204.58872012-04-27 https://scifaro.com/en/abs/a-survey-of-multi-tape-automata-1205.01782013-12-02 https://scifaro.com/en/abs/deciding-probabilistic-automata-weak-bisimulation-in-polynomial-time-1205.03762012-07-17 https://scifaro.com/en/abs/minimizing-expected-termination-time-in-one-counter-markov-decision-processes-1205.14732012-05-08 https://scifaro.com/en/abs/derivatives-of-approximate-regular-expressions-1205.18252012-06-27 https://scifaro.com/en/abs/structured-grammars-are-effective-1205.18772012-05-10 https://scifaro.com/en/abs/p-l-aying-for-synchronization-1205.21742014-11-25 https://scifaro.com/en/abs/a-note-on-the-factorization-conjecture-1205.23102015-03-20 https://scifaro.com/en/abs/visibly-pushdown-automata-on-trees-universality-and-u-universality-1205.28412012-05-15 https://scifaro.com/en/abs/some-combinatorial-operators-in-language-theory-1205.33712012-05-16 https://scifaro.com/en/abs/cellular-automata-on-regular-rooted-trees-1205.67852012-10-01 https://scifaro.com/en/abs/bpa-bisimilarity-is-exptime-hard-1205.70412012-12-04 https://scifaro.com/en/abs/infinite-synchronizing-words-for-probabilistic-automata-erratum-1206.09952012-06-06 https://scifaro.com/en/abs/algebraic-characterization-of-the-class-of-languages-recognized-by-measure-only-quantum-automata-1206.17022012-07-17 https://scifaro.com/en/abs/deciding-word-problems-of-semigroups-using-finite-state-automata-1206.17142019-10-17 https://scifaro.com/en/abs/on-hybrid-models-of-quantum-finite-automata-1206.21312015-06-30 https://scifaro.com/en/abs/subword-complexity-and-k-synchronization-1206.53522012-09-18 https://scifaro.com/en/abs/game-characterizations-of-timed-relations-for-timed-automata-processes-1206.65652012-06-29 https://scifaro.com/en/abs/the-complexity-of-learning-principles-and-parameters-grammars-1207.00522012-07-09 https://scifaro.com/en/abs/left-recursion-in-parsing-expression-grammars-1207.04432014-02-17 https://scifaro.com/en/abs/universal-witnesses-for-state-complexity-of-basic-operations-combined-with-reversal-1207.05352012-07-04 https://scifaro.com/en/abs/universal-witnesses-for-state-complexity-of-boolean-operations-and-concatenation-combined-with-star-1207.19822012-07-10 https://scifaro.com/en/abs/on-periodically-iterated-morphisms-1207.23362012-07-11 https://scifaro.com/en/abs/the-cerny-conjecture-for-automata-respecting-intervals-of-a-directed-graph-1207.25562012-07-12 https://scifaro.com/en/abs/a-proof-of-the-pumping-lemma-for-context-free-languages-through-pushdown-automata-1207.28192013-07-09 https://scifaro.com/en/abs/infinite-ternary-square-free-words-concatenated-from-permutations-of-a-single-word-1207.34452012-07-23 https://scifaro.com/en/abs/abelian-powers-in-paper-folding-words-1207.35852013-10-04 https://scifaro.com/en/abs/on-the-relationship-between-ltl-normal-forms-and-buechi-automata-1207.38662012-07-18 https://scifaro.com/en/abs/primitive-words-and-lyndon-words-in-automatic-and-linearly-recurrent-sequences-1207.51242012-11-08 https://scifaro.com/en/abs/least-periods-of-k-automatic-sequences-1207.54502012-07-24 https://scifaro.com/en/abs/complexity-of-testing-morphic-primitivity-1207.56902013-10-04 https://scifaro.com/en/abs/off-line-test-selection-with-test-purposes-for-non-deterministic-timed-automata-1207.62672016-11-26 https://scifaro.com/en/abs/finite-automata-with-time-delay-blocks-extended-version-1207.70192012-08-14 https://scifaro.com/en/abs/on-the-existence-of-universal-finite-or-pushdown-automata-1207.71492012-08-01 https://scifaro.com/en/abs/embracing-divergence-a-formalism-for-when-your-semiring-is-simply-not-complete-with-applications-in-quantum-simulation-1208.06592012-12-06 https://scifaro.com/en/abs/the-power-of-centralized-pc-systems-of-pushdown-automata-1208.12832014-08-07 https://scifaro.com/en/abs/on-distributed-monitoring-of-asynchronous-systems-1208.21252012-08-13 https://scifaro.com/en/abs/proceedings-18th-international-workshop-on-cellular-automata-and-discrete-complex-systems-and-3rd-international-symposium-journ-ees-automates-cellulaires-1208.24982012-08-14 https://scifaro.com/en/abs/on-generating-sound-nets-with-substitution-1208.26542013-10-02 https://scifaro.com/en/abs/partially-commutative-context-free-languages-1208.27472012-08-15 https://scifaro.com/en/abs/approximating-weak-bisimilarity-of-basic-parallel-processes-1208.27512012-08-15 https://scifaro.com/en/abs/two-way-finite-automata-old-and-recent-results-1208.27552012-08-15 https://scifaro.com/en/abs/entry-times-in-automata-with-simple-defect-dynamics-1208.27572012-08-15 https://scifaro.com/en/abs/on-the-parity-problem-in-one-dimensional-cellular-automata-1208.27582012-08-15 https://scifaro.com/en/abs/local-rules-for-computable-planar-tilings-1208.27592012-09-04 https://scifaro.com/en/abs/universality-of-one-dimensional-reversible-and-number-conserving-cellular-automata-1208.27602012-08-15 https://scifaro.com/en/abs/a-simple-optimum-time-fssp-algorithm-for-multi-dimensional-cellular-automata-1208.27612012-08-15 https://scifaro.com/en/abs/computing-by-temporal-order-asynchronous-cellular-automata-1208.27622012-08-15 https://scifaro.com/en/abs/intrinsic-simulations-between-stochastic-cellular-automata-1208.27632012-08-15 https://scifaro.com/en/abs/linear-functional-classes-over-cellular-automata-1208.27642012-08-15 https://scifaro.com/en/abs/phase-space-invertible-asynchronous-cellular-automata-1208.27652012-08-15 https://scifaro.com/en/abs/topological-properties-of-cellular-automata-on-trees-1208.27662012-08-15 https://scifaro.com/en/abs/boolean-networks-synchronism-sensitivity-and-xor-circulant-networks-convergence-time-1208.27672012-08-15 https://scifaro.com/en/abs/transductions-computed-by-one-dimensional-cellular-automata-1208.27682012-08-15 https://scifaro.com/en/abs/fixed-parameter-undecidability-for-wang-tilesets-1208.27692012-08-15 https://scifaro.com/en/abs/strictly-temporally-periodic-points-in-cellular-automata-1208.27702012-08-15 https://scifaro.com/en/abs/a-universal-semi-totalistic-cellular-automaton-on-kite-and-dart-penrose-tilings-1208.27712012-08-15 https://scifaro.com/en/abs/the-chomsky-sch-utzenberger-theorem-for-quantitative-context-free-languages-1208.39422016-03-04 https://scifaro.com/en/abs/syntactic-complexity-of-r-and-j-trivial-regular-languages-1208.46502015-03-20 https://scifaro.com/en/abs/a-note-on-limited-pushdown-alphabets-in-stateless-deterministic-pushdown-automata-1208.50022012-08-27 https://scifaro.com/en/abs/piecewise-testable-tree-languages-1208.51292015-07-01 https://scifaro.com/en/abs/characterizing-weighted-mso-for-trees-by-branching-transitive-closure-logics-1208.53172015-04-30 https://scifaro.com/en/abs/forward-and-backward-application-of-symbolic-tree-transducers-1208.53242012-08-28 https://scifaro.com/en/abs/on-sets-of-numbers-rationally-represented-in-a-rational-base-number-system-1208.54122013-10-04 https://scifaro.com/en/abs/in-the-maze-of-data-languages-1208.59802012-08-30 https://scifaro.com/en/abs/the-finiteness-of-a-group-generated-by-a-2-letter-invertible-reversible-mealy-automaton-is-decidable-1208.63242013-10-23 https://scifaro.com/en/abs/is-wolfram-and-cook-s-2-5-turing-machine-really-universal-1208.63422012-09-03 https://scifaro.com/en/abs/degrees-of-lookahead-in-regular-infinite-games-1209.08002015-07-01 https://scifaro.com/en/abs/completely-reducible-sets-1209.20352016-11-22 https://scifaro.com/en/abs/conformance-verification-of-normative-specifications-using-c-o-diagrams-1209.22372012-09-12 https://scifaro.com/en/abs/binary-equality-sets-are-generated-by-two-words-1209.40612012-09-19 https://scifaro.com/en/abs/runtime-verification-based-on-register-automata-1209.53252015-01-21 https://scifaro.com/en/abs/automatic-unbounded-verification-of-alloy-specifications-with-prover9-1209.57732012-09-27 https://scifaro.com/en/abs/abelian-repetitions-in-sturmian-words-1209.60132013-05-10 https://scifaro.com/en/abs/a-two-step-perspective-for-kripke-structure-reduction-1210.04082012-10-02 https://scifaro.com/en/abs/bisimilarity-of-probabilistic-pushdown-automata-1210.22732012-10-09 https://scifaro.com/en/abs/ostrowski-numeration-and-the-local-period-of-sturmian-words-1210.23432012-10-09 https://scifaro.com/en/abs/modelling-implicit-communication-in-multi-agent-systems-with-hybrid-input-output-automata-1210.24482012-10-10 https://scifaro.com/en/abs/learn-with-sat-to-minimize-b-uchi-automata-1210.24522012-10-10 https://scifaro.com/en/abs/symbolic-representation-of-algorithmic-game-semantics-1210.24542012-10-10 https://scifaro.com/en/abs/deciding-kat-and-hoare-logic-with-derivatives-1210.24562012-10-10 https://scifaro.com/en/abs/higher-order-pushdown-systems-with-data-1210.24602012-10-10 https://scifaro.com/en/abs/a-myhill-nerode-theorem-for-automata-with-advice-1210.24622012-10-10 https://scifaro.com/en/abs/unambiguous-tree-languages-are-topologically-harder-than-deterministic-ones-1210.24632012-10-10 https://scifaro.com/en/abs/starting-a-dialog-between-model-checking-and-fault-tolerant-distributed-algorithms-1210.38392012-10-16 https://scifaro.com/en/abs/from-regexes-to-parsing-expression-grammars-1210.49922014-02-17 https://scifaro.com/en/abs/advanced-automata-minimization-1210.66242012-10-25 https://scifaro.com/en/abs/bisimilarity-of-pushdown-systems-is-nonelementary-1210.76862012-10-31 https://scifaro.com/en/abs/non-redundant-random-generation-algorithms-for-weighted-context-free-languages-1211.03032012-11-05 https://scifaro.com/en/abs/on-the-number-of-unbordered-factors-1211.13012012-11-07 https://scifaro.com/en/abs/combining-insertion-and-deletion-in-rna-editing-preserves-regularity-1211.40922012-11-20 https://scifaro.com/en/abs/repetition-avoidance-in-circular-factors-1212.00522013-03-19 https://scifaro.com/en/abs/converting-nondeterministic-automata-and-context-free-grammars-into-parikh-equivalent-one-way-and-two-way-deterministic-automata-1212.13462012-12-12 https://scifaro.com/en/abs/the-grammar-hammer-of-2012-1212.44462012-12-19 https://scifaro.com/en/abs/a-general-framework-for-the-derivation-of-regular-expressions-1212.50032019-02-20 https://scifaro.com/en/abs/balance-properties-of-arnoux-rauzy-words-1212.51062013-11-21 https://scifaro.com/en/abs/cellular-automata-between-sofic-tree-shifts-1212.59512014-02-11 https://scifaro.com/en/abs/on-an-algorithm-for-multiperiodic-words-1212.66092013-10-04 https://scifaro.com/en/abs/regular-cost-functions-part-i-logic-and-algebra-over-words-1212.69372015-07-01 https://scifaro.com/en/abs/composition-closure-of-linear-extended-top-down-tree-transducers-1301.15142013-01-09 https://scifaro.com/en/abs/three-simulation-algorithms-for-labelled-transition-systems-1301.16382013-01-09 https://scifaro.com/en/abs/the-v-c-ern-y-conjecture-for-small-automata-experimental-report-1301.20922013-01-11 https://scifaro.com/en/abs/equivalence-of-deterministic-one-counter-automata-is-nl-complete-1301.21812013-01-11 https://scifaro.com/en/abs/operator-precedence-omega-languages-1301.24762013-07-03 https://scifaro.com/en/abs/ultimate-periodicity-of-b-recognisable-sets-a-quasilinear-procedure-1301.26912013-06-11 https://scifaro.com/en/abs/two-sided-derivatives-for-regular-expressions-and-for-hairpin-expressions-1301.33162013-01-16 https://scifaro.com/en/abs/on-the-transition-reduction-problem-for-finite-automata-1301.37512013-01-17 https://scifaro.com/en/abs/extended-version-algebraic-characterization-of-the-class-of-languages-recognized-by-measure-only-quantum-automata-1301.39312013-09-30 https://scifaro.com/en/abs/binary-patterns-in-binary-cube-free-words-avoidability-and-growth-1301.46822019-02-20 https://scifaro.com/en/abs/the-genus-of-regular-languages-1301.49812016-05-25 https://scifaro.com/en/abs/from-two-way-to-one-way-finite-state-transducers-1301.51972013-04-29 https://scifaro.com/en/abs/minimal-nondeterministic-finite-automata-and-atoms-of-regular-languages-1301.55852013-01-24 https://scifaro.com/en/abs/computable-component-wise-reducibility-1301.71122013-01-31 https://scifaro.com/en/abs/weak-concurrent-kleene-algebra-with-application-to-algebraic-verification-1301.71532013-01-31 https://scifaro.com/en/abs/incomplete-transition-complexity-of-basic-operations-on-finite-languages-1302.07502013-02-05 https://scifaro.com/en/abs/computability-of-the-entropy-of-one-tape-turing-machines-1302.11702013-02-06 https://scifaro.com/en/abs/analysis-of-evidence-using-formal-event-reconstruction-1302.23082013-02-13 https://scifaro.com/en/abs/unifying-b-uchi-complementation-constructions-1302.26752019-08-15 https://scifaro.com/en/abs/on-the-complexity-of-equivalence-and-minimisation-for-q-weighted-automata-1302.28182015-07-01 https://scifaro.com/en/abs/reachability-in-two-clock-timed-automata-is-pspace-complete-1302.31092020-01-15 https://scifaro.com/en/abs/one-variable-word-equations-in-linear-time-1302.34812014-01-23 https://scifaro.com/en/abs/bisimulations-over-dlts-in-o-m-log-n-time-1302.34892013-02-15 https://scifaro.com/en/abs/silent-transitions-in-automata-with-storage-1302.37982013-02-18 https://scifaro.com/en/abs/maximal-syntactic-complexity-of-regular-languages-implies-maximal-quotient-complexities-of-atoms-1302.39062013-05-24 https://scifaro.com/en/abs/generic-strategies-for-chemical-space-exploration-1302.40062014-04-16 https://scifaro.com/en/abs/fresh-variable-automata-for-service-composition-1302.42052013-04-04 https://scifaro.com/en/abs/optimal-scheduling-for-linear-rate-multi-mode-systems-1302.44062013-02-19 https://scifaro.com/en/abs/basic-classes-of-grammars-with-prohibition-1302.51812013-02-22 https://scifaro.com/en/abs/primitive-digraphs-with-large-exponents-and-slowly-synchronizing-automata-1302.57932014-11-25 https://scifaro.com/en/abs/stochastic-context-free-grammars-regular-languages-and-newton-s-method-1302.64112013-02-27 https://scifaro.com/en/abs/efficient-separability-of-regular-languages-by-subsequences-and-suffixes-1303.09662013-03-06 https://scifaro.com/en/abs/enumerating-abelian-returns-to-prefixes-of-sturmian-words-1303.09692013-03-06 https://scifaro.com/en/abs/oracle-pushdown-automata-nondeterministic-reducibilities-and-the-cfl-hierarchy-over-the-family-of-context-free-languages-1303.17172015-05-26 https://scifaro.com/en/abs/weak-morphisms-of-higher-dimensional-automata-1303.20032013-03-11 https://scifaro.com/en/abs/the-separation-problem-for-regular-languages-by-piecewise-testable-languages-1303.21432013-03-12 https://scifaro.com/en/abs/quantum-finite-automata-and-linear-context-free-languages-a-decidable-problem-1303.29672024-06-21 https://scifaro.com/en/abs/effective-characterizations-of-simple-fragments-of-temporal-logic-using-carton-michel-automata-1303.59562015-07-01 https://scifaro.com/en/abs/real-time-vector-automata-1303.61292016-09-09 https://scifaro.com/en/abs/revisiting-the-equivalence-problem-for-finite-multitape-automata-1303.67042013-05-06 https://scifaro.com/en/abs/on-the-state-complexity-of-the-reverse-of-r-and-j-trivial-regular-languages-1304.07332013-06-11 https://scifaro.com/en/abs/structures-without-scattered-automatic-presentation-1304.09122018-11-02 https://scifaro.com/en/abs/multiparty-compatibility-in-communicating-automata-characterisation-and-synthesis-of-global-session-types-1304.19022013-04-09 https://scifaro.com/en/abs/the-finiteness-problem-for-automaton-semigroups-is-undecidable-1304.22952014-03-21 https://scifaro.com/en/abs/the-reachability-problem-for-affine-functions-on-the-integers-1304.26392013-04-10 https://scifaro.com/en/abs/on-mitl-and-alternating-timed-automata-1304.28142013-04-11 https://scifaro.com/en/abs/shortest-repetition-free-words-accepted-by-automata-1304.29592013-04-11 https://scifaro.com/en/abs/on-the-relation-between-context-free-grammars-and-parsing-expression-grammars-1304.31772014-02-17 https://scifaro.com/en/abs/principal-ideal-languages-and-synchronizing-automata-1304.33072013-04-12 https://scifaro.com/en/abs/sets-represented-as-the-length-n-factors-of-a-word-1304.36662013-04-15 https://scifaro.com/en/abs/decidability-of-weak-simulation-on-one-counter-nets-1304.41042014-06-17 https://scifaro.com/en/abs/graph-logics-with-rational-relations-1304.41502019-03-14 https://scifaro.com/en/abs/on-the-structure-and-syntactic-complexity-of-generalized-definite-languages-1304.57142013-04-23 https://scifaro.com/en/abs/on-the-probability-of-being-synchronizable-1304.57742024-07-10 https://scifaro.com/en/abs/guarded-variable-automata-over-infinite-alphabets-1304.62972013-10-28 https://scifaro.com/en/abs/operational-characterization-of-scattered-mcfls-technical-report-1304.63882013-04-24 https://scifaro.com/en/abs/separating-regular-languages-by-piecewise-testable-and-unambiguous-languages-1304.67342013-04-26 https://scifaro.com/en/abs/decision-problems-for-additive-regular-functions-1304.70292013-04-29 https://scifaro.com/en/abs/finitely-generated-ideal-languages-and-synchronizing-automata-1305.03362013-05-03 https://scifaro.com/en/abs/a-comment-on-budach-s-mouse-in-an-octant-problem-1305.09112013-09-24 https://scifaro.com/en/abs/decidability-of-minimization-of-fuzzy-automata-1305.42552013-05-21 https://scifaro.com/en/abs/on-the-structure-and-complexity-of-rational-sets-of-regular-languages-1305.60742013-05-28 https://scifaro.com/en/abs/on-the-number-of-closed-factors-in-a-word-1305.63952014-12-02 https://scifaro.com/en/abs/auto-similarity-in-rational-base-number-systems-1305.67572013-05-30 https://scifaro.com/en/abs/a-representation-of-context-free-grammars-with-the-help-of-finite-digraphs-1305.68032013-05-30 https://scifaro.com/en/abs/sofic-dyck-shifts-1305.74132015-09-18 https://scifaro.com/en/abs/reachability-in-higher-order-counters-1306.10692013-06-06 https://scifaro.com/en/abs/topological-dynamics-and-recognition-of-languages-1306.14682013-06-07 https://scifaro.com/en/abs/detecting-useless-transitions-in-pushdown-automata-1306.19472013-06-11 https://scifaro.com/en/abs/the-holonomy-decomposition-of-circular-semi-flower-automata-1306.25482013-06-12 https://scifaro.com/en/abs/words-with-unbounded-periodicity-complexity-1306.31232019-12-18 https://scifaro.com/en/abs/semilinearity-and-context-freeness-of-languages-accepted-by-valence-automata-1306.32602013-06-19 https://scifaro.com/en/abs/syntactic-complexity-of-circular-semi-flower-automata-1306.34922013-06-17 https://scifaro.com/en/abs/extended-to-multi-tilde-bar-regular-expressions-and-efficient-finite-automata-constructions-1306.35072013-06-18 https://scifaro.com/en/abs/automatic-functions-linear-time-and-learning-1306.37262018-04-19 https://scifaro.com/en/abs/effective-translation-of-ltl-to-deterministic-rabin-automata-beyond-the-f-g-fragment-1306.46362013-11-07 https://scifaro.com/en/abs/on-a-compact-encoding-of-the-swap-automaton-1307.00992013-07-02 https://scifaro.com/en/abs/connector-algebras-for-c-e-and-p-t-nets-interactions-1307.02042015-07-01 https://scifaro.com/en/abs/kleene-algebras-and-semimodules-for-energy-problems-1307.06352013-07-03 https://scifaro.com/en/abs/conway-and-iteration-hemirings-1307.07252013-08-01 https://scifaro.com/en/abs/on-the-state-complexity-of-semi-quantum-finite-automata-1307.24992019-02-20 https://scifaro.com/en/abs/single-tape-and-multi-tape-turing-machines-through-the-lens-of-the-grossone-methodology-1307.39762013-07-16 https://scifaro.com/en/abs/profile-trees-for-b-uchi-word-automata-with-application-to-determinization-1307.44712013-07-18 https://scifaro.com/en/abs/a-unifying-approach-to-decide-relations-for-timed-automata-and-their-game-characterization-1307.74432013-07-30 https://scifaro.com/en/abs/on-separation-by-locally-testable-and-locally-threshold-testable-languages-1308.01812015-07-01 https://scifaro.com/en/abs/text-compression-using-abstract-numeration-system-on-a-regular-language-1308.02672013-09-24 https://scifaro.com/en/abs/a-new-heuristic-synchronizing-algorithm-1308.19782013-08-12 https://scifaro.com/en/abs/lexical-state-analyzer-1308.31562013-08-15 https://scifaro.com/en/abs/undecidability-of-mm-qfas-language-equivalence-problem-1308.33012023-06-06 https://scifaro.com/en/abs/maximally-atomic-languages-1308.43682014-05-23 https://scifaro.com/en/abs/on-the-generative-power-of-omega-grammars-and-omega-automata-1308.45162013-08-22 https://scifaro.com/en/abs/world-automata-a-compositional-approach-to-model-implicit-communication-in-hierarchical-hybrid-systems-1308.53352013-08-27 https://scifaro.com/en/abs/thue-s-1914-paper-a-translation-1308.58582013-08-28 https://scifaro.com/en/abs/balancedness-of-arnoux-rauzy-and-brun-words-1308.66942013-09-02 https://scifaro.com/en/abs/infinitary-axiomatization-of-the-equational-theory-of-context-free-languages-1309.08932013-09-05 https://scifaro.com/en/abs/proceedings-machines-computations-and-universality-2013-1309.10432013-09-05 https://scifaro.com/en/abs/reversible-logic-elements-with-memory-and-their-universality-1309.12642013-09-06 https://scifaro.com/en/abs/how-to-obtain-computational-completeness-in-p-systems-with-one-catalyst-1309.12672013-09-06 https://scifaro.com/en/abs/one-dimensional-array-grammars-and-p-systems-with-array-insertion-and-deletion-rules-1309.12682013-09-06 https://scifaro.com/en/abs/hyperbolic-tilings-and-formal-language-theory-1309.12712013-09-06 https://scifaro.com/en/abs/a-small-universal-petri-net-1309.12742013-09-06 https://scifaro.com/en/abs/emptiness-and-universality-problems-in-timed-automata-with-positive-frequency-1309.28422013-09-12 https://scifaro.com/en/abs/abelian-networks-i-foundations-and-examples-1309.34452016-02-16 https://scifaro.com/en/abs/searching-of-gapped-repeats-and-subrepetitions-in-a-word-1309.40552013-10-01 https://scifaro.com/en/abs/transducers-with-origin-information-1309.61242013-09-25 https://scifaro.com/en/abs/chemical-concrete-machine-1309.69142013-09-27 https://scifaro.com/en/abs/parsing-methods-streamlined-1309.75842013-10-01 https://scifaro.com/en/abs/a-note-on-pushdown-automata-systems-1310.05042014-08-07 https://scifaro.com/en/abs/on-the-index-of-simon-s-congruence-for-piecewise-testability-1310.12782016-07-07 https://scifaro.com/en/abs/the-reachability-problem-for-vector-addition-systems-with-a-stack-is-not-elementary-1310.17672013-10-08 https://scifaro.com/en/abs/symmetric-groups-and-quotient-complexity-of-boolean-operations-1310.18412013-10-08 https://scifaro.com/en/abs/saturation-of-concurrent-collapsible-pushdown-systems-1310.26312013-10-11 https://scifaro.com/en/abs/introduction-to-functional-grammars-1310.28232017-08-17 https://scifaro.com/en/abs/ehrenfeucht-fraisse-games-on-omega-terms-1310.31952013-10-14 https://scifaro.com/en/abs/a-decidable-class-of-nominal-omega-regular-languages-over-an-infinite-alphabet-1310.39452013-10-16 https://scifaro.com/en/abs/avoiding-2-binomial-squares-and-cubes-1310.47432013-10-18 https://scifaro.com/en/abs/implementing-computations-in-automaton-semi-groups-1310.48562013-10-21 https://scifaro.com/en/abs/acceptance-conditions-for-omega-languages-and-the-borel-hierarchy-1310.50322013-10-21 https://scifaro.com/en/abs/one-quantifier-alternation-in-first-order-logic-with-modular-predicates-1310.50432014-07-02 https://scifaro.com/en/abs/avoiding-shared-clocks-in-networks-of-timed-automata-1310.55582015-07-01 https://scifaro.com/en/abs/full-characterisation-of-attractors-of-two-intersected-asynchronous-boolean-automata-cycles-1310.57472014-02-19 https://scifaro.com/en/abs/the-nested-word-problem-1310.62832014-10-28 https://scifaro.com/en/abs/simulation-over-one-counter-nets-is-pspace-complete-1310.63032013-10-24 https://scifaro.com/en/abs/nominal-regular-expressions-for-languages-over-infinite-alphabets-extended-abstract-1310.70932013-10-29 https://scifaro.com/en/abs/a-characterization-of-those-automata-that-structurally-generate-finite-groups-1310.71372013-10-29 https://scifaro.com/en/abs/on-the-effect-of-the-io-substitution-on-the-parikh-image-of-semilinear-afls-1311.06322013-11-05 https://scifaro.com/en/abs/unary-languages-recognized-by-two-way-one-counter-automata-1311.08492014-07-09 https://scifaro.com/en/abs/look-ahead-removal-for-top-down-tree-transducers-1311.24002015-12-04 https://scifaro.com/en/abs/weak-singular-hybrid-automata-1311.38262017-12-20 https://scifaro.com/en/abs/finite-type-dyck-shift-spaces-1311.42232013-11-19 https://scifaro.com/en/abs/most-complex-regular-right-ideal-languages-1311.44482013-11-19 https://scifaro.com/en/abs/on-the-structure-of-bispecial-sturmian-words-1311.49042014-07-15 https://scifaro.com/en/abs/senescent-ground-tree-rewrite-systems-1311.49152013-11-21 https://scifaro.com/en/abs/proceedings-second-international-workshop-on-trends-in-tree-automata-and-tree-transducers-1311.50582013-11-21 https://scifaro.com/en/abs/on-constructing-constrained-tree-automata-recognizing-ground-instances-of-constrained-terms-1311.55672013-11-25 https://scifaro.com/en/abs/random-generation-of-nondeterministic-finite-state-tree-automata-1311.55682013-11-25 https://scifaro.com/en/abs/expressiveness-of-visibly-pushdown-transducers-1311.55712013-11-25 https://scifaro.com/en/abs/node-query-preservation-for-deterministic-linear-top-down-tree-transducers-1311.55722013-11-25 https://scifaro.com/en/abs/brzozowski-type-determinization-for-fuzzy-automata-1311.57992014-04-01 https://scifaro.com/en/abs/synchronous-context-free-grammars-and-optimal-linear-parsing-strategies-1311.64212013-11-27 https://scifaro.com/en/abs/enhancing-approximations-for-regular-reachability-analysis-1311.66052013-11-27 https://scifaro.com/en/abs/ergodicity-of-random-walks-on-random-dfa-1311.68302013-11-28 https://scifaro.com/en/abs/analysis-and-synthesis-of-nonlinear-reversible-cellular-automata-in-linear-time-1311.68792013-11-28 https://scifaro.com/en/abs/remarks-on-privileged-words-1311.74032013-12-02 https://scifaro.com/en/abs/on-even-linear-indexed-languages-with-a-reduction-to-the-learning-of-context-free-languages-1312.01752014-08-26 https://scifaro.com/en/abs/inclusion-of-regular-and-linear-languages-in-group-languages-1312.01902013-12-03 https://scifaro.com/en/abs/partial-actions-and-automata-1312.15282013-12-06 https://scifaro.com/en/abs/on-two-algorithmic-problems-about-synchronizing-automata-1312.22262018-03-26 https://scifaro.com/en/abs/finite-automata-with-advice-tapes-1312.22682016-03-27 https://scifaro.com/en/abs/universal-neural-field-computation-1312.35502013-12-13 https://scifaro.com/en/abs/small-universal-petri-nets-with-inhibitor-arcs-1312.44142013-12-17 https://scifaro.com/en/abs/undecidability-in-binary-tag-systems-and-the-post-correspondence-problem-for-four-pairs-of-words-1312.67002013-12-25 https://scifaro.com/en/abs/large-aperiodic-semigroups-1401.01572014-06-20 https://scifaro.com/en/abs/tight-bounds-for-active-self-assembly-using-an-insertion-primitive-1401.03592015-10-29 https://scifaro.com/en/abs/undecidable-properties-of-self-affine-sets-and-multi-tape-automata-1401.07052014-09-26 https://scifaro.com/en/abs/operads-quasiorders-and-regular-languages-1401.20102016-01-22 https://scifaro.com/en/abs/testing-for-synchronization-1401.25532019-03-20 https://scifaro.com/en/abs/deterministic-logics-for-ul-1401.27142014-01-14 https://scifaro.com/en/abs/synthesis-of-sequential-extended-regular-expressions-for-verification-1401.31732014-01-16 https://scifaro.com/en/abs/separation-property-for-wb-and-ws-regular-languages-1401.32142015-07-01 https://scifaro.com/en/abs/exact-and-approximate-determinization-of-discounted-sum-automata-1401.39572015-07-01 https://scifaro.com/en/abs/unambiguous-buchi-is-weak-1401.40252016-05-10 https://scifaro.com/en/abs/the-existential-fragment-of-s1s-over-element-and-successor-is-the-co-b-uchi-languages-1401.49322014-01-21 https://scifaro.com/en/abs/k-colorability-is-graph-automaton-recognizable-1401.52872023-02-01 https://scifaro.com/en/abs/continuous-speech-recognition-based-on-deterministic-finite-automata-machine-using-utterance-and-pitch-verification-1401.53822014-01-22 https://scifaro.com/en/abs/determinising-parity-automata-1401.53942014-09-12 https://scifaro.com/en/abs/an-efficient-algorithm-for-the-equation-tree-automaton-via-the-k-c-continuations-1401.59512014-01-24 https://scifaro.com/en/abs/zero-reachability-in-probabilistic-multi-counter-automata-1401.68402014-01-28 https://scifaro.com/en/abs/more-ties-than-we-thought-1401.82422015-05-07 https://scifaro.com/en/abs/regular-combinators-for-string-transformations-1402.30212014-02-14 https://scifaro.com/en/abs/weak-omega-regular-trace-languages-1402.31992014-02-14 https://scifaro.com/en/abs/separating-regular-languages-with-first-order-logic-1402.32772017-01-11 https://scifaro.com/en/abs/periodic-configurations-of-subshifts-on-groups-1402.34482014-02-27 https://scifaro.com/en/abs/revision-of-specification-automata-under-quantitative-preferences-1402.36112014-02-18 https://scifaro.com/en/abs/turing-degrees-of-limit-sets-of-cellular-automata-1402.37662014-02-18 https://scifaro.com/en/abs/nondeterministic-automatic-complexity-of-overlap-free-and-almost-square-free-words-1402.38562020-02-03 https://scifaro.com/en/abs/a-note-on-groups-of-a-family-of-hyperbolic-tessellations-1402.43372014-02-19 https://scifaro.com/en/abs/cyclic-complexity-of-words-1402.58432016-06-29 https://scifaro.com/en/abs/further-improvements-of-determinization-methods-for-fuzzy-finite-automata-1402.65102014-12-09 https://scifaro.com/en/abs/proceedings-15th-international-workshop-on-verification-of-infinite-state-systems-1402.66102014-02-27 https://scifaro.com/en/abs/lattice-structures-for-bisimilar-probabilistic-automata-1402.67822014-02-28 https://scifaro.com/en/abs/a-finite-exact-representation-of-register-automata-configurations-1402.67832014-02-28 https://scifaro.com/en/abs/zenoness-for-timed-pushdown-automata-1402.67842014-02-28 https://scifaro.com/en/abs/synthesizing-finite-state-protocols-from-scenarios-and-requirements-1402.71502014-03-03 https://scifaro.com/en/abs/on-nonpermutational-transformation-semigroups-with-an-application-to-syntactic-complexity-1402.72892014-03-03 https://scifaro.com/en/abs/unary-pushdown-automata-and-straight-line-programs-1403.05092014-03-04 https://scifaro.com/en/abs/towards-focus-on-time-1403.10062014-03-06 https://scifaro.com/en/abs/algebraic-properties-of-word-equations-1403.19512019-12-18 https://scifaro.com/en/abs/upper-bounds-on-syntactic-complexity-of-left-and-two-sided-ideals-1403.20902014-07-04 https://scifaro.com/en/abs/probabilistic-bisimulations-for-pctl-model-checking-of-interval-mdps-1403.28642014-04-11 https://scifaro.com/en/abs/automata-theory-meets-barrier-certificates-temporal-logic-verification-of-nonlinear-systems-1403.35242014-03-17 https://scifaro.com/en/abs/subset-synchronization-and-careful-synchronization-of-binary-finite-automata-1403.39722016-02-16 https://scifaro.com/en/abs/reset-thresholds-of-automata-with-two-cycle-lengths-1403.39922014-03-18 https://scifaro.com/en/abs/parameterized-complexity-of-synchronization-and-road-coloring-1403.47492014-06-24 https://scifaro.com/en/abs/enforcing-operational-properties-including-blockfreeness-for-deterministic-pushdown-automata-1403.50812014-03-24 https://scifaro.com/en/abs/rhythmic-generation-of-infinite-trees-and-languages-1403.51902014-05-06 https://scifaro.com/en/abs/synchronizing-weighted-automata-1403.57292014-05-23 https://scifaro.com/en/abs/l-primitive-words-in-submonoids-1403.57882014-03-25 https://scifaro.com/en/abs/topologies-of-stochastic-markov-models-computational-aspects-1403.60322014-03-26 https://scifaro.com/en/abs/monoid-automata-for-displacement-context-free-languages-1403.60602014-03-25 https://scifaro.com/en/abs/pumping-lemma-and-ogden-lemma-for-displacement-context-free-grammars-1403.62302014-07-01 https://scifaro.com/en/abs/k-position-follow-equation-and-k-c-continuation-tree-automata-constructions-1403.62512014-07-14 https://scifaro.com/en/abs/an-intensional-concurrent-faithful-encoding-of-turing-machines-1404.05452014-10-29 https://scifaro.com/en/abs/breadth-first-serialisation-of-trees-and-rational-languages-1404.07982014-04-04 https://scifaro.com/en/abs/regular-substitution-sets-a-means-of-controlling-e-unification-1404.12012019-04-19 https://scifaro.com/en/abs/the-kinetic-basis-of-self-organized-pattern-formation-1404.12832014-06-03 https://scifaro.com/en/abs/buchi-determinization-made-tighter-1404.14362014-12-25 https://scifaro.com/en/abs/potential-of-quantum-finite-automata-with-exact-acceptance-1404.16892014-11-26 https://scifaro.com/en/abs/learning-cover-context-free-grammars-from-structural-data-1404.24092014-04-10 https://scifaro.com/en/abs/reset-complexity-of-ideal-languages-1404.28162014-04-11 https://scifaro.com/en/abs/normal-abby-normal-prefix-normal-1404.28242014-06-23 https://scifaro.com/en/abs/generating-synchronizing-automata-with-large-reset-lengths-1404.33112018-03-29 https://scifaro.com/en/abs/on-upper-and-lower-bounds-on-the-length-of-alternating-towers-1404.44952014-07-10 https://scifaro.com/en/abs/mathrm-pal-k-is-linear-recognizable-online-1404.52442015-04-01 https://scifaro.com/en/abs/cooperating-distributed-context-free-hexagonal-array-grammar-systems-with-permitting-contexts-1404.53932014-04-23 https://scifaro.com/en/abs/combining-pattern-based-crfs-and-weighted-context-free-grammars-1404.54752014-11-04 https://scifaro.com/en/abs/the-monoid-of-queue-actions-1404.54792014-04-23 https://scifaro.com/en/abs/lipschitz-robustness-of-finite-state-transducers-1404.64522014-10-08 https://scifaro.com/en/abs/distributed-graph-automata-1404.65032014-04-28 https://scifaro.com/en/abs/reducing-clocks-in-timed-automata-while-preserving-bisimulation-1404.66132015-05-21 https://scifaro.com/en/abs/complexity-of-atoms-combinatorially-1404.66322015-06-03 https://scifaro.com/en/abs/stability-and-complexity-of-minimising-probabilistic-automata-1404.66732014-05-02 https://scifaro.com/en/abs/synchronizing-automata-with-random-inputs-1404.67312014-04-29 https://scifaro.com/en/abs/going-higher-in-the-first-order-quantifier-alternation-hierarchy-on-words-1404.68322014-04-29 https://scifaro.com/en/abs/fast-synchronization-of-random-automata-1404.69622014-09-02 https://scifaro.com/en/abs/sreach-a-bounded-model-checker-for-stochastic-hybrid-systems-1404.72062014-10-28 https://scifaro.com/en/abs/automata-in-sagemath-combinatorics-meet-theoretical-computer-science-1404.74582023-06-22 https://scifaro.com/en/abs/recognizable-series-on-hypergraphs-1404.75332014-10-17 https://scifaro.com/en/abs/quantum-stochastic-and-pseudo-stochastic-languages-with-few-states-1405.00552014-12-23 https://scifaro.com/en/abs/on-the-disambiguation-of-weighted-automata-1405.05002014-05-06 https://scifaro.com/en/abs/simultaneous-finite-automata-an-efficient-data-parallel-model-for-regular-expression-matching-1405.05622014-05-06 https://scifaro.com/en/abs/on-state-complexity-of-unions-of-binary-factor-free-languages-1405.11072014-05-07 https://scifaro.com/en/abs/the-length-of-a-minimal-synchronizing-word-and-the-v-c-erny-conjecture-1405.24352021-07-20 https://scifaro.com/en/abs/graph-spectral-properties-of-deterministic-finite-automata-1405.25532014-05-13 https://scifaro.com/en/abs/new-results-on-the-minimum-amount-of-useful-space-1405.28922015-08-05 https://scifaro.com/en/abs/interprocedural-reachability-for-flat-integer-programs-1405.30692015-06-12 https://scifaro.com/en/abs/a-new-approach-to-the-2-regularity-of-the-ell-abelian-complexity-of-2-automatic-sequences-1405.35322023-09-04 https://scifaro.com/en/abs/complexity-of-checking-whether-two-automata-are-synchronized-by-the-same-language-1405.35762014-05-15 https://scifaro.com/en/abs/derivatives-of-parsing-expression-grammars-1405.48412017-08-23 https://scifaro.com/en/abs/proceedings-14th-international-conference-on-automata-and-formal-languages-1405.52722014-05-22 https://scifaro.com/en/abs/saturation-algorithms-for-model-checking-pushdown-systems-1405.55932014-05-23 https://scifaro.com/en/abs/from-finite-automata-to-regular-expressions-and-back-a-summary-on-descriptional-complexity-1405.55942014-05-23 https://scifaro.com/en/abs/on-varieties-of-automata-enriched-with-an-algebraic-structure-extended-abstract-1405.55952014-05-23 https://scifaro.com/en/abs/decision-problems-for-deterministic-pushdown-automata-on-infinite-words-1405.55962014-05-23 https://scifaro.com/en/abs/equivalence-problems-for-tree-transducers-a-brief-survey-1405.55972014-05-23 https://scifaro.com/en/abs/grammars-with-two-sided-contexts-1405.55982014-05-23 https://scifaro.com/en/abs/analyzing-catastrophic-backtracking-behavior-in-practical-regular-expression-matching-1405.55992014-05-23 https://scifaro.com/en/abs/measuring-communication-in-parallel-communicating-finite-automata-1405.56002014-05-23 https://scifaro.com/en/abs/simplifying-nondeterministic-finite-cover-automata-1405.56012014-05-23 https://scifaro.com/en/abs/on-determinism-and-unambiguity-of-weighted-two-way-automata-1405.56022014-05-23 https://scifaro.com/en/abs/operations-on-automata-with-all-states-final-1405.56032014-05-23 https://scifaro.com/en/abs/commutative-languages-and-their-composition-by-consensual-methods-1405.56042014-05-23 https://scifaro.com/en/abs/similarity-density-of-the-thue-morse-word-with-overlap-free-infinite-binary-words-1405.56052014-05-23 https://scifaro.com/en/abs/cooperating-distributed-grammar-systems-of-finite-index-working-in-hybrid-modes-1405.56062014-05-23 https://scifaro.com/en/abs/representations-of-circular-words-1405.56072014-05-23 https://scifaro.com/en/abs/more-structural-characterizations-of-some-subregular-language-families-by-biautomata-1405.56082014-05-23 https://scifaro.com/en/abs/buffered-simulation-games-for-b-uchi-automata-1405.56092014-05-23 https://scifaro.com/en/abs/hyper-minimization-for-deterministic-weighted-tree-automata-1405.56102014-05-23 https://scifaro.com/en/abs/boolean-circuit-complexity-of-regular-languages-1405.56112014-05-23 https://scifaro.com/en/abs/classical-automata-on-promise-problems-1405.66712014-10-17 https://scifaro.com/en/abs/biclique-coverings-rectifier-networks-and-the-cost-of-varepsilon-removal-1406.00172014-06-03 https://scifaro.com/en/abs/decision-algorithms-for-fibonacci-automatic-words-with-applications-to-pattern-avoidance-1406.06702014-07-29 https://scifaro.com/en/abs/on-the-state-complexity-of-closures-and-interiors-of-regular-languages-with-subwords-and-superwords-1406.06902015-12-02 https://scifaro.com/en/abs/mccammond-s-normal-forms-for-free-aperiodic-semigroups-revisited-1406.08882019-02-20 https://scifaro.com/en/abs/from-algebra-to-logic-there-and-back-again-the-story-of-a-hierarchy-1406.10352014-06-05 https://scifaro.com/en/abs/an-efficient-algorithm-for-computing-the-edit-distance-of-a-regular-language-via-input-altering-transducers-1406.10412014-06-05 https://scifaro.com/en/abs/tight-bounds-for-complementing-parity-automata-1406.10902014-09-12 https://scifaro.com/en/abs/eigenvalues-and-transduction-of-morphic-sequences-extended-version-1406.17542014-06-09 https://scifaro.com/en/abs/integer-vector-addition-systems-with-states-1406.25902014-10-01 https://scifaro.com/en/abs/k-l-unambiguity-and-quasi-deterministic-structures-1406.32142017-05-12 https://scifaro.com/en/abs/on-infinite-words-determined-by-indexed-languages-1406.33732014-06-18 https://scifaro.com/en/abs/subword-complexity-and-decomposition-of-the-set-of-factors-1406.39742014-06-17 https://scifaro.com/en/abs/quantum-finite-automata-a-modern-introduction-1406.40482014-06-17 https://scifaro.com/en/abs/state-of-b-uchi-complementation-1406.45752015-07-01 https://scifaro.com/en/abs/optimal-strategy-synthesis-for-request-response-games-1406.46482014-06-19 https://scifaro.com/en/abs/constrained-expressions-and-their-derivatives-1406.61442015-10-09 https://scifaro.com/en/abs/distinguishability-operations-and-closures-on-regular-languages-1407.01602014-12-11 https://scifaro.com/en/abs/statistical-study-on-the-number-of-injective-linear-finite-transducers-1407.01692014-07-02 https://scifaro.com/en/abs/alternating-private-alternating-and-quantum-alternating-realtime-automata-1407.03342023-06-22 https://scifaro.com/en/abs/on-the-computation-of-distances-for-probabilistic-context-free-grammars-1407.15132014-07-08 https://scifaro.com/en/abs/symbolic-algorithms-for-language-equivalence-and-kleene-algebra-with-tests-1407.32132014-07-14 https://scifaro.com/en/abs/checking-whether-an-automaton-is-monotonic-is-np-complete-1407.50682015-08-11 https://scifaro.com/en/abs/mechanical-proofs-of-properties-of-the-tribonacci-word-1407.58412014-07-29 https://scifaro.com/en/abs/some-properties-of-brzozowski-derivatives-of-regular-expressions-1407.59022014-07-23 https://scifaro.com/en/abs/a-new-model-of-array-grammar-for-generating-connected-patterns-on-an-image-neighborhood-1407.83372014-08-01 https://scifaro.com/en/abs/the-expressive-power-of-quantum-walks-in-terms-of-language-acceptance-1408.00512014-08-04 https://scifaro.com/en/abs/context-free-grammars-with-storage-1408.06832014-08-05 https://scifaro.com/en/abs/on-practical-regular-expressions-1408.12582015-01-06 https://scifaro.com/en/abs/star-free-languages-and-local-divisors-1408.28422014-08-14 https://scifaro.com/en/abs/distributed-graph-automata-and-verification-of-distributed-algorithms-1408.30302018-07-03 https://scifaro.com/en/abs/maximally-permissive-controlled-system-synthesis-for-modal-logic-1408.33172014-08-15 https://scifaro.com/en/abs/strong-inapproximability-of-the-shortest-reset-word-1408.52482015-06-10 https://scifaro.com/en/abs/synthesis-of-deterministic-top-down-tree-transducers-from-automatic-tree-relations-1408.59592014-08-27 https://scifaro.com/en/abs/hourglass-automata-1408.59652014-08-27 https://scifaro.com/en/abs/deterministic-automata-for-unordered-trees-1408.59662014-08-27 https://scifaro.com/en/abs/deterministic-timed-finite-state-machines-equivalence-checking-and-expressive-power-1408.59672014-08-27 https://scifaro.com/en/abs/improved-undecidability-results-for-reachability-games-on-recursive-timed-automata-1408.59682014-08-27 https://scifaro.com/en/abs/the-power-of-proofs-new-algorithms-for-timed-automata-model-checking-with-appendix-1408.61042014-08-29 https://scifaro.com/en/abs/subset-seed-automaton-1408.61982014-08-27 https://scifaro.com/en/abs/turing-degree-spectra-of-minimal-subshifts-1408.64872014-09-18 https://scifaro.com/en/abs/plane-walking-automata-1408.67012014-08-29 https://scifaro.com/en/abs/abelian-networks-ii-halting-on-all-inputs-1409.01692015-08-06 https://scifaro.com/en/abs/abelian-networks-iii-the-critical-group-1409.01702015-11-03 https://scifaro.com/en/abs/kolmogorov-structure-functions-for-automatic-complexity-1409.05842020-01-31 https://scifaro.com/en/abs/weak-and-nested-class-memory-automata-1409.11362014-12-01 https://scifaro.com/en/abs/complexity-of-a-problem-concerning-reset-words-for-eulerian-binary-automata-1409.20032014-09-09 https://scifaro.com/en/abs/ltl-parameter-synthesis-of-parametric-timed-automata-1409.36962016-03-07 https://scifaro.com/en/abs/alternating-towers-and-piecewise-testable-separators-1409.39432015-11-13 https://scifaro.com/en/abs/finite-automata-with-restricted-two-way-motion-1409.59092014-09-23 https://scifaro.com/en/abs/dyck-based-characterizations-of-indexed-languages-1409.61122015-11-11 https://scifaro.com/en/abs/a-connected-3-state-reversible-mealy-automaton-cannot-generate-an-infinite-burnside-group-1409.61422014-09-23 https://scifaro.com/en/abs/distributional-learning-of-context-free-languages-under-fixed-finite-monoid-typing-1409.62472026-05-11 https://scifaro.com/en/abs/computing-downward-closures-for-stacked-counter-automata-1409.79222014-09-30 https://scifaro.com/en/abs/converting-reconfigurable-petri-nets-to-maude-1409.84042014-11-13 https://scifaro.com/en/abs/broadcasting-automata-and-patterns-on-z-2-1410.05732014-10-03 https://scifaro.com/en/abs/a-characterization-for-decidable-separability-by-piecewise-testable-languages-1410.10422023-06-22 https://scifaro.com/en/abs/logics-with-rigidly-guarded-data-tests-1410.20222017-01-11 https://scifaro.com/en/abs/weighted-finite-automata-with-output-1410.24152014-10-10 https://scifaro.com/en/abs/finite-automata-for-the-sub-and-superword-closure-of-cfls-descriptional-and-computational-complexity-1410.27372014-10-24 https://scifaro.com/en/abs/symbolic-solving-of-extended-regular-expression-inequalities-1410.32272014-10-14 https://scifaro.com/en/abs/what-is-known-about-the-value-1-problem-for-probabilistic-automata-1410.37702014-10-15 https://scifaro.com/en/abs/analysing-oscillatory-trends-of-discrete-state-stochastic-processes-through-hasl-statistical-model-checking-1410.40272014-10-16 https://scifaro.com/en/abs/on-the-synchronizing-probability-function-and-the-triple-rendezvous-time-for-synchronizing-automata-1410.40342015-12-21 https://scifaro.com/en/abs/unified-analysis-of-collapsible-and-ordered-pushdown-automata-via-term-rewriting-1410.40652014-10-16 https://scifaro.com/en/abs/on-torsion-free-semigroups-generated-by-invertible-reversible-mealy-automata-1410.44882014-12-04 https://scifaro.com/en/abs/the-field-of-the-reals-and-the-random-graph-are-not-finite-word-ordinal-automatic-1410.51972014-10-21 https://scifaro.com/en/abs/minimisation-of-multiplicity-tree-automata-1410.53522019-03-14 https://scifaro.com/en/abs/proving-safety-with-trace-automata-and-bounded-model-checking-1410.57642014-10-22 https://scifaro.com/en/abs/a-survey-on-the-local-divisor-technique-1410.60262023-03-17 https://scifaro.com/en/abs/determinization-of-fuzzy-automata-by-means-of-the-degrees-of-language-inclusion-1410.60632014-12-17 https://scifaro.com/en/abs/from-orchestration-to-choreography-through-contract-automata-1410.74712014-10-29 https://scifaro.com/en/abs/cost-preserving-bisimulations-for-probabilistic-automata-1410.83142015-07-01 https://scifaro.com/en/abs/control-improvisation-1411.06982017-04-25 https://scifaro.com/en/abs/an-intuitive-procedure-for-converting-pda-to-cfg-by-construction-of-single-state-pda-1411.08132014-11-05 https://scifaro.com/en/abs/metamorphosis-of-fuzzy-regular-expressions-to-fuzzy-automata-using-the-follow-automata-1411.28652014-12-02 https://scifaro.com/en/abs/promise-problems-solved-by-quantum-and-classical-finite-automata-1411.38702015-12-09 https://scifaro.com/en/abs/weighted-automata-on-infinite-words-in-the-context-of-attacker-defender-games-1411.47962015-04-28 https://scifaro.com/en/abs/a-complete-refinement-procedure-for-regular-separability-of-context-free-languages-1411.51312014-11-20 https://scifaro.com/en/abs/frec-14-frontiers-of-recognizability-1411.56112014-12-15 https://scifaro.com/en/abs/zeno-machines-and-running-turing-machine-for-infinite-time-1411.56792014-11-24 https://scifaro.com/en/abs/concurrent-timed-port-automata-1411.60272014-11-25 https://scifaro.com/en/abs/quotient-of-acceptance-specifications-under-reachability-constraints-1411.64632014-11-25 https://scifaro.com/en/abs/preset-distinguishing-sequences-and-diameter-of-transformation-semigroups-1412.00342014-12-02 https://scifaro.com/en/abs/on-streaming-string-transducers-and-hdt0l-systems-1412.05372014-12-02 https://scifaro.com/en/abs/complexity-of-road-coloring-with-prescribed-reset-words-1412.07992014-12-03 https://scifaro.com/en/abs/the-emptiness-problem-for-tree-automata-with-at-least-one-disequality-constraint-is-np-hard-1412.08392014-12-03 https://scifaro.com/en/abs/a-note-on-a-recent-attempt-to-improve-the-pin-frankl-bound-1412.09752014-12-03 https://scifaro.com/en/abs/on-k-piecewise-testability-preliminary-report-1412.16412015-06-10 https://scifaro.com/en/abs/j2-radical-in-automata-nearrings-1412.17362014-12-05 https://scifaro.com/en/abs/parem-a-novel-approach-for-parallel-regular-expression-matching-1412.17412015-06-30 https://scifaro.com/en/abs/syntactic-complexity-of-suffix-free-languages-1412.22812015-10-16 https://scifaro.com/en/abs/search-of-complex-binary-cellular-automata-using-behavioral-metrics-1412.22872015-01-19 https://scifaro.com/en/abs/run-length-encoded-nondeterministic-kmp-and-suffix-automata-1412.36882014-12-18 https://scifaro.com/en/abs/reachability-in-two-dimensional-vector-addition-systems-with-states-is-pspace-complete-1412.42592017-03-20 https://scifaro.com/en/abs/functional-automata-formal-languages-for-computer-science-students-1412.48782014-12-17 https://scifaro.com/en/abs/permutations-of-context-free-and-indexed-languages-1412.55122015-01-06 https://scifaro.com/en/abs/the-timestamp-of-timed-automata-1412.56692019-08-19 https://scifaro.com/en/abs/new-results-on-classical-and-quantum-counter-automata-1412.67612023-06-22 https://scifaro.com/en/abs/representation-of-left-ideal-regular-languages-by-synchronizing-automata-1412.67672014-12-23 https://scifaro.com/en/abs/algebraic-synchronization-criterion-and-computing-reset-words-1412.83632015-12-21 https://scifaro.com/en/abs/defining-and-composing-big-state-machines-1501.005072015-01-06 https://scifaro.com/en/abs/a-transfer-theorem-for-the-separation-problem-1501.005692015-01-06 https://scifaro.com/en/abs/continuous-kleene-omega-algebras-1501.011182015-01-07 https://scifaro.com/en/abs/minimum-probabilistic-finite-state-learning-problem-on-finite-data-sets-complexity-solution-and-approximations-1501.013002017-02-28 https://scifaro.com/en/abs/online-computation-of-abelian-runs-1501.014292015-01-08 https://scifaro.com/en/abs/scanning-and-parsing-languages-with-ambiguities-and-constraints-the-lamb-and-fence-algorithms-1501.027952015-01-14 https://scifaro.com/en/abs/generalized-eilenberg-theorem-i-local-varieties-of-languages-1501.028342015-01-19 https://scifaro.com/en/abs/profinite-techniques-for-probabilistic-automata-and-the-markov-monoid-algorithm-1501.029972017-09-12 https://scifaro.com/en/abs/the-modelcc-model-based-parser-generator-1501.034582015-01-15 https://scifaro.com/en/abs/equation-x-iy-jx-k-u-iv-ju-k-in-words-1501.036022019-12-18 https://scifaro.com/en/abs/root-weighted-tree-automata-and-their-applications-to-tree-kernels-1501.038952015-01-19 https://scifaro.com/en/abs/a-one-dimensional-physically-universal-cellular-automaton-1501.039882016-02-22 https://scifaro.com/en/abs/complexity-of-problems-of-commutative-grammars-1501.042452015-07-01 https://scifaro.com/en/abs/transformation-from-legal-marking-set-to-admissible-marking-set-of-petri-nets-with-uncontrollable-transitions-1501.047772015-01-21 https://scifaro.com/en/abs/regularity-preserving-but-not-reflecting-encodings-1501.048352015-01-21 https://scifaro.com/en/abs/varieties-of-languages-in-a-category-1501.051802015-01-22 https://scifaro.com/en/abs/mathbb-n-algebraicity-of-zeta-functions-of-sofic-dyck-shifts-1501.058432017-02-24 https://scifaro.com/en/abs/a-canonical-form-for-weighted-automata-and-applications-to-approximate-minimization-1501.068412015-04-27 https://scifaro.com/en/abs/consensus-game-acceptors-and-iterated-transductions-1501.071312016-04-27 https://scifaro.com/en/abs/abelian-bordered-factors-and-periodicity-1501.074642015-01-30 https://scifaro.com/en/abs/construction-of-rational-expression-from-tree-automata-using-a-generalization-of-arden-s-lemma-1501.076862015-02-02 https://scifaro.com/en/abs/a-solution-to-yamakami-s-problem-on-advised-context-free-languages-1502.003672015-02-03 https://scifaro.com/en/abs/reversibility-of-d-state-finite-cellular-automata-1502.011872018-05-09 https://scifaro.com/en/abs/context-free-algorithms-1502.023282015-02-10 https://scifaro.com/en/abs/lower-bounds-on-the-size-of-semi-quantum-finite-automata-1502.028392015-10-06 https://scifaro.com/en/abs/automata-and-rational-expressions-1502.035732015-02-13 https://scifaro.com/en/abs/varieties-1502.039512021-11-19 https://scifaro.com/en/abs/beyond-the-runs-theorem-1502.046442019-12-18 https://scifaro.com/en/abs/rewriting-higher-order-stack-trees-1502.046532015-02-17 https://scifaro.com/en/abs/annotated-stack-trees-1502.058732015-02-26 https://scifaro.com/en/abs/algorithm-for-the-k-position-tree-automaton-construction-1502.061942015-02-24 https://scifaro.com/en/abs/growth-rate-of-binary-words-avoiding-xxx-r-1502.070142015-02-26 https://scifaro.com/en/abs/graph-grammars-insertion-lie-algebras-and-quantum-field-theory-1502.077962015-03-02 https://scifaro.com/en/abs/transducer-descriptions-of-dna-code-properties-and-undecidability-of-antimorphic-problems-1503.000352015-03-03 https://scifaro.com/en/abs/decidable-horn-systems-with-difference-constraints-arithmetic-1503.002582016-02-16 https://scifaro.com/en/abs/partial-derivative-automaton-for-regular-expressions-with-shuffle-1503.002792015-03-03 https://scifaro.com/en/abs/regular-realizability-problems-and-context-free-languages-1503.002952015-04-23 https://scifaro.com/en/abs/an-approach-to-computing-downward-closures-1503.010682015-06-02 https://scifaro.com/en/abs/quotient-complexities-of-atoms-in-regular-ideal-languages-1503.022082015-05-26 https://scifaro.com/en/abs/timed-pushdown-automata-revisited-1503.024222015-04-20 https://scifaro.com/en/abs/an-upper-bound-on-the-complexity-of-recognizable-tree-languages-1503.028402015-03-12 https://scifaro.com/en/abs/on-the-decomposition-of-stochastic-cellular-automata-1503.033182015-08-20 https://scifaro.com/en/abs/the-kinetic-basis-of-morphogenesis-1503.033212015-05-25 https://scifaro.com/en/abs/on-the-coverability-problem-for-pushdown-vector-addition-systems-in-one-dimension-1503.040182015-04-30 https://scifaro.com/en/abs/diverse-palindromic-factorization-is-np-complete-1503.040452020-12-15 https://scifaro.com/en/abs/regular-realizability-problems-and-regular-languages-1503.058792015-03-20 https://scifaro.com/en/abs/factorization-in-formal-languages-1503.063652015-03-24 https://scifaro.com/en/abs/pairs-of-languages-closed-under-shuffle-projection-1503.086022015-03-31 https://scifaro.com/en/abs/on-the-sizes-of-dpdas-pdas-lbas-1503.088472015-07-17 https://scifaro.com/en/abs/on-the-combinatorics-of-palindromes-and-antipalindromes-1503.091122016-09-13 https://scifaro.com/en/abs/equivalence-of-deterministic-top-down-tree-to-string-transducers-is-decidable-1503.091632017-01-30 https://scifaro.com/en/abs/complete-simulation-of-automata-networks-1504.001692018-03-12 https://scifaro.com/en/abs/copyless-cost-register-automata-structure-expressiveness-and-closure-properties-1504.017092018-04-30 https://scifaro.com/en/abs/fully-bordered-words-1504.022222019-12-18 https://scifaro.com/en/abs/adaptive-homing-is-in-p-1504.024442015-04-10 https://scifaro.com/en/abs/reachability-analysis-of-first-order-definable-pushdown-systems-1504.026512015-07-20 https://scifaro.com/en/abs/a-fibrational-approach-to-automata-theory-1504.026922015-11-06 https://scifaro.com/en/abs/multi-sequential-word-relations-1504.038642015-04-16 https://scifaro.com/en/abs/deciding-the-value-1-problem-for-probabilistic-leaktight-automata-1504.041362017-01-11 https://scifaro.com/en/abs/polynomial-interrupt-timed-automata-1504.045412015-04-20 https://scifaro.com/en/abs/symbolic-manipulation-of-code-properties-1504.047152016-08-02 https://scifaro.com/en/abs/homing-vector-automata-1504.048592015-09-21 https://scifaro.com/en/abs/complexity-of-suffix-free-regular-languages-1504.051592016-12-13 https://scifaro.com/en/abs/timed-orchestration-for-component-based-systems-1504.055132016-05-23 https://scifaro.com/en/abs/tree-compression-using-string-grammars-1504.055352015-09-29 https://scifaro.com/en/abs/nested-weighted-automata-1504.061172015-04-24 https://scifaro.com/en/abs/language-emptiness-of-continuous-time-parametric-timed-automata-1504.078382016-08-08 https://scifaro.com/en/abs/edit-distance-for-pushdown-automata-1504.082592019-03-14 https://scifaro.com/en/abs/context-free-language-theory-formalization-1505.000612015-05-04 https://scifaro.com/en/abs/a-formalisation-of-finite-automata-using-hereditarily-finite-sets-1505.016622015-05-08 https://scifaro.com/en/abs/zero-one-law-for-regular-languages-and-semigroups-with-zero-1505.033432015-12-03 https://scifaro.com/en/abs/state-complexity-of-catenation-combined-with-a-boolean-operation-a-unified-approach-1505.034742015-05-14 https://scifaro.com/en/abs/counting-branches-in-trees-using-games-1505.038522015-05-15 https://scifaro.com/en/abs/automatic-completion-of-distributed-protocols-with-symmetry-1505.044092015-05-19 https://scifaro.com/en/abs/concentration-independent-random-number-generation-in-tile-self-assembly-1506.006802016-08-01 https://scifaro.com/en/abs/the-degree-of-squares-is-an-atom-extended-version-1506.008842015-06-03 https://scifaro.com/en/abs/lipschitz-robustness-of-timed-i-o-systems-1506.012332015-06-04 https://scifaro.com/en/abs/index-problems-for-game-automata-1506.021532016-06-01 https://scifaro.com/en/abs/topological-abstraction-of-higher-dimensional-automata-1506.022702015-06-09 https://scifaro.com/en/abs/automated-synthesis-of-distributed-controllers-1506.023692015-06-09 https://scifaro.com/en/abs/uniform-generation-in-trace-monoids-1506.024552015-06-09 https://scifaro.com/en/abs/bottom-up-quotients-and-residuals-for-tree-languages-1506.028632015-06-10 https://scifaro.com/en/abs/syntactic-semigroup-problem-for-the-semigroup-reducts-of-affine-near-semirings-over-brandt-semigroups-1506.029722015-06-10 https://scifaro.com/en/abs/processing-xml-for-domain-specific-languages-1506.033662015-06-11 https://scifaro.com/en/abs/formalization-of-closure-properties-for-context-free-grammars-1506.034282015-06-11 https://scifaro.com/en/abs/algebraic-characterization-of-forest-logics-1506.038432017-02-16 https://scifaro.com/en/abs/aperiodic-string-transducers-1506.040592016-06-10 https://scifaro.com/en/abs/self-assembling-interactive-modules-a-research-programme-1506.054992015-06-19 https://scifaro.com/en/abs/fluid-model-checking-of-timed-properties-1506.059092015-06-22 https://scifaro.com/en/abs/automata-and-automata-mappings-of-semigroups-1506.060042015-06-22 https://scifaro.com/en/abs/a-nivat-theorem-for-weighted-timed-automata-and-weighted-relative-distance-logic-1506.060382015-06-22 https://scifaro.com/en/abs/parikh-matrices-and-parikh-rewriting-systems-1506.064762016-08-04 https://scifaro.com/en/abs/towards-an-algebraic-characterization-of-rational-word-functions-1506.064972015-06-23 https://scifaro.com/en/abs/synchronization-of-bernoulli-sequences-on-shared-letters-1506.065372017-04-27 https://scifaro.com/en/abs/weighted-automata-and-logics-for-infinite-nested-words-1506.070312015-06-24 https://scifaro.com/en/abs/tightening-the-complexity-of-equivalence-problems-for-commutative-grammars-1506.077742015-06-26 https://scifaro.com/en/abs/pure-strategies-in-imperfect-information-stochastic-games-1506.091402018-03-28 https://scifaro.com/en/abs/embedding-rationally-independent-languages-into-maximal-ones-1507.006002015-07-03 https://scifaro.com/en/abs/a-note-on-monitors-and-b-uchi-automata-1507.010202015-07-07 https://scifaro.com/en/abs/automata-and-quantum-computing-1507.019882018-07-05 https://scifaro.com/en/abs/logic-and-branching-automata-1507.028902017-01-11 https://scifaro.com/en/abs/unboundedness-and-downward-closures-of-higher-order-pushdown-automata-1507.033042015-11-06 https://scifaro.com/en/abs/a-theory-of-probabilistic-automata-part-1-1507.051642015-07-21 https://scifaro.com/en/abs/watson-crick-quantum-finite-automata-1507.052822015-12-10 https://scifaro.com/en/abs/reversible-watson-crick-automata-1507.052832015-12-10 https://scifaro.com/en/abs/deterministic-parallel-communicating-watson-crick-automata-systems-1507.052842015-07-21 https://scifaro.com/en/abs/on-boundedness-problems-for-pushdown-vector-addition-systems-1507.073622015-07-28 https://scifaro.com/en/abs/one-tape-turing-machine-variants-and-language-recognition-1507.085822015-07-31 https://scifaro.com/en/abs/normal-forms-for-linear-displacement-context-free-grammars-1507.086002015-07-31 https://scifaro.com/en/abs/closed-palindromic-rich-privileged-trapezoidal-and-balanced-words-in-automatic-sequences-1508.020742015-12-01 https://scifaro.com/en/abs/on-the-number-of-synchronizing-colorings-of-digraphs-1508.021332015-08-11 https://scifaro.com/en/abs/bounded-determinization-of-timed-automata-with-silent-transitions-1508.035752015-08-17 https://scifaro.com/en/abs/a-note-on-the-avoidability-of-binary-patterns-with-variables-and-reversals-1508.045712015-08-20 https://scifaro.com/en/abs/structural-complexity-of-multi-valued-partial-functions-computed-by-nondeterministic-pushdown-automata-1508.058142015-08-25 https://scifaro.com/en/abs/weight-assignment-logic-1508.061212015-08-26 https://scifaro.com/en/abs/translation-like-actions-and-aperiodic-subshifts-on-groups-1508.064192015-08-27 https://scifaro.com/en/abs/on-the-regularity-of-lfloor-log-b-alpha-n-beta-rfloor-n-geq0-1508.064662015-08-27 https://scifaro.com/en/abs/factorizations-of-the-fibonacci-infinite-word-1508.067542015-08-28 https://scifaro.com/en/abs/testing-k-binomial-equivalence-1509.006222017-01-19 https://scifaro.com/en/abs/optimal-searching-of-gapped-repeats-in-a-word-1509.012212015-10-05 https://scifaro.com/en/abs/formalization-of-simplification-for-context-free-grammars-1509.020322015-10-19 https://scifaro.com/en/abs/a-survey-on-operational-state-complexity-1509.032542015-09-11 https://scifaro.com/en/abs/inkdots-as-advice-for-finite-automata-1509.037122023-06-22 https://scifaro.com/en/abs/periods-and-borders-of-random-words-1509.052402019-12-18 https://scifaro.com/en/abs/the-word-problem-for-omega-terms-over-the-trotter-weil-hierarchy-1509.053642017-05-17 https://scifaro.com/en/abs/syntactic-complexity-of-regular-ideals-1509.060322017-01-16 https://scifaro.com/en/abs/level-two-of-the-quantifier-alternation-hierarchy-over-infinite-words-1509.062072015-09-22 https://scifaro.com/en/abs/efficient-algorithms-for-morphisms-over-omega-regular-languages-1509.062152015-11-10 https://scifaro.com/en/abs/tree-automata-1509.062332015-09-22 https://scifaro.com/en/abs/on-the-complexity-of-flanked-finite-state-automata-1509.065012015-09-23 https://scifaro.com/en/abs/synchronous-subsequentiality-and-approximations-to-undecidable-problems-1509.072002015-09-25 https://scifaro.com/en/abs/reachability-analysis-of-reversal-bounded-automata-on-series-parallel-graphs-1509.072022015-09-25 https://scifaro.com/en/abs/an-automata-theoretic-approach-to-the-zero-one-law-for-regular-languages-algorithmic-and-logical-aspects-1509.072092015-09-25 https://scifaro.com/en/abs/boolean-type-retractable-state-finite-automata-without-outputs-1510.002082015-10-06 https://scifaro.com/en/abs/retractable-state-finite-automata-without-outputs-1510.009112015-10-06 https://scifaro.com/en/abs/splicing-systems-from-past-to-future-old-and-new-challenges-1510.015742015-10-07 https://scifaro.com/en/abs/on-the-problem-of-computing-the-probability-of-regular-sets-of-trees-1510.016402015-10-07 https://scifaro.com/en/abs/cross-boundary-behavioural-reprogrammability-reveals-evidence-of-pervasive-universality-1510.016712018-02-02 https://scifaro.com/en/abs/tree-automata-and-tree-grammars-1510.020362015-10-08 https://scifaro.com/en/abs/non-regular-unary-language-and-parallel-communicating-watson-crick-automata-systems-1510.020702015-10-08 https://scifaro.com/en/abs/value-automata-with-filters-1510.023932015-10-09 https://scifaro.com/en/abs/vector-reachability-problem-in-mathrm-sl-2-mathbb-z-1510.032272016-04-28 https://scifaro.com/en/abs/on-insertion-deletion-systems-over-relational-words-1510.032312015-10-13 https://scifaro.com/en/abs/ordered-tree-pushdown-systems-1510.032782015-10-13 https://scifaro.com/en/abs/marking-shortest-paths-on-pushdown-graphs-does-not-preserve-mso-decidability-1510.040002020-10-14 https://scifaro.com/en/abs/multi-head-watson-crick-automata-1510.040162015-12-10 https://scifaro.com/en/abs/a-synchronous-rendering-of-hybrid-systems-for-designing-plant-on-a-chip-poc-1510.043362015-10-16 https://scifaro.com/en/abs/formalization-of-the-pumping-lemma-for-context-free-languages-1510.047482015-10-19 https://scifaro.com/en/abs/linear-context-free-tree-languages-and-inverse-homomorphisms-1510.048812015-10-20 https://scifaro.com/en/abs/shortest-paths-in-one-counter-systems-1510.054602023-06-22 https://scifaro.com/en/abs/forkable-regular-expressions-1510.072932015-12-09 https://scifaro.com/en/abs/varieties-of-unranked-tree-languages-1510.074022015-10-27 https://scifaro.com/en/abs/subsequence-automata-with-default-transitions-1510.087482016-01-20 https://scifaro.com/en/abs/formalization-of-context-free-language-theory-1510.090922015-11-02 https://scifaro.com/en/abs/most-complex-regular-ideal-languages-1511.001572023-06-22 https://scifaro.com/en/abs/invisible-pushdown-languages-1511.002892015-11-03 https://scifaro.com/en/abs/data-language-specification-via-terminal-attribution-1511.009092015-11-04 https://scifaro.com/en/abs/profinite-monads-profinite-equations-and-reiterman-s-theorem-1511.021472016-01-07 https://scifaro.com/en/abs/optimised-determinisation-and-completion-of-finite-tree-automata-1511.035952017-11-02 https://scifaro.com/en/abs/timed-automata-for-modelling-caches-and-pipelines-1511.041722015-11-16 https://scifaro.com/en/abs/context-free-commutative-grammars-with-integer-counters-and-resets-1511.048932016-06-27 https://scifaro.com/en/abs/joining-transition-systems-of-records-some-congruency-and-language-theoretic-results-1511.050702015-11-17 https://scifaro.com/en/abs/on-lr-k-parsers-of-polynomial-size-1511.057702015-11-19 https://scifaro.com/en/abs/on-basic-properties-of-jumping-finite-automata-1511.083962015-12-03 https://scifaro.com/en/abs/two-results-on-discontinuous-input-processing-1511.086422015-11-30 https://scifaro.com/en/abs/quantifier-alternation-for-infinite-words-1511.090112015-12-01 https://scifaro.com/en/abs/synchronizing-automata-and-principal-eigenvectors-of-the-underlying-digraphs-1511.090792015-12-01 https://scifaro.com/en/abs/decidability-of-regular-language-genus-computation-1511.094052019-11-15 https://scifaro.com/en/abs/characterization-and-complexity-results-on-jumping-finite-automata-1512.004822015-12-03 https://scifaro.com/en/abs/dipole-codes-attractively-encode-glue-functions-1512.007792015-12-03 https://scifaro.com/en/abs/on-the-state-complexity-of-the-shuffle-of-regular-languages-1512.011872016-07-18 https://scifaro.com/en/abs/algorithmic-decidability-of-engel-s-property-for-automaton-groups-1512.017172016-06-28 https://scifaro.com/en/abs/hankel-matrices-for-weighted-visibly-pushdown-automata-1512.024302016-06-28 https://scifaro.com/en/abs/on-the-uniform-random-generation-of-non-deterministic-automata-up-to-isomorphism-1512.027972015-12-10 https://scifaro.com/en/abs/distribution-based-bisimulation-and-bisimulation-metric-in-probabilistic-automata-1512.050272015-12-17 https://scifaro.com/en/abs/on-the-hierarchy-of-block-deterministic-languages-1512.054752015-12-18 https://scifaro.com/en/abs/random-generation-and-enumeration-of-accessible-determinisitic-real-time-pushdown-automata-1512.058812016-03-26 https://scifaro.com/en/abs/networks-of-moore-machines-1512.067882026-04-14 https://scifaro.com/en/abs/quick-brown-fox-in-formal-languages-1512.081682016-02-12 https://scifaro.com/en/abs/reduction-of-nondeterministic-tree-automata-1512.088232016-01-07 https://scifaro.com/en/abs/around-context-free-grammars-a-normal-form-a-representation-theorem-and-a-regular-approximation-1512.092072024-01-26 https://scifaro.com/en/abs/fo2-1-on-data-trees-data-tree-automata-and-branching-vector-addition-systems-1601.015792019-03-14 https://scifaro.com/en/abs/an-automaton-learning-approach-to-solving-safety-games-over-infinite-graphs-1601.016602016-01-08 https://scifaro.com/en/abs/predicting-the-large-scale-evolution-of-tag-systems-1601.020142018-02-06 https://scifaro.com/en/abs/efficient-quantile-computation-in-markov-chains-via-counting-problems-for-parikh-images-1601.046612016-01-19 https://scifaro.com/en/abs/on-the-control-of-asynchronous-automata-1601.051762017-08-07 https://scifaro.com/en/abs/unrestricted-state-complexity-of-binary-operations-on-regular-languages-1602.013872016-06-14 https://scifaro.com/en/abs/busy-beaver-machines-and-the-observant-otter-heuristic-or-how-to-tame-dreadful-dragons-1602.032282016-02-11 https://scifaro.com/en/abs/relations-on-words-1602.033642016-02-11 https://scifaro.com/en/abs/complexity-of-regular-abstractions-of-one-counter-languages-1602.034192016-02-11 https://scifaro.com/en/abs/time-window-temporal-logic-1602.042942016-02-16 https://scifaro.com/en/abs/affine-computation-and-affine-automaton-1602.047322016-06-07 https://scifaro.com/en/abs/symmetry-breaking-predicates-for-sat-based-dfa-identification-1602.050282016-02-22 https://scifaro.com/en/abs/language-recognition-power-and-succintness-of-affine-automata-1602.054322017-11-15 https://scifaro.com/en/abs/a-polynomial-time-algorithm-for-reachability-in-branching-vass-in-dimension-one-1602.055472016-05-09 https://scifaro.com/en/abs/repetition-free-derivability-from-a-regular-grammar-is-np-hard-1602.055552016-02-24 https://scifaro.com/en/abs/restricted-deterministic-watson-crick-automata-1602.057212016-02-19 https://scifaro.com/en/abs/eilenberg-theorems-for-free-1602.058312017-02-27 https://scifaro.com/en/abs/one-counter-automata-with-counter-observability-1602.059402016-07-20 https://scifaro.com/en/abs/corrections-to-a-menagerie-of-timed-automata-1602.071652025-08-08 https://scifaro.com/en/abs/primitive-sets-of-nonnegative-matrices-and-synchronizing-automata-1602.075562016-02-25 https://scifaro.com/en/abs/regular-language-distance-and-entropy-1602.077152016-02-26 https://scifaro.com/en/abs/can-one-quantum-bit-separate-any-pair-of-words-with-zero-error-1602.079672016-02-26 https://scifaro.com/en/abs/on-equivalence-and-uniformisation-problems-for-finite-transducers-1602.085652016-03-01 https://scifaro.com/en/abs/on-automatic-subsets-of-the-gaussian-integers-1602.085792016-08-26 https://scifaro.com/en/abs/characterizing-classes-of-regular-languages-using-prefix-codes-of-bounded-synchronization-delay-1602.089812016-03-01 https://scifaro.com/en/abs/piecewise-testable-languages-and-nondeterministic-automata-1603.003612016-09-07 https://scifaro.com/en/abs/minimization-of-b-uchi-automata-using-fair-simulation-1603.011072016-03-04 https://scifaro.com/en/abs/nominal-automata-with-name-binding-1603.014552021-01-22 https://scifaro.com/en/abs/a-software-package-for-chemically-inspired-graph-transformation-1603.024812016-04-22 https://scifaro.com/en/abs/prediction-of-infinite-words-with-automata-1603.025972016-03-09 https://scifaro.com/en/abs/weight-computation-of-regular-tree-languages-1603.029282016-03-10 https://scifaro.com/en/abs/solutions-of-word-equations-over-partially-commutative-structures-1603.029662025-06-11 https://scifaro.com/en/abs/a-ternary-square-free-sequence-avoiding-factors-equivalent-to-abcacba-1603.030592016-03-11 https://scifaro.com/en/abs/a-short-proof-that-o-2-is-an-mcfl-1603.036102016-03-14 https://scifaro.com/en/abs/fuzzy-alternating-mathrm-b-ddot-u-chi-automata-over-distributive-lattices-1603.045412016-03-16 https://scifaro.com/en/abs/operations-on-weakly-recognizing-morphisms-1603.053762016-04-28 https://scifaro.com/en/abs/a-short-note-on-infinite-union-intersection-of-omega-regular-languages-1603.054262016-03-18 https://scifaro.com/en/abs/automatic-theorem-proving-in-walnut-1603.060172021-05-27 https://scifaro.com/en/abs/on-the-star-height-of-factor-counting-languages-and-their-relationship-to-rees-zero-matrix-semigroups-1603.062362016-09-28 https://scifaro.com/en/abs/array-folds-logic-1603.068502016-05-13 https://scifaro.com/en/abs/the-trace-monoids-in-the-queue-monoid-and-in-the-direct-product-of-two-free-monoids-1603.072172016-03-24 https://scifaro.com/en/abs/weighted-pushdown-systems-with-indexed-weight-domains-1603.077902019-03-14 https://scifaro.com/en/abs/homing-vector-automata-1603.091852017-08-01 https://scifaro.com/en/abs/on-word-and-frontier-languages-of-unsafe-higher-order-grammars-1604.015952016-05-23 https://scifaro.com/en/abs/the-complexity-of-synchronizing-markov-decision-processes-1604.019422018-03-28 https://scifaro.com/en/abs/decidability-of-multiset-set-and-numerically-decipherable-directed-figure-codes-1604.021672023-06-22 https://scifaro.com/en/abs/an-extremal-series-of-eulerian-synchronizing-automata-1604.028792016-08-04 https://scifaro.com/en/abs/connected-reversible-mealy-automata-of-prime-size-cannot-generate-infinite-burnside-groups-1604.032702016-04-13 https://scifaro.com/en/abs/logic-for-unambiguous-context-free-languages-1604.041392016-04-15 https://scifaro.com/en/abs/eilenberg-theorems-for-many-sorted-formations-1604.047922024-01-18 https://scifaro.com/en/abs/permutations-of-context-free-et0l-and-indexed-languages-1604.054312016-05-31 https://scifaro.com/en/abs/on-number-conservation-of-non-uniform-cellular-automata-1604.066002016-04-25 https://scifaro.com/en/abs/derivative-based-diagnosis-of-regular-expression-ambiguity-1604.066442016-07-14 https://scifaro.com/en/abs/quantitative-automata-under-probabilistic-semantics-1604.067642023-06-22 https://scifaro.com/en/abs/syntactic-complexity-of-bifix-free-languages-1604.069362018-10-09 https://scifaro.com/en/abs/minimizing-expected-cost-under-hard-boolean-constraints-with-applications-to-quantitative-synthesis-1604.070642016-04-26 https://scifaro.com/en/abs/the-complexity-of-fixed-height-patterned-tile-self-assembly-1604.071902017-03-31 https://scifaro.com/en/abs/analyzing-timed-systems-using-tree-automata-1604.084432023-06-22 https://scifaro.com/en/abs/stack-and-register-complexity-of-radix-conversions-1604.088782016-05-02 https://scifaro.com/en/abs/linear-distances-between-markov-chains-1605.001862016-06-27 https://scifaro.com/en/abs/the-diagonal-problem-for-higher-order-recursion-schemes-is-decidable-1605.003712016-05-03 https://scifaro.com/en/abs/derivatives-for-enhanced-regular-expressions-1605.008172016-05-04 https://scifaro.com/en/abs/the-commutativity-problem-of-the-mapreduce-framework-a-transducer-based-approach-1605.014972016-10-03 https://scifaro.com/en/abs/derived-term-automata-for-extended-weighted-rational-expressions-1605.015302016-05-06 https://scifaro.com/en/abs/sch-utzenberger-products-in-a-category-1605.018102016-05-09 https://scifaro.com/en/abs/topological-language-for-rna-1605.026282016-05-10 https://scifaro.com/en/abs/the-complexity-of-downward-closure-comparisons-1605.031492016-05-11 https://scifaro.com/en/abs/a-relatively-small-turing-machine-whose-behavior-is-independent-of-set-theory-1605.043432016-05-17 https://scifaro.com/en/abs/on-the-gap-between-separating-words-and-separating-their-reversals-1605.048352018-02-13 https://scifaro.com/en/abs/montre-a-tool-for-monitoring-timed-regular-expressions-1605.059632019-02-13 https://scifaro.com/en/abs/complexity-of-prefix-convex-regular-languages-1605.066972016-06-27 https://scifaro.com/en/abs/on-restricted-nonnegative-matrix-factorization-1605.070612016-05-24 https://scifaro.com/en/abs/a-free-energy-foundation-of-semantic-similarity-in-automata-and-languages-1605.072242016-09-15 https://scifaro.com/en/abs/learning-moore-machines-from-input-output-traces-1605.078052016-09-05 https://scifaro.com/en/abs/a-counterexample-to-thiagarajan-s-conjecture-on-regular-event-structures-1605.082882020-12-16 https://scifaro.com/en/abs/construction-of-non-expandable-non-overlapping-sets-of-pictures-1605.090612016-05-31 https://scifaro.com/en/abs/amenability-of-groups-is-characterized-by-myhill-s-theorem-1605.091332016-06-09 https://scifaro.com/en/abs/on-level-transitivity-and-exponential-growth-1605.095792016-08-18 https://scifaro.com/en/abs/two-way-visibly-pushdown-automata-and-transducers-1606.002342016-06-02 https://scifaro.com/en/abs/on-the-complexity-and-decidability-of-some-problems-involving-shuffle-1606.011992019-03-08 https://scifaro.com/en/abs/prefix-frequency-of-lost-positions-1606.012742019-12-18 https://scifaro.com/en/abs/transducer-based-rewriting-games-for-active-xml-1606.028792016-06-10 https://scifaro.com/en/abs/an-automata-characterisation-for-multiple-context-free-languages-1606.029752016-09-26 https://scifaro.com/en/abs/decidable-characterization-of-fo2-1-and-locality-of-da-1606.032172018-03-28 https://scifaro.com/en/abs/nested-weighted-limit-average-automata-of-bounded-width-1606.035982016-06-14 https://scifaro.com/en/abs/deciding-equivalence-of-linear-tree-to-word-transducers-in-polynomial-time-1606.037582016-06-14 https://scifaro.com/en/abs/a-chomsky-sch-utzenberger-representation-for-weighted-multiple-context-free-languages-1606.039822016-11-29 https://scifaro.com/en/abs/greedy-palindromic-lengths-1606.056602016-06-21 https://scifaro.com/en/abs/a-boyer-moore-type-algorithm-for-timed-pattern-matching-1606.072072018-10-22 https://scifaro.com/en/abs/representing-extended-finite-state-machines-for-sdl-by-a-novel-control-model-of-discrete-event-systems-1606.075852018-07-24 https://scifaro.com/en/abs/on-parametrized-verification-of-asynchronous-shared-memory-pushdown-systems-1606.087072016-07-19 https://scifaro.com/en/abs/complexity-bounds-of-constant-space-quantum-computation-1606.087642016-06-29 https://scifaro.com/en/abs/completely-reachable-automata-1607.005542016-07-05 https://scifaro.com/en/abs/2-tape-1-way-quantum-finite-state-automata-1607.008112016-07-05 https://scifaro.com/en/abs/deletion-operations-on-deterministic-families-of-automata-1607.009312019-03-08 https://scifaro.com/en/abs/a-note-on-nested-string-replacements-1607.018282016-07-08 https://scifaro.com/en/abs/a-survey-of-cellular-automata-types-dynamics-non-uniformity-and-applications-1607.022912024-01-17 https://scifaro.com/en/abs/experiments-with-synchronizing-automata-1607.040252016-07-15 https://scifaro.com/en/abs/state-complexity-of-multiple-catenation-1607.040312016-07-15 https://scifaro.com/en/abs/fo-definable-transformations-of-infinite-strings-1607.049102016-07-20 https://scifaro.com/en/abs/on-the-complexity-of-automatic-complexity-1607.061062020-02-03 https://scifaro.com/en/abs/learning-nominal-automata-1607.062682018-12-18 https://scifaro.com/en/abs/automatic-complexity-of-shift-register-sequences-1607.082262020-01-31 https://scifaro.com/en/abs/two-buffer-simulation-games-1608.006542016-08-03 https://scifaro.com/en/abs/derived-term-automata-of-multitape-rational-expressions-long-version-1608.007492016-08-03 https://scifaro.com/en/abs/approximating-the-maximum-number-of-synchronizing-states-in-automata-1608.008892016-09-20 https://scifaro.com/en/abs/synchronizing-automata-with-extremal-properties-1608.012682016-08-04 https://scifaro.com/en/abs/few-paths-fewer-words-model-selection-with-automatic-structure-functions-1608.013992016-08-05 https://scifaro.com/en/abs/state-machines-for-large-scale-computer-software-and-systems-1608.017122025-11-04 https://scifaro.com/en/abs/on-the-regular-emptiness-problem-of-subzero-automata-1608.033192016-08-12 https://scifaro.com/en/abs/nominal-cellular-automata-1608.033202016-08-12 https://scifaro.com/en/abs/supervisor-synthesis-to-thwart-cyber-attack-with-bounded-sensor-reading-alterations-1608.041032016-08-26 https://scifaro.com/en/abs/the-frobenius-problem-for-the-shuffle-operation-1608.085922016-08-31 https://scifaro.com/en/abs/deleting-powers-in-words-1608.086892017-12-08 https://scifaro.com/en/abs/separability-of-reachability-sets-of-vector-addition-systems-1609.002142016-09-02 https://scifaro.com/en/abs/language-classes-associated-with-automata-over-matrix-groups-1609.003962016-09-05 https://scifaro.com/en/abs/modeling-refining-and-analyzing-incomplete-b-uchi-automata-1609.006102016-09-05 https://scifaro.com/en/abs/omega-automata-1609.030622016-09-13 https://scifaro.com/en/abs/complexity-of-universality-and-related-problems-for-partially-ordered-nfas-1609.034602017-11-15 https://scifaro.com/en/abs/bounded-oscillation-pushdown-automata-1609.040962016-09-15 https://scifaro.com/en/abs/multi-buffer-simulations-for-trace-language-inclusion-1609.040982016-09-15 https://scifaro.com/en/abs/the-almost-equivalence-by-asymptotic-probabilities-for-regular-languages-and-its-computational-complexities-1609.041012016-09-15 https://scifaro.com/en/abs/unrestricted-state-complexity-of-binary-operations-on-regular-and-ideal-languages-1609.044392017-12-22 https://scifaro.com/en/abs/the-complexity-of-flat-freeze-ltl-1609.061242023-06-22 https://scifaro.com/en/abs/nested-words-for-order-2-pushdown-systems-1609.062902016-09-21 https://scifaro.com/en/abs/slowly-synchronizing-automata-with-fixed-alphabet-size-1609.068532017-12-15 https://scifaro.com/en/abs/pro-aperiodic-monoids-via-saturated-models-1609.077362017-08-30 https://scifaro.com/en/abs/study-of-parameterized-chain-networks-1609.095552016-10-03 https://scifaro.com/en/abs/on-the-complexity-of-bounded-context-switching-1609.097282017-04-25 https://scifaro.com/en/abs/l-convex-polyominoes-are-recognizable-in-real-time-by-2d-cellular-automata-1610.003232016-10-04 https://scifaro.com/en/abs/comparing-1d-and-2d-real-time-on-cellular-automata-1610.003312016-10-04 https://scifaro.com/en/abs/5-state-rotation-symmetric-number-conserving-cellular-automata-are-not-strongly-universal-1610.003332016-10-04 https://scifaro.com/en/abs/a-linear-acceleration-theorem-for-2d-cellular-automata-on-all-complete-neighborhoods-1610.003382016-10-04 https://scifaro.com/en/abs/complexity-of-left-ideal-suffix-closed-and-suffix-free-regular-languages-1610.007282016-10-05 https://scifaro.com/en/abs/decision-problems-on-unary-probabilistic-and-quantum-automata-1610.013972016-10-06 https://scifaro.com/en/abs/a-symbolic-decision-procedure-for-symbolic-alternating-finite-automata-1610.017222016-10-07 https://scifaro.com/en/abs/generating-candidate-busy-beaver-machines-or-how-to-build-the-zany-zoo-1610.031842016-10-12 https://scifaro.com/en/abs/morphisms-on-infinite-alphabets-countable-states-automata-and-regular-sequences-1610.039712017-05-24 https://scifaro.com/en/abs/b-uchi-automata-recognizing-sets-of-reals-definable-in-first-order-logic-with-addition-and-order-1610.060272016-11-14 https://scifaro.com/en/abs/on-finite-index-indexed-grammars-and-their-restrictions-1610.063662022-12-08 https://scifaro.com/en/abs/partial-derivatives-for-context-free-languages-from-mu-regular-expressions-to-pushdown-automata-1610.068322017-01-03 https://scifaro.com/en/abs/an-alternating-automaton-for-first-order-linear-temporal-logic-tech-report-1610.070802016-10-25 https://scifaro.com/en/abs/not-all-multi-valued-partial-cfl-functions-are-refined-by-single-valued-functions-1610.071752020-04-27 https://scifaro.com/en/abs/a-language-theoretic-view-on-network-protocols-1610.071982017-07-11 https://scifaro.com/en/abs/a-novel-learning-algorithm-for-b-uchi-automata-based-on-family-of-dfas-and-classification-trees-1610.073802017-01-18 https://scifaro.com/en/abs/generating-the-functions-with-regular-graphs-under-composition-1610.075352016-10-25 https://scifaro.com/en/abs/operational-calculus-for-differentiable-programming-1610.076902019-01-08 https://scifaro.com/en/abs/finding-minimum-and-maximum-termination-time-of-timed-automata-models-with-cyclic-behaviour-1610.097952016-11-01 https://scifaro.com/en/abs/compositional-reasoning-for-shared-variable-concurrent-programs-1611.005742018-03-28 https://scifaro.com/en/abs/marciani-normal-form-of-context-free-grammars-1611.018662016-11-08 https://scifaro.com/en/abs/finite-state-independence-1611.039212017-11-07 https://scifaro.com/en/abs/some-conjectures-on-codes-1611.045802016-11-15 https://scifaro.com/en/abs/generalized-lr-parsing-and-the-shuffle-operator-1611.058312016-11-18 https://scifaro.com/en/abs/optimal-test-sets-for-context-free-languages-1611.067032016-11-22 https://scifaro.com/en/abs/minimal-and-reduced-reversible-automata-1611.068402016-11-22 https://scifaro.com/en/abs/asynchronous-distributed-automata-a-characterization-of-the-modal-mu-fragment-1611.085542018-05-18 https://scifaro.com/en/abs/on-the-complexity-of-the-word-problem-for-automaton-semigroups-and-automaton-groups-1611.095412017-06-29 https://scifaro.com/en/abs/how-to-measure-the-topological-quality-of-protein-grammars-1611.100782017-01-30 https://scifaro.com/en/abs/some-subclasses-of-linear-languages-based-on-nondeterministic-linear-automata-1611.102762016-12-01 https://scifaro.com/en/abs/a-graph-grammar-for-modelling-rna-folding-1612.016392016-12-07 https://scifaro.com/en/abs/on-the-computational-power-of-affine-automata-1612.018702018-06-19 https://scifaro.com/en/abs/comparison-of-max-plus-automata-and-joint-spectral-radius-of-tropical-matrices-1612.026472017-03-06 https://scifaro.com/en/abs/on-the-synchronization-of-planar-automata-1612.044622016-12-15 https://scifaro.com/en/abs/on-nonlinear-prices-in-timed-automata-1612.049762016-12-16 https://scifaro.com/en/abs/reducing-nondeterministic-tree-automata-by-adding-transitions-1612.049812016-12-16 https://scifaro.com/en/abs/runtime-enforcement-of-reactive-systems-using-synchronous-enforcers-1612.050302016-12-16 https://scifaro.com/en/abs/minimum-critical-exponents-for-palindromes-1612.053202016-12-21 https://scifaro.com/en/abs/regular-separability-of-parikh-automata-1612.062332016-12-20 https://scifaro.com/en/abs/syntactic-structures-of-regular-languages-1612.062472017-11-30 https://scifaro.com/en/abs/on-incomplete-and-synchronizing-finite-sets-1612.078812016-12-26 https://scifaro.com/en/abs/families-of-dfas-as-acceptors-of-omega-regular-languages-1612.081542023-06-22 https://scifaro.com/en/abs/sound-structure-preserving-transformation-for-weakly-left-linear-deterministic-conditional-term-rewriting-systems-1701.006502017-01-04 https://scifaro.com/en/abs/an-overview-of-recent-solutions-to-and-lower-bounds-for-the-firing-synchronization-problem-1701.010452017-01-05 https://scifaro.com/en/abs/on-the-number-of-gapped-repeats-with-arbitrary-gap-1701.011902017-01-06 https://scifaro.com/en/abs/backward-deterministic-and-weak-alternating-omega-automata-1701.019712017-01-10 https://scifaro.com/en/abs/untwisting-two-way-transducers-in-elementary-time-1701.025022017-01-11 https://scifaro.com/en/abs/regular-separability-of-one-counter-automata-1701.028082023-06-22 https://scifaro.com/en/abs/on-delay-and-regret-determinization-of-max-plus-automata-1701.029032017-03-06 https://scifaro.com/en/abs/on-the-upward-downward-closures-of-petri-nets-1701.029272018-04-09 https://scifaro.com/en/abs/liveness-verification-and-synthesis-new-algorithms-for-recursive-programs-1701.029472017-01-12 https://scifaro.com/en/abs/logics-for-word-transductions-with-synthesis-1701.036702018-05-31 https://scifaro.com/en/abs/complexity-of-regular-bifix-free-languages-1701.037682017-01-16 https://scifaro.com/en/abs/most-complex-non-returning-regular-languages-1701.039442017-01-17 https://scifaro.com/en/abs/polynomial-time-proactive-synthesis-of-tree-to-string-functions-from-examples-1701.042882017-05-25 https://scifaro.com/en/abs/degree-of-sequentiality-of-weighted-automata-1701.046322017-01-18 https://scifaro.com/en/abs/up-to-techniques-for-weighted-systems-extended-version-1701.050012017-01-24 https://scifaro.com/en/abs/minimization-of-visibly-pushdown-automata-using-partial-max-sat-1701.051602017-04-19 https://scifaro.com/en/abs/parallel-graph-rewriting-with-overlapping-rules-1701.067902017-01-25 https://scifaro.com/en/abs/a-new-lower-bound-for-reset-threshold-of-synchronizing-automata-with-sink-state-1701.079542017-01-30 https://scifaro.com/en/abs/a-load-buffer-semantics-for-total-store-ordering-1701.086822023-06-22 https://scifaro.com/en/abs/weighted-omega-restricted-one-counter-automata-1701.087032023-06-22 https://scifaro.com/en/abs/pushing-for-weighted-tree-automata-1702.003042023-06-22 https://scifaro.com/en/abs/finite-state-independence-and-normal-sequences-1702.003202018-07-10 https://scifaro.com/en/abs/word-equations-in-linear-space-1702.007362020-10-19 https://scifaro.com/en/abs/primitivity-uniform-minimality-and-state-complexity-of-boolean-operations-1702.008772018-03-28 https://scifaro.com/en/abs/undecidability-and-finite-automata-1702.013942017-03-01 https://scifaro.com/en/abs/a-short-proof-of-correctness-of-the-quasi-polynomial-time-algorithm-for-parity-games-1702.019532017-04-25 https://scifaro.com/en/abs/a-novel-type-of-automata-for-dynamic-heterogeneous-and-random-architectures-1702.022402017-03-07 https://scifaro.com/en/abs/unveiling-eilenberg-type-correspondences-birkhoff-s-theorem-for-finite-algebras-duality-1702.028222017-02-10 https://scifaro.com/en/abs/the-word-problem-of-mathbb-z-n-is-a-multiple-context-free-language-1702.029262017-09-06 https://scifaro.com/en/abs/an-efficient-algorithm-to-decide-periodicity-of-b-recognisable-sets-using-msdf-convention-1702.037152017-02-14 https://scifaro.com/en/abs/existential-length-universality-1702.039612020-03-11 https://scifaro.com/en/abs/automata-theory-on-sliding-windows-1702.043762018-01-08 https://scifaro.com/en/abs/weighted-operator-precedence-languages-1702.045972017-02-16 https://scifaro.com/en/abs/towards-a-theory-of-complexity-of-regular-languages-1702.050242017-02-17 https://scifaro.com/en/abs/regular-separability-of-well-structured-transition-systems-1702.053342018-07-06 https://scifaro.com/en/abs/improving-the-upper-bound-on-the-length-of-the-shortest-reset-words-1702.054552018-04-02 https://scifaro.com/en/abs/on-the-comparison-of-context-free-grammars-1702.059452018-04-23 https://scifaro.com/en/abs/computing-the-longest-common-prefix-of-a-context-free-language-in-polynomial-time-1702.066982018-01-09 https://scifaro.com/en/abs/emptiness-of-zero-automata-is-decidable-1702.068582017-03-29 https://scifaro.com/en/abs/on-reversible-transducers-1702.071572017-02-24 https://scifaro.com/en/abs/on-store-languages-of-language-acceptors-1702.073882019-03-08 https://scifaro.com/en/abs/featured-weighted-automata-1702.074842017-02-28 https://scifaro.com/en/abs/the-hardness-of-solving-simple-word-equations-1702.079222017-03-01 https://scifaro.com/en/abs/bisimulation-metrics-for-weighted-automata-1702.080172017-05-16 https://scifaro.com/en/abs/a-survey-on-difference-hierarchies-of-regular-languages-1702.080232023-06-22 https://scifaro.com/en/abs/the-linear-nature-of-pseudowords-1702.080832019-06-26 https://scifaro.com/en/abs/synchronization-problems-in-automata-without-non-trivial-cycles-1702.081442017-12-08 https://scifaro.com/en/abs/two-strings-at-hamming-distance-1-cannot-be-both-quasiperiodic-1703.001952017-03-02 https://scifaro.com/en/abs/commutative-positive-varieties-of-languages-1703.021542019-03-18 https://scifaro.com/en/abs/exact-affine-counter-automata-1703.042812017-08-23 https://scifaro.com/en/abs/some-connections-between-universal-algebra-and-logics-for-trees-1703.047362017-03-16 https://scifaro.com/en/abs/a-quasi-linear-time-algorithm-deciding-whether-weak-b-uchi-automata-reading-vectors-of-reals-recognize-saturated-languages-1703.048342017-03-16 https://scifaro.com/en/abs/green-s-relations-in-finite-transformation-semigroups-1703.049412017-03-16 https://scifaro.com/en/abs/soundness-in-negotiations-1703.051372023-06-22 https://scifaro.com/en/abs/subset-synchronization-in-monotonic-automata-1703.063562017-11-27 https://scifaro.com/en/abs/deriving-generic-bounds-for-time-series-constraints-based-on-regular-expressions-characteristics-1703.067832017-03-21 https://scifaro.com/en/abs/approximation-of-weighted-automata-with-storage-1703.099102017-09-08 https://scifaro.com/en/abs/parikh-reducing-church-rosser-representations-for-some-classes-of-regular-languages-1703.100562017-03-30 https://scifaro.com/en/abs/birecurrent-sets-1703.100812018-04-06 https://scifaro.com/en/abs/on-computational-complexity-of-set-automata-1704.037302017-10-30 https://scifaro.com/en/abs/register-automata-with-linear-arithmetic-1704.039722017-05-18 https://scifaro.com/en/abs/on-the-interplay-between-babai-and-cerny-s-conjectures-1704.040472017-08-08 https://scifaro.com/en/abs/specifying-graph-languages-with-type-graphs-1704.052632017-04-24 https://scifaro.com/en/abs/calf-categorical-automata-learning-framework-1704.056762017-06-27 https://scifaro.com/en/abs/control-improvisation-1704.063192017-04-24 https://scifaro.com/en/abs/brzozowski-goes-concurrent-a-kleene-theorem-for-pomset-languages-1704.071992023-02-03 https://scifaro.com/en/abs/separability-by-piecewise-testable-languages-is-ptime-complete-1704.078562017-11-20 https://scifaro.com/en/abs/universality-of-confluent-self-loop-deterministic-partially-ordered-nfas-is-hard-1704.078602017-04-27 https://scifaro.com/en/abs/optimizing-automata-learning-via-monads-1704.080552019-11-04 https://scifaro.com/en/abs/preimage-problems-for-deterministic-finite-automata-1704.082332020-09-22 https://scifaro.com/en/abs/busy-beaver-scores-and-alphabet-size-1704.087522017-05-01 https://scifaro.com/en/abs/stream-processing-using-grammars-and-regular-expressions-1704.088202017-05-01 https://scifaro.com/en/abs/generalizing-input-driven-languages-theoretical-and-practical-benefits-1705.009842017-05-03 https://scifaro.com/en/abs/emptiness-problems-for-distributed-automata-1705.026092017-09-08 https://scifaro.com/en/abs/on-the-height-of-towers-of-subsequences-and-prefixes-1705.028132019-12-18 https://scifaro.com/en/abs/ten-conferences-words-open-problems-and-conjectures-1705.040552017-05-12 https://scifaro.com/en/abs/the-impact-of-alternation-1705.056062017-08-17 https://scifaro.com/en/abs/a-characterization-of-infinite-lsp-words-1705.057862017-05-17 https://scifaro.com/en/abs/new-directions-in-cellular-automata-1705.058322017-05-18 https://scifaro.com/en/abs/completeness-theorems-for-pomset-languages-and-concurrent-kleene-algebras-1705.058962017-05-18 https://scifaro.com/en/abs/weighted-regular-tree-grammars-with-storage-1705.066812023-06-22 https://scifaro.com/en/abs/state-complexity-of-reversals-of-deterministic-finite-automata-with-output-1705.071502017-10-19 https://scifaro.com/en/abs/rewriting-context-free-families-of-string-diagrams-1705.075202017-05-23 https://scifaro.com/en/abs/on-winning-shifts-of-marked-uniform-substitutions-1705.087472019-09-17 https://scifaro.com/en/abs/higher-order-operator-precedence-languages-1705.090932017-08-23 https://scifaro.com/en/abs/regularity-of-languages-generated-by-non-context-free-grammars-over-a-singleton-terminal-alphabet-1705.096952018-07-13 https://scifaro.com/en/abs/variations-of-checking-stack-automata-obtaining-unexpected-decidability-properties-1705.097322019-03-08 https://scifaro.com/en/abs/inverse-lyndon-words-and-inverse-lyndon-factorizations-of-words-1705.102772018-09-06 https://scifaro.com/en/abs/reversible-languages-having-finitely-many-reduced-automata-1705.105332017-08-23 https://scifaro.com/en/abs/on-the-decidability-of-k-block-determinism-1705.106252017-05-31 https://scifaro.com/en/abs/grammatical-inference-as-a-satisfiability-modulo-theories-problem-1705.106392017-05-31 https://scifaro.com/en/abs/pumping-lemma-for-higher-order-languages-1705.106992017-05-31 https://scifaro.com/en/abs/one-way-definability-of-two-way-word-transducers-1706.016682023-06-22 https://scifaro.com/en/abs/myhill-nerode-relation-for-sequentiable-structures-1706.029102017-06-12 https://scifaro.com/en/abs/simulations-and-antichains-for-efficient-handling-of-finite-automata-1706.032082017-06-13 https://scifaro.com/en/abs/toward-uniform-random-generation-in-1-safe-petri-nets-1706.058882017-06-20 https://scifaro.com/en/abs/signal-machine-and-cellular-automaton-time-optimal-quasi-solutions-of-the-firing-squad-mob-synchronisation-problem-on-connected-graphs-1706.058932017-06-20 https://scifaro.com/en/abs/turing-completeness-of-finite-epistemic-programs-1706.068452017-06-22 https://scifaro.com/en/abs/parikh-image-of-pushdown-automata-1706.083152017-06-27 https://scifaro.com/en/abs/bidirectional-nested-weighted-automata-1706.083162017-06-27 https://scifaro.com/en/abs/decidable-weighted-expressions-with-presburger-combinators-1706.088552017-06-28 https://scifaro.com/en/abs/efficient-online-timed-pattern-matching-by-automata-based-skipping-1706.091742018-10-22 https://scifaro.com/en/abs/sums-of-palindromes-an-approach-via-automata-1706.102062017-09-01 https://scifaro.com/en/abs/church-rosser-systems-codes-with-bounded-synchronization-delay-and-local-rees-extensions-1707.001012017-07-04 https://scifaro.com/en/abs/streamability-of-nested-word-transductions-1707.005272023-06-22 https://scifaro.com/en/abs/compositions-of-functions-and-permutations-specified-by-minimal-reaction-systems-1707.013442017-07-06 https://scifaro.com/en/abs/linear-parsing-expression-grammars-1707.018142017-09-12 https://scifaro.com/en/abs/controlling-a-population-1707.020582017-07-10 https://scifaro.com/en/abs/towards-an-efficient-tree-automata-based-technique-for-timed-systems-1707.022972017-07-11 https://scifaro.com/en/abs/state-complexity-of-catenation-combined-with-boolean-operations-1707.031742017-07-12 https://scifaro.com/en/abs/multiple-context-free-tree-grammars-lexicalization-and-characterization-1707.034572017-07-13 https://scifaro.com/en/abs/two-dimensional-pattern-languages-1707.040832017-07-14 https://scifaro.com/en/abs/a-polynomial-time-match-test-for-large-classes-of-extended-regular-expressions-1707.040972017-07-14 https://scifaro.com/en/abs/paws-a-tool-for-the-analysis-of-weighted-systems-1707.041252017-07-14 https://scifaro.com/en/abs/automatic-randomness-tests-1707.041602017-09-20 https://scifaro.com/en/abs/non-locality-of-the-meet-levels-of-the-trotter-weil-hierarchy-1707.044412017-07-17 https://scifaro.com/en/abs/minimal-forbidden-factors-of-circular-words-1707.044502018-05-28 https://scifaro.com/en/abs/outfix-guided-insertion-1707.046512017-07-18 https://scifaro.com/en/abs/the-power-of-constraint-grammars-revisited-1707.051152017-07-18 https://scifaro.com/en/abs/language-approximation-with-one-counter-automata-1707.076702017-07-26 https://scifaro.com/en/abs/generalized-results-on-monoids-as-memory-1707.097932017-08-23 https://scifaro.com/en/abs/distinct-squares-in-circular-words-1708.006392017-08-03 https://scifaro.com/en/abs/synchronizing-automata-and-the-language-of-minimal-reset-words-1708.048642017-08-17 https://scifaro.com/en/abs/communicating-timed-processes-with-perfect-timed-channels-1708.050632018-03-20 https://scifaro.com/en/abs/to-infinity-and-beyond-1708.061732017-09-05 https://scifaro.com/en/abs/proceedings-15th-international-conference-on-automata-and-formal-languages-1708.062262017-08-22 https://scifaro.com/en/abs/an-efficient-algorithm-to-decide-periodicity-of-b-recognisable-sets-using-lsdf-convention-1708.062282023-06-22 https://scifaro.com/en/abs/tissue-p-systems-with-vesicles-of-multisets-1708.064582017-08-23 https://scifaro.com/en/abs/unavoidable-sets-of-partial-words-of-uniform-length-1708.064592017-08-23 https://scifaro.com/en/abs/on-the-descriptional-complexity-of-operations-on-semilinear-sets-1708.064602017-08-23 https://scifaro.com/en/abs/dyck-words-lattice-paths-and-abelian-borders-1708.064612017-08-23 https://scifaro.com/en/abs/constructing-words-with-high-distinct-square-densities-1708.064622017-08-23 https://scifaro.com/en/abs/the-triple-pair-construction-for-weighted-omega-pushdown-automata-1708.064632017-08-23 https://scifaro.com/en/abs/input-driven-double-head-pushdown-automata-1708.064642017-08-23 https://scifaro.com/en/abs/weakly-and-strongly-irreversible-regular-languages-1708.064652017-08-23 https://scifaro.com/en/abs/descriptional-complexity-of-non-unary-self-verifying-symmetric-difference-automata-1708.064662017-08-23 https://scifaro.com/en/abs/cd-grammar-systems-with-two-propagating-scattered-context-components-characterize-the-family-of-context-sensitive-languages-1708.064672017-08-23 https://scifaro.com/en/abs/a-new-sensing-5-3-watson-crick-automata-concept-1708.064692017-08-23 https://scifaro.com/en/abs/on-h-lexicalized-restarting-automata-1708.064702017-08-23 https://scifaro.com/en/abs/a-computational-interpretation-of-context-free-expressions-1708.073662017-08-25 https://scifaro.com/en/abs/b-uchi-vass-recognise-w-languages-that-are-sigma-1-1-complete-1708.096582017-10-10 https://scifaro.com/en/abs/mk-fuzzy-automata-and-mso-logics-1709.020982017-09-08 https://scifaro.com/en/abs/ltl-to-deterministic-emerson-lei-automata-1709.021022017-09-08 https://scifaro.com/en/abs/trading-bounds-for-memory-in-games-with-counters-1709.031212017-09-12 https://scifaro.com/en/abs/two-recursively-inseparable-problems-for-probabilistic-automata-1709.031222017-09-12 https://scifaro.com/en/abs/verification-of-asynchronous-systems-with-an-unspecified-component-1709.032452017-09-14 https://scifaro.com/en/abs/neural-network-based-nonlinear-weighted-finite-automata-1709.043802017-12-22 https://scifaro.com/en/abs/computing-maximal-expected-termination-time-of-probabilistic-timed-automata-1709.071712018-03-23 https://scifaro.com/en/abs/directable-fuzzy-and-nondeterministic-automata-1709.077192017-09-25 https://scifaro.com/en/abs/a-new-indexed-approach-to-render-the-attractors-of-kleinian-groups-1709.080182017-09-26 https://scifaro.com/en/abs/widths-of-regular-and-context-free-languages-1709.086962019-12-10 https://scifaro.com/en/abs/reachability-switching-games-1709.089912023-06-22 https://scifaro.com/en/abs/adding-successor-a-transfer-theorem-for-separation-and-covering-1709.100522017-09-29 https://scifaro.com/en/abs/two-way-two-tape-automata-1710.002132017-10-03 https://scifaro.com/en/abs/implementation-of-the-algorithm-for-testing-an-automaton-for-synchronization-in-linear-expected-time-1710.002582017-10-03 https://scifaro.com/en/abs/synchronizing-data-words-for-register-automata-1710.023292019-06-11 https://scifaro.com/en/abs/concurrent-kleene-algebra-free-model-and-completeness-1710.027872023-02-03 https://scifaro.com/en/abs/how-deterministic-are-good-for-games-automata-1710.041152017-10-12 https://scifaro.com/en/abs/generic-results-for-concatenation-hierarchies-1710.043132017-10-13 https://scifaro.com/en/abs/average-stack-cost-of-buechi-pushdown-automata-1710.044902017-10-13 https://scifaro.com/en/abs/the-trees-of-hanoi-1710.045512017-10-13 https://scifaro.com/en/abs/a-topological-proof-that-o-2-is-2-mcfl-1710.045972017-11-01 https://scifaro.com/en/abs/a-new-technique-for-reachability-of-states-in-concatenation-automata-1710.050612017-10-19 https://scifaro.com/en/abs/state-complexity-of-overlap-assembly-1710.060002018-12-13 https://scifaro.com/en/abs/ltl-semantic-tableaux-and-alternating-omega-automata-via-linear-factors-1710.066782017-10-19 https://scifaro.com/en/abs/the-emptiness-problem-for-valence-automata-over-graph-monoids-1710.075282017-10-23 https://scifaro.com/en/abs/approximate-reduction-of-finite-automata-for-high-speed-network-intrusion-detection-technical-report-1710.086472018-02-22 https://scifaro.com/en/abs/minimal-synthesis-of-string-to-string-functions-from-examples-1710.092082018-06-06 https://scifaro.com/en/abs/proving-parikh-s-theorem-using-chomsky-schutzenberger-theorem-1710.096122018-06-14 https://scifaro.com/en/abs/deciding-confluence-and-normal-form-properties-of-ground-term-rewrite-systems-efficiently-1710.109912023-06-22 https://scifaro.com/en/abs/sturmian-numeration-systems-and-decompositions-to-palindromes-1710.115532018-07-13 https://scifaro.com/en/abs/a-bound-for-the-shortest-reset-words-for-semisimple-synchronizing-automata-via-the-packing-number-1711.006512023-02-06 https://scifaro.com/en/abs/on-automata-recognizing-birecurrent-sets-1711.010612017-11-10 https://scifaro.com/en/abs/language-properties-and-grammar-of-parallel-and-series-parallel-languages-1711.017992017-11-07 https://scifaro.com/en/abs/automata-minimization-a-functorial-approach-1711.030632017-11-09 https://scifaro.com/en/abs/recurrent-neural-networks-as-weighted-language-recognizers-1711.054082018-03-06 https://scifaro.com/en/abs/singular-value-automata-and-approximate-minimization-1711.059942019-11-13 https://scifaro.com/en/abs/automata-in-the-category-of-glued-vector-spaces-1711.060652017-11-17 https://scifaro.com/en/abs/event-clock-nested-automata-1711.083142017-11-23 https://scifaro.com/en/abs/the-intersection-problem-for-finite-monoids-1711.087172018-02-05 https://scifaro.com/en/abs/random-words-in-a-weighted-regular-language-a-free-energy-approach-1711.089632017-11-27 https://scifaro.com/en/abs/most-complex-deterministic-union-free-regular-languages-1711.091492018-01-04 https://scifaro.com/en/abs/efficient-reduction-of-nondeterministic-automata-with-application-to-language-inclusion-testing-1711.099462023-06-22 https://scifaro.com/en/abs/timed-comparisons-of-semi-markov-processes-1711.102162017-12-04 https://scifaro.com/en/abs/ctl-synthesis-via-ltl-synthesis-1711.106362017-11-30 https://scifaro.com/en/abs/a-taxonomy-of-morphic-sequences-1711.108072017-11-30 https://scifaro.com/en/abs/biased-majority-rule-cellular-automata-1711.109202017-11-30 https://scifaro.com/en/abs/verifying-probabilistic-timed-automata-against-omega-regular-dense-time-properties-1712.002752018-06-14 https://scifaro.com/en/abs/lower-bounds-on-regular-expression-size-1712.008112017-12-08 https://scifaro.com/en/abs/on-co-counter-fragments-of-automata-1712.052272017-12-15 https://scifaro.com/en/abs/self-organization-and-the-maximum-empower-principle-in-the-framework-of-max-plus-algebra-1712.057982019-06-26 https://scifaro.com/en/abs/automaton-semigroups-and-groups-on-the-undecidability-of-problems-related-to-freeness-and-finiteness-1712.074082020-04-10 https://scifaro.com/en/abs/on-varieties-of-ordered-automata-1712.084552019-03-20 https://scifaro.com/en/abs/label-languages-of-8-directional-array-p-system-1712.097912017-12-29 https://scifaro.com/en/abs/a-class-of-automatic-sequences-1712.102592018-07-24 https://scifaro.com/en/abs/more-on-the-dynamics-of-the-symbolic-square-root-map-1801.009202018-01-04 https://scifaro.com/en/abs/codes-induced-by-alternative-codes-1801.025982018-01-09 https://scifaro.com/en/abs/on-strong-alt-induced-codes-1801.026032018-01-09 https://scifaro.com/en/abs/comparing-the-power-of-advice-strings-a-notion-of-complexity-for-infinite-words-1801.049082018-07-19 https://scifaro.com/en/abs/subword-complexity-and-power-avoidance-1801.053762020-07-07 https://scifaro.com/en/abs/using-sat-solvers-for-synchronization-issues-in-non-deterministic-automata-1801.053912018-01-17 https://scifaro.com/en/abs/a-more-reasonable-proof-of-cobham-s-theorem-1801.067042018-01-23 https://scifaro.com/en/abs/exploring-the-topological-entropy-of-formal-languages-1801.073212019-04-25 https://scifaro.com/en/abs/sequential-circuits-from-regular-expressions-revisited-1801.089792018-01-30 https://scifaro.com/en/abs/some-issues-on-the-theory-of-the-mimic-computing-oriented-automata-1801.090342018-01-30 https://scifaro.com/en/abs/characterisation-of-sub-sequential-rational-functions-over-a-general-class-monoids-1801.100632018-01-31 https://scifaro.com/en/abs/lower-bounds-for-synchronizing-word-lengths-in-partial-automata-1801.104362018-09-18 https://scifaro.com/en/abs/new-size-hierarchies-for-two-way-automata-1801.104832018-02-01 https://scifaro.com/en/abs/learning-from-informants-relations-between-learning-success-criteria-1801.105022021-07-01 https://scifaro.com/en/abs/deterministic-regular-expressions-with-back-references-1802.015082018-02-06 https://scifaro.com/en/abs/regular-transducer-expressions-for-regular-transformations-1802.020942018-02-07 https://scifaro.com/en/abs/the-language-and-series-of-hammersley-type-processes-1802.034362018-04-10 https://scifaro.com/en/abs/lengths-of-words-accepted-by-nondeterministic-finite-automata-1802.047082018-02-14 https://scifaro.com/en/abs/a-generic-characterization-of-pol-c-1802.061412018-02-20 https://scifaro.com/en/abs/randomness-of-formal-languages-via-automatic-martingales-1802.062072018-02-20 https://scifaro.com/en/abs/automatic-supermartingales-acting-on-sequences-1802.065292018-02-20 https://scifaro.com/en/abs/unboundedness-problems-for-languages-of-vector-addition-systems-1802.066832018-02-20 https://scifaro.com/en/abs/ptl-separability-and-closures-for-wqos-on-words-1802.073972018-02-22 https://scifaro.com/en/abs/randomized-sliding-window-algorithms-for-regular-languages-1802.076002018-02-22 https://scifaro.com/en/abs/a-gauge-invariant-reversible-cellular-automaton-1802.076442018-07-03 https://scifaro.com/en/abs/gossiping-in-message-passing-systems-1802.086412018-04-30 https://scifaro.com/en/abs/improved-upper-bounds-on-all-maximal-alpha-gapped-repeats-and-palindromes-1802.103552018-03-01 https://scifaro.com/en/abs/continuity-of-functional-transducers-a-profinite-study-of-rational-functions-1802.105552023-06-22 https://scifaro.com/en/abs/degrees-of-infinite-words-polynomials-and-atoms-extended-version-1803.031582018-03-09 https://scifaro.com/en/abs/space-efficient-bimachine-construction-based-on-the-equalizer-accumulation-principle-1803.043122018-03-13 https://scifaro.com/en/abs/decision-problems-for-subclasses-of-rational-relations-over-finite-and-infinite-words-1803.061402023-06-22 https://scifaro.com/en/abs/unambiguous-languages-exhaust-the-index-hierarchy-1803.061632018-04-23 https://scifaro.com/en/abs/regular-and-first-order-list-functions-1803.061682018-03-19 https://scifaro.com/en/abs/the-density-of-linear-time-properties-1803.088902018-03-26 https://scifaro.com/en/abs/synthesizing-skeletons-for-reactive-systems-1803.092852018-03-28 https://scifaro.com/en/abs/a-new-hierarchy-for-automaton-semigroups-1803.099912018-05-15 https://scifaro.com/en/abs/derivation-languages-descriptional-complexity-measures-and-decision-problems-of-a-class-of-flat-splicing-systems-1804.023122019-05-22 https://scifaro.com/en/abs/abelian-networks-iv-dynamics-of-nonhalting-networks-1804.033222022-12-05 https://scifaro.com/en/abs/counter-machines-and-distributed-automata-a-story-about-exchanging-space-and-time-1804.035822018-07-03 https://scifaro.com/en/abs/von-neumann-regularity-split-epicness-and-elementary-cellular-automata-1804.039132018-10-11 https://scifaro.com/en/abs/on-computing-the-total-variation-distance-of-hidden-markov-models-1804.061702018-04-18 https://scifaro.com/en/abs/weak-cost-register-automata-are-still-powerful-1804.063362018-04-18 https://scifaro.com/en/abs/a-non-regular-language-of-infinite-trees-that-is-recognizable-by-a-sort-wise-finite-algebra-1804.066672023-06-22 https://scifaro.com/en/abs/a-heuristic-for-reachability-problem-in-asynchronous-binary-automata-networks-1804.075432018-04-23 https://scifaro.com/en/abs/decidability-of-timed-communicating-automata-1804.078152018-04-24 https://scifaro.com/en/abs/additive-number-theory-via-approximation-by-regular-languages-1804.079962018-04-24 https://scifaro.com/en/abs/abstract-geometrical-computation-10-an-intrinsically-universal-family-of-signal-machines-1804.090182019-03-22 https://scifaro.com/en/abs/when-is-containment-decidable-for-probabilistic-automata-1804.090772020-03-31 https://scifaro.com/en/abs/symbolic-automata-with-memory-a-computational-model-for-complex-event-processing-1804.099992018-06-12 https://scifaro.com/en/abs/note-on-the-lower-bounds-of-bimachines-1804.101462018-04-27 https://scifaro.com/en/abs/streaming-rewriting-games-winning-strategies-and-complexity-1804.102922018-04-30 https://scifaro.com/en/abs/testing-simon-s-congruence-1804.104592018-04-30 https://scifaro.com/en/abs/binary-reachability-of-timed-pushdown-automata-via-quantifier-elimination-and-cyclic-order-atoms-1804.107722018-05-01 https://scifaro.com/en/abs/site-directed-insertion-decision-problems-maximality-and-minimality-1804.110172018-05-01 https://scifaro.com/en/abs/counting-subwords-and-regular-languages-1804.111752018-06-22 https://scifaro.com/en/abs/control-strategies-for-off-line-testing-of-timed-systems-1804.112342018-05-04 https://scifaro.com/en/abs/efficient-membership-testing-for-pseudovarieties-of-finite-semigroups-1805.006502018-06-18 https://scifaro.com/en/abs/optimal-and-robust-controller-synthesis-using-energy-timed-automata-with-uncertainty-1805.008472018-05-04 https://scifaro.com/en/abs/regular-expressions-and-transducers-over-alphabet-invariant-and-user-defined-labels-1805.018292018-05-07 https://scifaro.com/en/abs/synchronizing-random-almost-group-automata-1805.021542018-05-08 https://scifaro.com/en/abs/uniformization-problems-for-synchronizations-of-automatic-relations-on-words-1805.024442018-05-08 https://scifaro.com/en/abs/on-completely-reachable-automata-and-subset-reachability-1805.025402018-05-08 https://scifaro.com/en/abs/a-characterization-of-completely-reachable-automata-1805.028792018-05-09 https://scifaro.com/en/abs/a-language-hierarchy-of-binary-relations-1805.031252018-12-06 https://scifaro.com/en/abs/complexity-of-proper-suffix-convex-regular-languages-1805.033752018-05-15 https://scifaro.com/en/abs/dream-dynamic-reconfigurable-architecture-modeling-full-paper-1805.037242018-10-25 https://scifaro.com/en/abs/non-erasing-chomsky-sch-u-tzenberger-theorem-with-grammar-independent-alphabet-1805.040032018-05-11 https://scifaro.com/en/abs/branching-temporal-logic-of-calls-and-returns-for-pushdown-systems-1805.045802018-05-15 https://scifaro.com/en/abs/distributed-automata-and-logic-1805.062382018-12-21 https://scifaro.com/en/abs/the-synchronizing-probability-function-for-primitive-sets-of-matrices-1805.066852019-03-06 https://scifaro.com/en/abs/on-randomized-generation-of-slowly-synchronizing-automata-1805.067232018-06-27 https://scifaro.com/en/abs/the-bottom-up-position-tree-automaton-the-father-automaton-and-their-compact-versions-1805.085842018-05-23 https://scifaro.com/en/abs/estimating-probabilistic-context-free-grammars-for-proteins-using-contact-map-constraints-1805.086302019-03-20 https://scifaro.com/en/abs/convex-language-semantics-for-nondeterministic-probabilistic-automata-1805.115502018-05-30 https://scifaro.com/en/abs/emptiness-of-stack-automata-is-nexptime-complete-a-correction-1805.118732018-05-31 https://scifaro.com/en/abs/on-prefix-normal-words-1805.124052018-06-01 https://scifaro.com/en/abs/on-the-metric-based-approximate-minimization-of-markov-chains-1806.005282018-06-07 https://scifaro.com/en/abs/learning-several-languages-from-labeled-strings-state-merging-and-evolutionary-approaches-1806.016302018-06-13 https://scifaro.com/en/abs/regular-tree-languages-in-low-levels-of-the-wadge-hierarchy-1806.020412023-06-22 https://scifaro.com/en/abs/algorithms-and-training-for-weighted-multiset-automata-and-regular-expressions-1806.033152018-06-12 https://scifaro.com/en/abs/reducing-transducer-equivalence-to-register-automata-problems-solved-by-hilbert-method-1806.043612019-10-28 https://scifaro.com/en/abs/state-complexity-of-pattern-matching-in-regular-languages-1806.046452018-11-06 https://scifaro.com/en/abs/the-intersection-problem-for-finite-semigroups-1806.049962018-06-14 https://scifaro.com/en/abs/selective-monitoring-1806.061432018-07-03 https://scifaro.com/en/abs/finding-short-synchronizing-words-for-prefix-codes-1806.062992018-06-19 https://scifaro.com/en/abs/deque-languages-automata-and-planar-graphs-1806.065622018-06-19 https://scifaro.com/en/abs/learning-graph-weighted-models-on-pictures-1806.082972018-12-04 https://scifaro.com/en/abs/a-general-approach-to-state-complexity-of-operations-formalization-and-limitations-1806.084762018-09-07 https://scifaro.com/en/abs/formal-specification-and-verification-of-autonomous-robotic-systems-a-survey-1807.000482023-05-03 https://scifaro.com/en/abs/new-tools-for-state-complexity-1807.006632023-06-22 https://scifaro.com/en/abs/controlling-a-population-1807.008932023-06-22 https://scifaro.com/en/abs/equivalence-checking-for-weak-bi-kleene-algebra-1807.021022023-06-22 https://scifaro.com/en/abs/a-formal-approach-to-open-multiparty-interactions-1807.030022019-01-23 https://scifaro.com/en/abs/streamable-regular-transductions-1807.038652019-11-05 https://scifaro.com/en/abs/branch-continuous-tree-algebras-1807.045682018-07-13 https://scifaro.com/en/abs/subset-synchronization-of-dfas-and-pfas-and-some-other-results-1807.046612018-07-13 https://scifaro.com/en/abs/detection-and-mitigation-of-classes-of-attacks-in-supervisory-control-systems-1807.048892018-07-16 https://scifaro.com/en/abs/on-the-complexity-of-value-iteration-1807.049202019-04-30 https://scifaro.com/en/abs/classically-time-controlled-quantum-automata-definition-and-properties-1807.053852025-09-25 https://scifaro.com/en/abs/extended-finite-automata-and-decision-problems-for-matrix-semigroups-1807.055162018-07-17 https://scifaro.com/en/abs/briefly-on-bottom-up-1807.055552018-11-26 https://scifaro.com/en/abs/slowly-synchronizing-automata-with-idempotent-letters-of-low-rank-1807.070482019-04-03 https://scifaro.com/en/abs/on-normality-in-shifts-of-finite-type-1807.072082019-02-27 https://scifaro.com/en/abs/origin-equivalence-of-two-way-word-transducers-is-in-pspace-1807.080532018-10-08 https://scifaro.com/en/abs/from-ltl-to-rltl-monitoring-improved-monitorability-through-robust-semantics-1807.082032022-09-13 https://scifaro.com/en/abs/bounded-synthesis-of-reactive-programs-1807.090472018-07-25 https://scifaro.com/en/abs/bisimilarity-distances-for-approximate-differential-privacy-1807.100152020-07-16 https://scifaro.com/en/abs/universal-trees-grow-inside-separating-automata-quasi-polynomial-lower-bounds-for-parity-games-1807.105462020-01-15 https://scifaro.com/en/abs/enumerating-cryptarithms-using-deterministic-finite-automata-1807.115802018-08-01 https://scifaro.com/en/abs/on-nonnegative-integer-matrices-and-short-killing-words-1808.009402021-03-01 https://scifaro.com/en/abs/on-the-synchronization-of-circular-semi-flower-automata-1808.017112018-08-07 https://scifaro.com/en/abs/circular-critical-exponents-for-thue-morse-factors-1808.025292018-08-09 https://scifaro.com/en/abs/regular-tree-algebras-1808.035592023-06-22 https://scifaro.com/en/abs/congruence-based-proofs-of-the-recognizability-theorems-for-free-many-sorted-algebras-1808.082172024-01-18 https://scifaro.com/en/abs/a-parametric-framework-for-reversible-pi-calculi-1808.086552018-08-28 https://scifaro.com/en/abs/simplified-parsing-expression-derivatives-1808.088932018-08-28 https://scifaro.com/en/abs/most-permissive-semantics-of-boolean-networks-1808.102402020-04-09 https://scifaro.com/en/abs/tessla-temporal-stream-based-specification-language-1808.107172018-09-03 https://scifaro.com/en/abs/cobham-s-theorem-and-automaticity-1809.006792018-12-17 https://scifaro.com/en/abs/regular-omega-languages-with-an-informative-right-congruence-1809.031082018-09-11 https://scifaro.com/en/abs/a-framework-for-rewriting-families-of-string-diagrams-1809.038142019-02-07 https://scifaro.com/en/abs/bounded-synthesis-of-register-transducers-1809.050172018-09-14 https://scifaro.com/en/abs/xml-navigation-and-transformation-by-tree-walking-automata-and-transducers-with-visible-and-invisible-pebbles-1809.057302018-09-18 https://scifaro.com/en/abs/the-reachability-problem-for-petri-nets-is-not-elementary-1809.071152019-04-12 https://scifaro.com/en/abs/parameter-synthesis-problems-for-one-parametric-clock-timed-automata-1809.071772018-09-24 https://scifaro.com/en/abs/computing-with-p-systems-1809.086642018-09-25 https://scifaro.com/en/abs/the-containment-problem-for-unambiguous-register-automata-1809.089852019-01-23 https://scifaro.com/en/abs/transfinite-lyndon-words-1809.090332023-06-22 https://scifaro.com/en/abs/on-finitely-ambiguous-b-uchi-automata-1809.094152018-09-26 https://scifaro.com/en/abs/towards-a-classification-of-lindenmayer-systems-1809.105422021-08-23 https://scifaro.com/en/abs/the-parikh-property-for-weighted-context-free-grammars-1810.013512019-06-20 https://scifaro.com/en/abs/on-sets-of-words-of-rank-two-1810.021822019-06-10 https://scifaro.com/en/abs/unfolding-of-finite-concurrent-automata-1810.024712018-10-08 https://scifaro.com/en/abs/on-shuffle-products-acyclic-automata-and-piecewise-testable-languages-1810.029532019-02-05 https://scifaro.com/en/abs/a-pattern-logic-for-automata-with-outputs-1810.035152018-10-09 https://scifaro.com/en/abs/unambiguous-forest-factorization-1810.072852018-10-18 https://scifaro.com/en/abs/polyregular-functions-1810.087602018-10-23 https://scifaro.com/en/abs/the-complexity-of-separation-for-levels-in-concatenation-hierarchies-1810.092872018-10-23 https://scifaro.com/en/abs/monaa-a-tool-for-timed-pattern-matching-with-automata-based-acceleration-1810.093512018-10-23 https://scifaro.com/en/abs/moore-machine-filtering-for-timed-and-untimed-pattern-matching-1810.096332019-07-12 https://scifaro.com/en/abs/automatic-sequences-based-on-parry-or-bertrand-numeration-systems-1810.110812018-10-29 https://scifaro.com/en/abs/a-faster-than-relation-for-semi-markov-decision-processes-1810.112432020-01-22 https://scifaro.com/en/abs/on-random-primitive-sets-directable-ndfas-and-the-generation-of-slowly-synchronizing-dfas-1810.113232018-10-29 https://scifaro.com/en/abs/the-problem-with-probabilistic-dag-automata-for-semantic-graphs-1810.122662019-04-09 https://scifaro.com/en/abs/language-classes-associated-with-automata-over-matrix-groups-1810.124152018-11-16 https://scifaro.com/en/abs/visibly-pushdown-languages-and-free-profinite-algebras-1810.127312018-10-31 https://scifaro.com/en/abs/the-isomorphism-problem-for-tree-automatic-ordinals-with-addition-1810.131532019-03-21 https://scifaro.com/en/abs/computing-the-width-of-non-deterministic-automata-1811.004832023-06-22 https://scifaro.com/en/abs/automaticity-and-invariant-measures-of-linear-cellular-automata-1811.012562023-09-06 https://scifaro.com/en/abs/de-bruijn-graphs-and-powers-of-3-2-1811.022542018-11-13 https://scifaro.com/en/abs/first-order-alternation-1811.023982018-11-20 https://scifaro.com/en/abs/reachability-analysis-of-pushdown-systems-with-an-upper-stack-1811.029822018-11-08 https://scifaro.com/en/abs/decision-procedures-for-path-feasibility-of-string-manipulating-programs-with-complex-operations-1811.031672018-11-09 https://scifaro.com/en/abs/the-ordinal-generated-by-an-ordinal-grammar-is-computable-1811.035952019-04-25 https://scifaro.com/en/abs/symbolic-register-automata-1811.069682019-05-24 https://scifaro.com/en/abs/formal-focusst-specification-of-can-1811.081282018-11-21 https://scifaro.com/en/abs/identifiers-in-registers-describing-network-algorithms-with-logic-1811.081972019-04-15 https://scifaro.com/en/abs/on-the-structure-theory-of-partial-automaton-semigroups-1811.094202020-07-17 https://scifaro.com/en/abs/real-time-systems-modeling-and-analysis-1811.100832018-11-27 https://scifaro.com/en/abs/a-short-and-elegant-proof-of-a-theorem-of-j-e-pin-1811.116602022-09-16 https://scifaro.com/en/abs/path-category-for-free-open-morphisms-from-coalgebras-with-non-deterministic-branching-1811.122942019-02-18 https://scifaro.com/en/abs/proving-that-a-tree-language-is-not-first-order-definable-1812.016742018-12-06 https://scifaro.com/en/abs/note-on-the-infiniteness-and-equivalence-problems-for-word-mix-languages-1812.026002019-10-29 https://scifaro.com/en/abs/on-series-parallel-pomset-languages-rationality-context-freeness-and-automata-1812.030582023-02-03 https://scifaro.com/en/abs/a-decidability-result-for-the-halting-problem-of-cellular-automata-in-the-pentagrid-1812.038822018-12-11 https://scifaro.com/en/abs/counting-symbol-switches-in-synchronizing-automata-1812.040502018-12-12 https://scifaro.com/en/abs/optimal-regular-expressions-for-permutations-1812.063472018-12-18 https://scifaro.com/en/abs/comparator-automata-in-quantitative-verification-1812.065692023-06-22 https://scifaro.com/en/abs/monotone-precision-and-recall-measures-for-comparing-executions-and-specifications-of-dynamic-systems-1812.073342020-04-28 https://scifaro.com/en/abs/orbit-expandability-of-automaton-semigroups-and-groups-1812.073592020-01-28 https://scifaro.com/en/abs/learning-unions-of-k-testable-languages-1812.082692018-12-21 https://scifaro.com/en/abs/the-language-preservation-problem-is-undecidable-for-parametric-event-recording-automata-1812.089482018-12-24 https://scifaro.com/en/abs/transition-property-for-cube-free-words-1812.111192020-07-07 https://scifaro.com/en/abs/visibly-pushdown-languages-over-sliding-windows-1812.115492019-01-01 https://scifaro.com/en/abs/formalization-and-correctness-of-predictive-shift-reduce-parsers-for-graph-grammars-based-on-hyperedge-replacement-1812.119272019-03-12 https://scifaro.com/en/abs/causality-for-general-ltl-definable-properties-1901.005882019-01-04 https://scifaro.com/en/abs/causality-analysis-for-concurrent-reactive-systems-extended-abstract-1901.005892019-01-04 https://scifaro.com/en/abs/model-learning-a-survey-on-foundation-tools-and-applications-1901.019102019-01-08 https://scifaro.com/en/abs/equivalence-checking-of-quantum-finite-state-machines-1901.021732022-09-13 https://scifaro.com/en/abs/languages-ordered-by-the-subword-order-1901.021942019-01-09 https://scifaro.com/en/abs/separation-for-dot-depth-two-1901.033612023-06-22 https://scifaro.com/en/abs/regular-expression-search-on-compressed-text-1901.052522019-01-17 https://scifaro.com/en/abs/the-power-of-one-state-turing-machines-1901.071252019-01-23 https://scifaro.com/en/abs/the-complexity-of-unavoidable-word-patterns-1901.074312019-07-16 https://scifaro.com/en/abs/palindromic-subsequences-in-finite-words-1901.075022019-01-23 https://scifaro.com/en/abs/quantum-finite-automata-survey-status-and-research-directions-1901.079922019-01-24 https://scifaro.com/en/abs/a-model-for-a-lindenmayer-reconstruction-algorithm-1901.084072019-01-25 https://scifaro.com/en/abs/on-the-effects-of-firing-memory-in-the-dynamics-of-conjunctive-networks-1901.097892019-01-29 https://scifaro.com/en/abs/critical-exponent-of-infinite-balanced-words-via-the-pell-number-system-1902.005032019-11-15 https://scifaro.com/en/abs/planar-digraphs-for-automatic-complexity-1902.008122019-02-05 https://scifaro.com/en/abs/the-number-of-languages-with-maximum-state-complexity-1902.008152022-05-03 https://scifaro.com/en/abs/determinization-of-b-uchi-automata-unifying-the-approaches-of-safra-and-muller-schupp-1902.021392020-04-30 https://scifaro.com/en/abs/walking-on-sr-automata-to-detect-grammar-ambiguity-1902.024392019-02-08 https://scifaro.com/en/abs/structural-invariants-for-parametric-verification-of-systems-with-almost-linear-architectures-1902.026962019-02-08 https://scifaro.com/en/abs/deciding-equivalence-of-separated-non-nested-attribute-systems-in-polynomial-time-1902.038582019-02-12 https://scifaro.com/en/abs/separation-and-covering-for-group-based-concatenation-hierarchies-1902.049572019-02-14 https://scifaro.com/en/abs/slowly-synchronizing-dfas-of-7-states-and-maximal-slowly-synchronizing-dfas-1902.053312019-02-15 https://scifaro.com/en/abs/continuous-reachability-for-unordered-data-petri-nets-is-in-ptime-1902.056042019-02-18 https://scifaro.com/en/abs/finite-test-sets-for-morphisms-which-are-square-free-on-some-of-thue-s-square-free-ternary-words-1902.056512019-02-18 https://scifaro.com/en/abs/a-lower-bound-for-primality-of-finite-languages-1902.062532019-02-19 https://scifaro.com/en/abs/relational-parsing-a-clean-fast-parsing-strategy-for-all-context-free-languages-1902.065912019-02-19 https://scifaro.com/en/abs/the-frobenius-and-factor-universality-problems-of-the-kleene-star-of-a-finite-set-of-words-1902.067022021-04-05 https://scifaro.com/en/abs/on-the-dynamical-behaviour-of-linear-higher-order-cellular-automata-and-its-decidability-1902.067752019-02-25 https://scifaro.com/en/abs/equivalence-of-finite-valued-streaming-string-transducers-is-decidable-1902.069732019-05-01 https://scifaro.com/en/abs/taking-and-merging-games-as-rewrite-games-1902.070112023-06-22 https://scifaro.com/en/abs/an-application-of-communication-complexity-kolmogorov-complexity-and-extremal-combinatorics-to-parity-games-1902.071752019-09-27 https://scifaro.com/en/abs/query-learning-algorithm-for-residual-symbolic-finite-automata-1902.074172019-09-18 https://scifaro.com/en/abs/termination-of-linear-loops-over-the-integers-1902.074652021-11-23 https://scifaro.com/en/abs/aperiodic-weighted-automata-and-weighted-first-order-logic-1902.081492019-10-01 https://scifaro.com/en/abs/the-computational-power-of-parsing-expression-grammars-1902.082722020-02-17 https://scifaro.com/en/abs/polynomially-ambiguous-probabilistic-automata-on-restricted-languages-1902.094072020-07-30 https://scifaro.com/en/abs/register-games-1902.106542023-06-22 https://scifaro.com/en/abs/infinite-automaton-semigroups-and-groups-have-infinite-orbits-1903.002222020-08-24 https://scifaro.com/en/abs/a-trichotomy-for-regular-trail-queries-1903.002262024-02-14 https://scifaro.com/en/abs/monadic-decomposability-of-regular-relations-1903.007282019-05-09 https://scifaro.com/en/abs/nonlinear-craig-interpolant-generation-1903.012972020-05-12 https://scifaro.com/en/abs/on-the-density-of-context-free-and-counter-languages-1903.030012019-03-08 https://scifaro.com/en/abs/on-the-density-of-languages-accepted-by-turing-machines-and-other-machine-models-1903.030182019-03-08 https://scifaro.com/en/abs/on-counting-functions-and-slenderness-of-languages-1903.035042019-03-11 https://scifaro.com/en/abs/insertion-operations-on-deterministic-reversal-bounded-counter-machines-1903.035182019-03-11 https://scifaro.com/en/abs/maximal-state-complexity-and-generalized-de-bruijn-words-1903.054422019-12-19 https://scifaro.com/en/abs/regular-expressions-with-backreferences-polynomial-time-matching-techniques-1903.058962024-02-09 https://scifaro.com/en/abs/on-finite-1-dimensional-cellular-automata-reversibility-and-semi-reversibility-1903.060112019-03-15 https://scifaro.com/en/abs/state-complexity-of-the-multiples-of-the-thue-morse-set-1903.061142019-03-15 https://scifaro.com/en/abs/extensions-of-abelian-automata-groups-1903.069972020-08-20 https://scifaro.com/en/abs/parametric-timed-pattern-matching-1903.073282024-07-26 https://scifaro.com/en/abs/one-way-topological-automata-and-the-tantalizing-effects-of-their-topological-features-1903.074772021-04-19 https://scifaro.com/en/abs/complexity-of-the-dynamics-of-reaction-systems-1903.079132020-08-05 https://scifaro.com/en/abs/varieties-of-data-languages-1903.080532019-05-02 https://scifaro.com/en/abs/effective-definability-of-the-reachability-relation-in-timed-automata-1903.097732019-03-26 https://scifaro.com/en/abs/a-characterization-of-morphic-words-with-polynomial-growth-1903.099052023-06-22 https://scifaro.com/en/abs/parallel-communicating-one-way-reversible-finite-automata-system-1903.104282019-03-26 https://scifaro.com/en/abs/using-sat-solvers-for-synchronization-issues-in-partial-deterministic-automata-1903.105492019-03-27 https://scifaro.com/en/abs/partitioning-a-symmetric-rational-relation-into-two-asymmetric-rational-relations-1903.107402019-03-27 https://scifaro.com/en/abs/generic-properties-in-some-classes-of-automaton-groups-1903.113152019-03-28 https://scifaro.com/en/abs/alternating-weak-automata-from-universal-trees-1903.126202020-01-15 https://scifaro.com/en/abs/liveness-in-broadcast-networks-1904.008332020-07-22 https://scifaro.com/en/abs/the-minimal-probabilistic-and-quantum-finite-automata-recognizing-uncountably-many-languages-with-fixed-cutpoints-1904.013812023-06-22 https://scifaro.com/en/abs/complete-abstractions-for-checking-language-inclusion-1904.013882021-01-14 https://scifaro.com/en/abs/on-the-formalization-of-importance-measures-using-hol-theorem-proving-1904.016052019-04-04 https://scifaro.com/en/abs/computational-limitations-of-affine-automata-1904.024282019-04-05 https://scifaro.com/en/abs/attack-resilient-supervisory-control-of-discrete-event-systems-a-finite-state-transducer-approach-1904.032642023-06-30 https://scifaro.com/en/abs/on-functions-weakly-computable-by-pushdown-petri-nets-and-related-systems-1904.040902023-06-22 https://scifaro.com/en/abs/the-many-roads-to-the-simulation-of-reaction-systems-1904.074452020-08-05 https://scifaro.com/en/abs/matrix-approach-to-synchronizing-automata-1904.076942019-11-12 https://scifaro.com/en/abs/circularly-squarefree-words-and-unbordered-conjugates-a-new-approach-1904.081872019-04-18 https://scifaro.com/en/abs/re-pairing-brackets-1904.084022019-04-18 https://scifaro.com/en/abs/fast-algorithms-for-handling-diagonal-constraints-in-timed-automata-1904.085902019-04-19 https://scifaro.com/en/abs/tree-automata-as-algebras-minimisation-and-determinisation-1904.088022023-02-03 https://scifaro.com/en/abs/parametric-updates-in-parametric-timed-automata-1904.088242023-06-22 https://scifaro.com/en/abs/k-spectra-of-weakly-c-balanced-words-1904.091252019-05-27 https://scifaro.com/en/abs/preservation-of-normality-by-transducers-1904.091332019-04-22 https://scifaro.com/en/abs/new-results-on-pseudosquare-avoidance-1904.091572019-04-22 https://scifaro.com/en/abs/undecidability-of-future-timeline-based-planning-over-dense-temporal-domains-1904.091842019-04-22 https://scifaro.com/en/abs/linear-bounded-composition-of-tree-walking-tree-transducers-linear-size-increase-and-complexity-1904.092032019-12-13 https://scifaro.com/en/abs/translating-between-models-of-concurrency-1904.098752019-04-23 https://scifaro.com/en/abs/reachability-for-bounded-branching-vass-1904.102262019-08-20 https://scifaro.com/en/abs/deep-packet-inspection-in-fpgas-via-approximate-nondeterministic-automata-1904.107862019-04-25 https://scifaro.com/en/abs/decision-problems-for-restricted-variants-of-two-dimensional-automata-1904.111002019-04-26 https://scifaro.com/en/abs/on-all-things-star-free-1904.118632019-04-29 https://scifaro.com/en/abs/about-fibonacci-trees-i-1904.121352019-04-30 https://scifaro.com/en/abs/parity-games-zielonka-s-algorithm-in-quasi-polynomial-time-1904.124462019-04-30 https://scifaro.com/en/abs/a-b-uchi-elgot-trakhtenbrot-theorem-for-automata-with-mso-graph-storage-1905.005592023-06-22 https://scifaro.com/en/abs/synthesis-of-data-word-transducers-1905.035382023-06-22 https://scifaro.com/en/abs/the-complexity-of-transducer-synthesis-from-multi-sequential-specifications-1905.035602019-05-10 https://scifaro.com/en/abs/symbolic-monitoring-against-specifications-parametric-in-time-and-data-1905.044862019-07-31 https://scifaro.com/en/abs/a-co-algebraic-theory-of-succinct-automata-1905.055192019-05-16 https://scifaro.com/en/abs/long-run-average-behavior-of-vector-addition-systems-with-states-1905.055372019-05-15 https://scifaro.com/en/abs/preservation-of-normality-by-non-oblivious-group-selection-1905.058012019-05-16 https://scifaro.com/en/abs/abelian-periods-of-factors-of-sturmian-words-1905.061382020-07-27 https://scifaro.com/en/abs/simulations-in-rank-based-b-uchi-automata-complementation-technical-report-1905.071392019-10-07 https://scifaro.com/en/abs/abstraction-refinement-algorithms-for-timed-automata-1905.073652019-05-27 https://scifaro.com/en/abs/the-teaching-complexity-of-erasing-pattern-languages-with-bounded-variable-frequency-1905.077372019-05-21 https://scifaro.com/en/abs/a-combinatorial-approach-for-the-state-complexity-of-the-shuffle-product-1905.081202019-05-21 https://scifaro.com/en/abs/atac-a-tool-for-automating-timed-automata-construction-1905.081692020-07-03 https://scifaro.com/en/abs/on-timed-scope-bounded-context-sensitive-languages-1905.111252019-05-28 https://scifaro.com/en/abs/on-collapsing-prefix-normal-words-1905.118472020-05-20 https://scifaro.com/en/abs/new-results-on-vector-and-homing-vector-automata-1905.118572019-05-29 https://scifaro.com/en/abs/on-the-containment-problem-for-unambiguous-single-register-automata-with-guessing-1905.124452019-05-30 https://scifaro.com/en/abs/distribution-of-behaviour-into-parallel-communicating-subsystems-1905.129632019-08-26 https://scifaro.com/en/abs/string-to-string-interpretations-with-polynomial-size-output-1905.131902019-05-31 https://scifaro.com/en/abs/every-nonnegative-real-number-is-an-abelian-critical-exponent-1906.006652019-09-17 https://scifaro.com/en/abs/on-modelling-the-avoidability-of-patterns-as-csp-1906.007152019-06-04 https://scifaro.com/en/abs/an-automaton-group-with-pspace-complete-word-problem-1906.034242021-07-20 https://scifaro.com/en/abs/synthesis-of-computable-regular-functions-of-infinite-words-1906.041992024-09-19 https://scifaro.com/en/abs/consistency-in-parametric-interval-probabilistic-timed-automata-1906.049822019-06-13 https://scifaro.com/en/abs/opportunistic-synthesis-in-reactive-games-under-information-asymmetry-1906.058472020-04-24 https://scifaro.com/en/abs/a-congruence-based-perspective-on-automata-minimization-algorithms-1906.061942019-06-28 https://scifaro.com/en/abs/coverability-is-undecidable-in-one-dimensional-pushdown-vector-addition-systems-with-resets-1906.070692022-05-12 https://scifaro.com/en/abs/learning-with-partially-ordered-representations-1906.078862019-06-25 https://scifaro.com/en/abs/from-decidability-to-undecidability-by-considering-regular-sets-of-instances-1906.080272020-07-17 https://scifaro.com/en/abs/on-synthesis-of-resynchronizers-for-transducers-1906.086882019-06-26 https://scifaro.com/en/abs/efficient-analysis-of-unambiguous-automata-using-matrix-semigroup-techniques-1906.100932024-09-17 https://scifaro.com/en/abs/new-pumping-technique-for-2-dimensional-vass-1906.104942019-06-26 https://scifaro.com/en/abs/pseudo-solutions-of-word-equations-1906.105352020-04-03 https://scifaro.com/en/abs/approximate-learning-of-limit-average-automata-1906.111042019-06-27 https://scifaro.com/en/abs/fsm-error-messages-1906.114212019-06-28 https://scifaro.com/en/abs/good-for-games-automata-from-nondeterminism-to-alternation-1906.116242019-07-01 https://scifaro.com/en/abs/on-solving-word-equations-using-sat-1906.117182019-06-28 https://scifaro.com/en/abs/online-quantitative-timed-pattern-matching-with-semiring-valued-weighted-automata-1906.121332019-07-01 https://scifaro.com/en/abs/the-polynomial-complexity-of-vector-addition-systems-with-states-1907.010762020-03-17 https://scifaro.com/en/abs/kleene-theorems-for-free-choice-nets-labelled-with-distributed-alphabets-1907.011682019-07-03 https://scifaro.com/en/abs/logics-for-reversible-regular-languages-and-semigroups-with-involution-1907.012142019-07-03 https://scifaro.com/en/abs/timed-basic-parallel-processes-1907.012402019-07-09 https://scifaro.com/en/abs/on-injectivity-of-quantum-finite-automata-1907.014712021-07-01 https://scifaro.com/en/abs/computing-probabilistic-bisimilarity-distances-for-probabilistic-automata-1907.017682023-06-22 https://scifaro.com/en/abs/static-analysis-of-multithreaded-recursive-programs-communicating-via-rendez-vous-1907.028342019-07-08 https://scifaro.com/en/abs/from-ltl-to-unambiguous-b-uchi-automata-via-disambiguation-of-alternating-automata-1907.028872019-07-08 https://scifaro.com/en/abs/nonuniform-families-of-polynomial-size-quantum-finite-automata-and-quantum-logarithmic-space-computation-with-polynomial-size-advice-1907.029162024-04-16 https://scifaro.com/en/abs/fbsat-automatic-inference-of-minimal-finite-state-models-of-function-blocks-using-sat-solver-1907.032852020-02-05 https://scifaro.com/en/abs/on-the-structure-of-dyck-languages-1907.053682019-07-12 https://scifaro.com/en/abs/abelian-square-factors-and-binary-words-1907.053692019-07-12 https://scifaro.com/en/abs/visualiza-c-c-ao-e-anima-c-c-ao-de-aut-omatos-em-ocsigen-framework-1907.053842019-07-12 https://scifaro.com/en/abs/tagged-deterministic-finite-automata-with-lookahead-1907.088372019-07-23 https://scifaro.com/en/abs/two-way-parikh-automata-1907.093622019-07-23 https://scifaro.com/en/abs/minimization-of-visibly-pushdown-automata-is-np-complete-1907.095632023-06-22 https://scifaro.com/en/abs/single-use-register-automata-for-data-words-1907.105042020-05-08 https://scifaro.com/en/abs/deciding-fast-termination-for-probabilistic-vass-with-nondeterminism-1907.110102019-07-26 https://scifaro.com/en/abs/state-identification-for-labeled-transition-systems-with-inputs-and-outputs-1907.110342019-10-23 https://scifaro.com/en/abs/the-order-type-of-scattered-context-free-orderings-of-rank-one-is-computable-1907.115732019-07-29 https://scifaro.com/en/abs/regular-languages-derivatives-and-finite-automata-1907.135772019-08-01 https://scifaro.com/en/abs/modular-descriptions-of-regular-functions-1908.011372019-08-06 https://scifaro.com/en/abs/non-abelian-gauge-invariant-cellular-automata-1908.012292020-02-24 https://scifaro.com/en/abs/reordering-derivatives-of-trace-closures-of-regular-languages-full-version-1908.035512019-08-12 https://scifaro.com/en/abs/solving-of-regular-equations-revisited-extended-version-1908.037102019-08-13 https://scifaro.com/en/abs/a-robust-class-of-linear-recurrence-sequences-1908.038902019-08-13 https://scifaro.com/en/abs/regular-separability-and-intersection-emptiness-are-independent-problems-1908.040382019-08-13 https://scifaro.com/en/abs/non-deterministic-weighted-automata-evaluated-over-markov-chains-1908.046252019-11-01 https://scifaro.com/en/abs/ltl-to-smaller-self-loop-alternating-automata-and-back-1908.046452019-10-17 https://scifaro.com/en/abs/on-the-expressive-power-of-invariants-in-parametric-timed-automata-1908.066332019-08-20 https://scifaro.com/en/abs/tensor-product-representations-of-subregular-formal-languages-1908.081322019-08-23 https://scifaro.com/en/abs/an-incompressibility-theorem-for-automatic-complexity-1908.108432022-06-22 https://scifaro.com/en/abs/average-based-robustness-for-continuous-time-signal-temporal-logic-1909.008982019-09-04 https://scifaro.com/en/abs/on-the-k-synchronizability-of-systems-1909.016272020-01-22 https://scifaro.com/en/abs/explaining-sdn-failures-via-axiomatisations-1909.017452019-09-05 https://scifaro.com/en/abs/an-operational-semantics-of-graph-transformation-systems-using-symmetric-nets-1909.017502019-09-05 https://scifaro.com/en/abs/descriptional-complexity-of-semi-simple-splicing-systems-1909.025122019-09-06 https://scifaro.com/en/abs/networks-of-uniform-splicing-processors-1909.032462019-09-10 https://scifaro.com/en/abs/structural-commutation-relations-for-stochastic-labelled-graph-grammar-rule-operators-1909.041182019-09-11 https://scifaro.com/en/abs/good-for-mdps-automata-for-probabilistic-analysis-and-reinforcement-learning-1909.050812019-10-31 https://scifaro.com/en/abs/minimum-firing-times-of-firing-squad-synchronization-problems-for-paths-in-grid-spaces-1909.054062019-09-13 https://scifaro.com/en/abs/the-firing-squad-synchronization-problem-for-squares-with-holes-1909.054082019-09-13 https://scifaro.com/en/abs/interface-automata-for-choreographies-1909.059672019-09-16 https://scifaro.com/en/abs/on-learning-nominal-automata-with-binders-1909.059742019-09-16 https://scifaro.com/en/abs/fault-trees-from-data-efficient-learning-with-an-evolutionary-algorithm-1909.062582019-09-16 https://scifaro.com/en/abs/algebraic-and-combinatorial-tools-for-state-complexity-application-to-the-star-xor-problem-1909.076632019-09-18 https://scifaro.com/en/abs/state-complexity-of-the-multiples-of-the-thue-morse-set-1909.076762019-09-18 https://scifaro.com/en/abs/on-the-order-type-of-scattered-context-free-orderings-1909.085432019-09-19 https://scifaro.com/en/abs/simple-proof-of-parikh-s-theorem-a-la-takahashi-1909.093932019-09-23 https://scifaro.com/en/abs/nonexistence-of-minimal-time-solutions-for-some-variations-of-the-firing-squad-synchronization-problem-having-simple-geometric-configurations-1909.101252023-12-20 https://scifaro.com/en/abs/on-the-distance-between-timed-automata-1909.104892019-09-24 https://scifaro.com/en/abs/efficient-automata-based-planning-and-control-under-spatio-temporal-logic-specifications-1909.111592020-03-26 https://scifaro.com/en/abs/complexity-of-liveness-in-parameterized-systems-1909.120042019-10-08 https://scifaro.com/en/abs/towards-a-coq-verified-chain-of-esterel-semantics-1909.125822025-01-08 https://scifaro.com/en/abs/reachability-analysis-of-self-modifying-code-1909.126262019-09-30 https://scifaro.com/en/abs/haydi-rapid-prototyping-and-combinatorial-objects-1909.127132020-10-22 https://scifaro.com/en/abs/relating-alternating-relations-for-conformance-and-refinement-1909.136042020-02-19 https://scifaro.com/en/abs/synchronization-under-dynamic-constraints-1910.019352022-03-18 https://scifaro.com/en/abs/succinct-determinisation-of-counting-automata-via-sphere-construction-technical-report-1910.019962019-10-07 https://scifaro.com/en/abs/unambiguous-separators-for-tropical-tree-automata-1910.021642019-10-08 https://scifaro.com/en/abs/decidability-of-membership-problems-for-flat-rational-subsets-of-mathrm-gl-2-mathbb-q-and-singular-matrices-1910.023022024-12-02 https://scifaro.com/en/abs/reactive-synthesis-with-maximum-realizability-of-linear-temporal-logic-specifications-1910.025612019-10-08 https://scifaro.com/en/abs/the-well-structured-problem-for-presburger-counter-machines-1910.027362023-07-11 https://scifaro.com/en/abs/parity-games-another-view-on-lehtinen-s-algorithm-1910.039192019-10-10 https://scifaro.com/en/abs/equivalence-kernels-of-sequential-functions-and-sequential-observation-synthesis-1910.060192019-10-15 https://scifaro.com/en/abs/generating-posets-beyond-n-1910.061622019-10-15 https://scifaro.com/en/abs/abstract-transducers-1910.075832019-10-18 https://scifaro.com/en/abs/pumping-lemmas-for-classes-of-languages-generated-by-folding-systems-1910.085182022-05-12 https://scifaro.com/en/abs/minimal-automaton-for-multiplying-and-translating-the-thue-morse-set-1910.085432019-10-22 https://scifaro.com/en/abs/checking-timed-bisimulation-with-bounded-zone-history-graphs-technical-report-1910.089922020-09-17 https://scifaro.com/en/abs/complexity-results-on-register-pushdown-automata-1910.103572019-10-24 https://scifaro.com/en/abs/a-compositional-semantics-for-repairable-fault-trees-with-general-distributions-1910.105072019-10-24 https://scifaro.com/en/abs/learning-one-clock-timed-automata-1910.106802020-03-27 https://scifaro.com/en/abs/residuality-and-learning-for-nondeterministic-nominal-automata-1910.116662023-06-22 https://scifaro.com/en/abs/a-note-on-commutative-kleene-algebra-1910.143812019-11-01 https://scifaro.com/en/abs/an-abstraction-based-framework-for-neural-network-verification-1910.145742020-07-22 https://scifaro.com/en/abs/synthesis-of-weighted-marked-graphs-from-constrained-labelled-transition-systems-a-geometric-approach-1911.004742019-11-04 https://scifaro.com/en/abs/multi-agent-safety-verification-using-symmetry-transformations-1911.006082019-11-05 https://scifaro.com/en/abs/automata-learning-an-algebraic-approach-1911.008742020-08-31 https://scifaro.com/en/abs/controlling-a-random-population-1911.011952023-06-22 https://scifaro.com/en/abs/new-optimizations-and-heuristics-for-determinization-of-b-uchi-automata-1911.017592020-04-30 https://scifaro.com/en/abs/lyndon-words-versus-inverse-lyndon-words-queries-on-suffixes-and-bordered-words-1911.018512020-11-24 https://scifaro.com/en/abs/wreath-products-of-distributive-forest-algebras-1911.034932019-11-12 https://scifaro.com/en/abs/cellular-automata-reversibility-semi-reversibility-and-randomness-1911.036092019-11-12 https://scifaro.com/en/abs/learning-weighted-automata-over-principal-ideal-domains-1911.044042021-10-15 https://scifaro.com/en/abs/resolvable-ambiguity-1911.056722020-02-05 https://scifaro.com/en/abs/iterative-method-of-generating-artificial-context-free-grammars-1911.058012019-11-15 https://scifaro.com/en/abs/witnessing-secure-compilation-1911.058662019-11-15 https://scifaro.com/en/abs/language-inclusion-for-finite-prime-event-structures-1911.063552019-11-18 https://scifaro.com/en/abs/weighted-parsing-for-grammar-based-language-models-over-multioperator-monoids-1911.065852019-11-18 https://scifaro.com/en/abs/synthesis-of-reduced-asymmetric-choice-petri-nets-1911.091332019-11-25 https://scifaro.com/en/abs/fuzzy-deterministic-top-down-tree-automata-1911.115292019-11-27 https://scifaro.com/en/abs/words-avoiding-reversed-factors-revisited-1911.117042019-12-10 https://scifaro.com/en/abs/words-with-few-palindromes-revisited-1911.124642020-01-07 https://scifaro.com/en/abs/ll-1-parsing-with-derivatives-and-zippers-1911.127372021-01-22 https://scifaro.com/en/abs/on-the-balancedness-of-tree-to-word-transducers-1911.130542020-03-16 https://scifaro.com/en/abs/classifying-pattern-and-feature-properties-to-get-a-theta-n-checker-and-reformulation-for-sliding-time-series-constraints-1912.015322019-12-04 https://scifaro.com/en/abs/crisp-determinization-of-weighted-tree-automata-over-strong-bimonoids-1912.026602023-06-22 https://scifaro.com/en/abs/on-verification-of-d-detectability-for-discrete-event-systems-1912.073122020-05-19 https://scifaro.com/en/abs/on-opacity-verification-for-discrete-event-systems-1912.073142019-12-17 https://scifaro.com/en/abs/prema-a-tool-for-precise-requirements-editing-modeling-and-analysis-1912.078172019-12-18 https://scifaro.com/en/abs/new-bounds-on-antipowers-in-words-1912.081472020-07-07 https://scifaro.com/en/abs/conjunctive-regular-path-queries-with-string-variables-1912.093262019-12-20 https://scifaro.com/en/abs/transformation-of-turing-machines-into-context-dependent-fusion-grammars-1912.096082019-12-23 https://scifaro.com/en/abs/speeding-up-generalized-psr-parsers-by-memoization-techniques-1912.096092019-12-23 https://scifaro.com/en/abs/lower-bounds-for-the-state-complexity-of-probabilistic-languages-and-the-language-of-prime-numbers-1912.113962019-12-25 https://scifaro.com/en/abs/extended-models-of-finite-automata-1912.116992019-12-30 https://scifaro.com/en/abs/bounded-languages-described-by-gf-2-grammars-1912.134012025-12-09 https://scifaro.com/en/abs/representing-unordered-data-using-complex-weighted-multiset-automata-2001.006102020-08-31 https://scifaro.com/en/abs/hardware-software-co-verification-using-path-based-symbolic-execution-2001.013242020-01-07 https://scifaro.com/en/abs/incremental-monoidal-grammars-2001.022962020-01-13 https://scifaro.com/en/abs/vc-dimensions-of-nondeterministic-finite-automata-for-words-of-equal-length-2001.023092021-08-06 https://scifaro.com/en/abs/equivalence-of-linear-tree-transducers-with-output-in-the-free-group-2001.034802020-03-16 https://scifaro.com/en/abs/reachability-in-fixed-dimension-vector-addition-systems-with-states-2001.043272020-05-12 https://scifaro.com/en/abs/good-for-games-omega-pushdown-automata-2001.043922023-06-22 https://scifaro.com/en/abs/learning-concise-models-from-long-execution-traces-2001.052302020-05-06 https://scifaro.com/en/abs/compressing-permutation-groups-into-grammars-and-polytopes-a-graph-embedding-approach-2001.055832020-01-17 https://scifaro.com/en/abs/a-categorical-framework-for-learning-generalised-tree-automata-2001.057862023-02-03 https://scifaro.com/en/abs/streaming-transformations-of-infinite-ordered-data-words-2001.069522020-01-22 https://scifaro.com/en/abs/nonregularity-via-ordinal-extensions-2001.088462020-01-27 https://scifaro.com/en/abs/provenance-for-regular-path-queries-2001.098642020-02-04 https://scifaro.com/en/abs/reconstructing-words-from-right-bounded-block-words-2001.112182020-03-17 https://scifaro.com/en/abs/the-uniform-measure-of-simple-regular-sets-of-infinite-trees-2001.115762020-02-03 https://scifaro.com/en/abs/on-the-binomial-equivalence-classes-of-finite-words-2001.117322020-02-03 https://scifaro.com/en/abs/careful-synchronization-of-partial-deterministic-finite-automata-2002.010452020-05-19 https://scifaro.com/en/abs/on-stochastic-automata-over-monoids-2002.012142020-02-05 https://scifaro.com/en/abs/polynomial-time-algorithms-for-inclusion-and-equivalence-of-deterministic-omega-acceptors-2002.031912020-05-12 https://scifaro.com/en/abs/alternating-tree-automata-with-qualitative-semantics-2002.036642020-12-08 https://scifaro.com/en/abs/revisiting-underapproximate-reachability-for-multipushdown-systems-2002.059502020-05-06 https://scifaro.com/en/abs/information-flow-interfaces-2002.064652020-05-11 https://scifaro.com/en/abs/four-valued-monitorability-of-omega-regular-languages-2002.067372020-05-13 https://scifaro.com/en/abs/the-monitoring-problem-for-timed-automata-2002.070492020-02-18 https://scifaro.com/en/abs/the-upper-density-of-an-automatic-set-is-rational-2002.072562021-04-13 https://scifaro.com/en/abs/playing-against-opponents-with-limited-memory-2002.072742020-02-19 https://scifaro.com/en/abs/on-succinctness-and-recognisability-of-alternating-good-for-games-automata-2002.072782020-02-19 https://scifaro.com/en/abs/synthesis-in-presence-of-dynamic-links-2002.075452020-09-24 https://scifaro.com/en/abs/regular-resynchronizability-of-origin-transducers-is-undecidable-2002.075582020-07-02 https://scifaro.com/en/abs/better-automata-through-process-algebra-2002.075622020-02-19 https://scifaro.com/en/abs/decidability-of-cutpoint-isolation-for-probabilistic-finite-automata-on-letter-bounded-inputs-2002.076602020-05-15 https://scifaro.com/en/abs/comparing-consecutive-letter-counts-in-multiple-context-free-languages-2002.082362021-03-17 https://scifaro.com/en/abs/on-polynomial-recursive-sequences-2002.086302020-02-21 https://scifaro.com/en/abs/equivalence-testing-of-weighted-automata-over-partially-commutative-monoids-2002.086332020-06-02 https://scifaro.com/en/abs/combining-partial-specifications-using-alternating-interface-automata-2002.087542020-02-21 https://scifaro.com/en/abs/first-order-tree-to-tree-functions-2002.093072023-01-31 https://scifaro.com/en/abs/extensions-of-omega-regular-languages-2002.093932020-02-24 https://scifaro.com/en/abs/automata-for-hyperlanguages-2002.098772020-02-25 https://scifaro.com/en/abs/how-good-is-a-strategy-in-a-game-with-nature-2002.099422020-10-14 https://scifaro.com/en/abs/wheeler-languages-2002.103032020-02-25 https://scifaro.com/en/abs/buchi-automata-augmented-with-spatial-constraints-simulating-an-alternating-with-a-nondeterministic-and-deciding-the-emptiness-problem-for-the-latter-2002.115102020-02-27 https://scifaro.com/en/abs/dependently-typed-knowledge-graphs-2003.037852020-03-10 https://scifaro.com/en/abs/scattered-factor-universality-of-words-2003.046292020-03-11 https://scifaro.com/en/abs/regular-intersection-emptiness-of-graph-problems-finding-a-needle-in-a-haystack-of-graphs-with-the-help-of-automata-2003.058262020-03-13 https://scifaro.com/en/abs/cerny-starke-conjecture-from-the-sixties-of-xx-century-2003.061772021-06-15 https://scifaro.com/en/abs/the-state-complexity-of-lexicographically-smallest-words-and-computing-successors-2003.082492020-03-19 https://scifaro.com/en/abs/composition-and-weight-pushing-of-monotonic-subsequential-failure-transducers-representing-probabilistic-models-2003.093642020-05-22 https://scifaro.com/en/abs/kontrol-edilebilir-ptstl-formulu-sentezi-synthesis-of-controllable-ptstl-formulas-2003.099182020-03-24 https://scifaro.com/en/abs/minimising-good-for-games-automata-is-np-complete-2003.119792020-03-27 https://scifaro.com/en/abs/event-structures-for-the-reversible-early-internal-pi-calculus-2004.012112020-04-14 https://scifaro.com/en/abs/gauge-invariance-in-cellular-automata-2004.036562022-01-25 https://scifaro.com/en/abs/parameterized-verification-of-systems-with-global-synchronization-and-guards-2004.048962021-05-07 https://scifaro.com/en/abs/non-maximal-sensitivity-to-synchronism-in-periodic-elementary-cellular-automata-exact-asymptotic-measures-2004.071282020-07-24 https://scifaro.com/en/abs/on-synchronization-of-partial-automata-2004.088012020-06-23 https://scifaro.com/en/abs/on-the-decomposition-of-generalized-semiautomata-2004.088052020-04-21 https://scifaro.com/en/abs/regular-matching-problems-for-infinite-trees-2004.099262023-06-22 https://scifaro.com/en/abs/state-complexity-bounds-for-the-commutative-closure-of-group-languages-2004.117722020-08-14 https://scifaro.com/en/abs/church-synthesis-on-register-automata-over-linearly-ordered-data-domains-2004.121412023-06-23 https://scifaro.com/en/abs/cost-automata-safe-schemes-and-downward-closures-2004.121872024-02-14 https://scifaro.com/en/abs/timed-games-and-deterministic-separability-2004.128682020-04-28 https://scifaro.com/en/abs/the-state-complexity-of-a-class-of-operations-involving-roots-and-boolean-operations-2004.129582020-04-28 https://scifaro.com/en/abs/descriptional-complexity-of-winning-sets-of-regular-languages-2004.136682020-04-29 https://scifaro.com/en/abs/ambiguity-weakness-and-regularity-in-probabilistic-b-uchi-automata-2004.136922020-04-30 https://scifaro.com/en/abs/standard-words-and-solutions-of-the-word-equation-x-1-2-dotsm-x-n-2-x-1-dotsm-x-n-2-2004.146572020-11-04 https://scifaro.com/en/abs/a-direct-proof-of-agafonov-s-theorem-and-an-extension-to-shift-of-finite-type-2005.002552020-05-14 https://scifaro.com/en/abs/reinforcement-learning-of-minimalist-grammars-2005.003592020-05-04 https://scifaro.com/en/abs/formal-assessment-of-some-properties-of-context-aware-systems-2005.003732020-05-04 https://scifaro.com/en/abs/efficiently-testing-simon-s-congruence-2005.011122021-03-16 https://scifaro.com/en/abs/register-transducers-are-marble-transducers-2005.013422020-05-05 https://scifaro.com/en/abs/palindromic-length-of-words-with-many-periodic-palindromes-2005.013712020-11-17 https://scifaro.com/en/abs/synchronization-of-deterministic-visibly-push-down-automata-2005.013742020-07-20 https://scifaro.com/en/abs/synchronizing-deterministic-push-down-automata-can-be-really-hard-2005.013812020-12-23 https://scifaro.com/en/abs/automata-tutor-v3-2005.014192021-02-02 https://scifaro.com/en/abs/what-you-must-remember-when-transforming-datawords-2005.025962020-12-15 https://scifaro.com/en/abs/parametrized-universality-problems-for-one-counter-nets-2005.034352020-07-07 https://scifaro.com/en/abs/computational-complexity-of-synchronization-under-regular-commutative-constraints-2005.040422020-09-04 https://scifaro.com/en/abs/ideal-separation-and-general-theorems-for-constrained-synchronization-and-their-application-to-small-constraint-automata-2005.059072021-03-19 https://scifaro.com/en/abs/bisimulation-finiteness-of-pushdown-systems-is-elementary-2005.062852020-05-14 https://scifaro.com/en/abs/structural-equivalences-for-reversible-calculi-of-communicating-systems-oral-communication-2005.068182020-05-15 https://scifaro.com/en/abs/qualitative-controller-synthesis-for-consumption-markov-decision-processes-2005.072272020-05-18 https://scifaro.com/en/abs/two-way-nanoscale-automata-2005.075692020-05-18 https://scifaro.com/en/abs/on-the-power-of-unambiguity-in-b-uchi-complementation-2005.091252020-09-24 https://scifaro.com/en/abs/weighted-prefix-normal-words-mind-the-gap-2005.092812021-04-20 https://scifaro.com/en/abs/on-the-separability-problem-of-string-constraints-2005.094892020-05-21 https://scifaro.com/en/abs/decidability-and-k-regular-sequences-2005.095072022-02-02 https://scifaro.com/en/abs/state-complexity-of-reversible-watson-crick-automata-2005.101262020-05-21 https://scifaro.com/en/abs/multi-head-watson-crick-quantum-finite-automata-2005.101272020-05-21 https://scifaro.com/en/abs/infinitude-of-primes-using-formal-language-theory-2005.103722020-05-22 https://scifaro.com/en/abs/primitive-sets-of-words-2005.106682020-05-22 https://scifaro.com/en/abs/minimisation-in-logical-form-2005.115512020-05-26 https://scifaro.com/en/abs/timed-automata-benchmark-description-2005.131512020-05-28 https://scifaro.com/en/abs/preservation-of-normality-by-unambiguous-transducers-2006.008912020-06-17 https://scifaro.com/en/abs/aperiodicity-star-freeness-and-first-order-logic-definability-of-operator-precedence-languages-2006.012362024-02-14 https://scifaro.com/en/abs/on-a-class-of-constrained-synchronization-problems-in-np-2006.019032021-08-24 https://scifaro.com/en/abs/solenoid-maps-automatic-sequences-van-der-put-series-and-mealy-moore-automata-2006.023162020-06-04 https://scifaro.com/en/abs/on-the-complexity-of-the-universality-and-inclusion-problems-for-unambiguous-context-free-grammars-technical-report-2006.052752020-06-12 https://scifaro.com/en/abs/avoiding-abelian-powers-cyclically-2006.063072020-11-04 https://scifaro.com/en/abs/algebraic-language-theory-for-eilenberg-moore-algebras-2006.083162023-06-22 https://scifaro.com/en/abs/on-morphisms-preserving-palindromic-richness-2006.122072023-06-22 https://scifaro.com/en/abs/detectability-of-labeled-weighted-automata-over-monoids-2006.141642022-01-25 https://scifaro.com/en/abs/dissecting-power-of-intersection-of-two-context-free-languages-2006.151602024-02-14 https://scifaro.com/en/abs/state-complexity-of-permutation-and-related-decision-problems-on-alphabetical-pattern-constraints-2006.151782021-08-17 https://scifaro.com/en/abs/making-streett-determinization-tight-2006.164762020-07-01 https://scifaro.com/en/abs/pebble-minimization-of-polyregular-functions-2006.166452023-02-16 https://scifaro.com/en/abs/binary-intersection-formalized-2006.167112022-03-15 https://scifaro.com/en/abs/scattered-one-counter-languges-have-rank-less-than-omega-2-2007.000902023-03-07 https://scifaro.com/en/abs/an-approach-to-regular-separability-in-vector-addition-systems-2007.001112020-07-02 https://scifaro.com/en/abs/a-quasiorder-based-perspective-on-residual-automata-2007.003592020-07-28 https://scifaro.com/en/abs/incremental-methods-for-checking-real-time-consistency-2007.010142020-07-09 https://scifaro.com/en/abs/computing-maximally-permissive-strategies-in-acyclic-timed-automata-2007.018152020-07-09 https://scifaro.com/en/abs/proving-non-inclusion-of-b-uchi-automata-based-on-monte-carlo-sampling-2007.022822020-07-08 https://scifaro.com/en/abs/a-classification-of-weak-asynchronous-models-of-distributed-computing-2007.032912020-07-08 https://scifaro.com/en/abs/a-myhill-nerode-theorem-for-register-automata-and-symbolic-trace-languages-2007.035402021-04-01 https://scifaro.com/en/abs/a-quantum-finite-automata-approach-to-modeling-the-chemical-reactions-2007.039762020-07-09 https://scifaro.com/en/abs/nondeterministic-automata-and-jsl-dfas-2007.060312020-07-14 https://scifaro.com/en/abs/rna-2qcfa-evolving-two-way-quantum-finite-automata-with-classical-states-for-rna-secondary-structures-2007.062732020-07-14 https://scifaro.com/en/abs/the-big-o-problem-2007.076942023-06-22 https://scifaro.com/en/abs/wreath-cascade-products-and-related-decomposition-results-for-the-concurrent-setting-of-mazurkiewicz-traces-extended-version-2007.079402020-09-01 https://scifaro.com/en/abs/the-simplest-binary-word-with-only-three-squares-2007.081882020-07-17 https://scifaro.com/en/abs/greibach-normal-form-for-omega-algebraic-systems-and-weighted-simple-omega-pushdown-automata-2007.088662022-06-24 https://scifaro.com/en/abs/multi-dimensional-long-run-average-problems-for-vector-addition-systems-with-states-2007.089172020-07-20 https://scifaro.com/en/abs/completely-reachable-automata-primitive-groups-and-the-state-complexity-of-the-set-of-synchronizing-words-2007.091042020-12-01 https://scifaro.com/en/abs/determinisability-of-one-clock-timed-automata-2007.093402020-07-21 https://scifaro.com/en/abs/on-the-orbits-of-automaton-semigroups-and-groups-2007.102732020-07-21 https://scifaro.com/en/abs/verification-and-parameter-synthesis-for-real-time-programs-using-refinement-of-trace-abstraction-2007.105392020-07-24 https://scifaro.com/en/abs/universality-problem-for-unambiguous-vass-2007.109072020-07-22 https://scifaro.com/en/abs/multitape-automata-and-finite-state-transducers-with-lexicographic-weights-2007.129402020-09-23 https://scifaro.com/en/abs/a-note-on-the-class-of-languages-generated-by-f-systems-over-regular-languages-2007.157052022-05-23 https://scifaro.com/en/abs/theta-palindromes-in-theta-conjugates-2008.002552021-08-06 https://scifaro.com/en/abs/on-the-expressive-power-of-higher-order-pushdown-systems-2008.006502023-06-22 https://scifaro.com/en/abs/asymptotic-approximation-by-regular-languages-2008.014132020-11-18 https://scifaro.com/en/abs/the-intersection-of-3-maximal-submonids-2008.018242022-03-23 https://scifaro.com/en/abs/glushkov-s-construction-for-functional-subsequential-transducers-2008.022392020-09-23 https://scifaro.com/en/abs/blocksequences-of-k-local-words-2008.035162020-08-18 https://scifaro.com/en/abs/verifying-safety-properties-of-inductively-defined-parameterized-systems-2008.041602020-10-15 https://scifaro.com/en/abs/on-the-complexity-of-the-universality-and-inclusion-problems-for-unambiguous-context-free-grammars-2008.046672020-08-12 https://scifaro.com/en/abs/on-the-number-of-useful-objects-in-p-systems-with-active-membranes-2008.049932020-08-13 https://scifaro.com/en/abs/reactive-synthesis-from-extended-bounded-response-ltl-specifications-2008.053352020-08-13 https://scifaro.com/en/abs/the-commutative-closure-of-shuffle-expressions-over-group-languages-is-regular-2008.054202021-08-20 https://scifaro.com/en/abs/an-efficient-model-inference-algorithm-for-learning-based-testing-of-reactive-systems-2008.062682020-08-17 https://scifaro.com/en/abs/on-the-power-of-automata-minimization-in-reactive-synthesis-2008.067902021-09-20 https://scifaro.com/en/abs/on-the-use-of-quasiorders-in-formal-language-theory-2008.088282020-08-21 https://scifaro.com/en/abs/automated-trajectory-synthesis-for-uav-swarms-based-on-resilient-data-collection-objectives-2008.107822020-08-26 https://scifaro.com/en/abs/concatenation-operations-and-restricted-variants-of-two-dimensional-automata-2008.111642020-08-26 https://scifaro.com/en/abs/languages-recognised-by-finite-semigroups-and-their-generalisations-to-objects-such-as-trees-and-graphs-with-an-emphasis-on-definability-in-monadic-second-order-logic-2008.116352020-08-27 https://scifaro.com/en/abs/computability-by-monadic-second-order-logic-2008.121512020-11-25 https://scifaro.com/en/abs/recognition-and-complexity-results-for-projection-languages-of-two-dimensional-automata-2009.006022020-09-02 https://scifaro.com/en/abs/tree-automata-for-extracting-consensus-from-partial-replicas-of-a-structured-document-2009.008672020-09-04 https://scifaro.com/en/abs/notes-on-equivalence-and-minimization-of-weighted-automata-2009.012172020-09-03 https://scifaro.com/en/abs/on-prefix-palindromic-length-of-automatic-words-2009.029342021-06-10 https://scifaro.com/en/abs/an-abstract-framework-for-choreographic-testing-2009.079902020-09-18 https://scifaro.com/en/abs/higher-order-nonemptiness-step-by-step-2009.081742020-09-18 https://scifaro.com/en/abs/bounded-model-checking-for-hyperproperties-2009.089072020-10-19 https://scifaro.com/en/abs/grey-box-learning-of-register-automata-2009.099752020-09-22 https://scifaro.com/en/abs/canonicity-in-gfg-and-transition-based-automata-2009.108852020-09-24 https://scifaro.com/en/abs/comparing-labelled-markov-decision-processes-2009.116432020-09-25 https://scifaro.com/en/abs/on-the-succinctness-of-alternating-parity-good-for-games-automata-2009.144372020-10-01 https://scifaro.com/en/abs/weighted-tiling-systems-for-graphs-evaluation-complexity-2009.145422020-10-01 https://scifaro.com/en/abs/a-string-diagrammatic-axiomatisation-of-finite-state-automata-2009.145762020-11-05 https://scifaro.com/en/abs/on-store-languages-and-applications-2010.005232020-10-02 https://scifaro.com/en/abs/automata-based-quantitative-verification-2010.020552020-10-06 https://scifaro.com/en/abs/learning-languages-in-the-limit-from-positive-information-with-finitely-many-memory-changes-2010.047822021-06-18 https://scifaro.com/en/abs/on-some-representations-of-context-free-languages-2010.048232020-10-13 https://scifaro.com/en/abs/collapsible-pushdown-parity-games-2010.063612020-10-14 https://scifaro.com/en/abs/reinforcement-learning-based-temporal-logic-control-with-maximum-probabilistic-satisfaction-2010.067972022-01-04 https://scifaro.com/en/abs/ranked-enumeration-of-mso-logic-on-words-2010.080422020-10-19 https://scifaro.com/en/abs/online-monitoring-omega-regular-properties-in-unknown-markov-chains-2010.083472022-07-21 https://scifaro.com/en/abs/parametric-non-interference-in-timed-automata-2010.095272020-10-20 https://scifaro.com/en/abs/generators-and-bases-for-monadic-closures-2010.102232023-06-16 https://scifaro.com/en/abs/a-linear-time-nominal-mu-calculus-with-name-allocation-2010.109122021-08-23 https://scifaro.com/en/abs/state-space-construction-of-hybrid-petri-nets-with-multiple-stochastic-firings-2010.110562020-10-22 https://scifaro.com/en/abs/approximating-the-minimal-lookahead-needed-to-win-infinite-games-2010.117062022-03-02 https://scifaro.com/en/abs/learning-automata-and-transducers-a-categorical-approach-2010.136752020-10-27 https://scifaro.com/en/abs/on-krohn-rhodes-theory-for-semiautomata-2010.162352020-11-02 https://scifaro.com/en/abs/abelian-complexity-and-synchronization-2011.004532020-11-17 https://scifaro.com/en/abs/conversion-of-lsat-behavioral-specifications-to-automata-2011.032492020-11-09 https://scifaro.com/en/abs/the-algebra-of-binary-trees-is-affine-complete-2011.039252024-02-14 https://scifaro.com/en/abs/polynomial-time-algorithm-for-left-right-local-testability-2011.042362020-11-10 https://scifaro.com/en/abs/a-semantic-framework-for-pegs-2011.043602020-11-10 https://scifaro.com/en/abs/context-bounded-verification-of-liveness-properties-for-multithreaded-shared-memory-programs-2011.045812020-11-13 https://scifaro.com/en/abs/a-translation-of-weighted-ltl-formulas-to-weighted-b-uchi-automata-over-omega-valuation-monoids-2011.050272022-01-04 https://scifaro.com/en/abs/on-the-complexity-of-symbolic-finite-state-automata-2011.053892021-07-05 https://scifaro.com/en/abs/some-new-features-and-algorithms-for-the-study-of-dfa-2011.055752020-11-12 https://scifaro.com/en/abs/nondeterministic-functional-transducer-inference-algorithm-2011.057102020-12-11 https://scifaro.com/en/abs/the-complexity-of-bounded-context-switching-with-dynamic-thread-creation-2011.058252020-11-19 https://scifaro.com/en/abs/precise-estimation-on-the-order-of-local-testability-of-deterministic-finite-automaton-2011.062532020-11-13 https://scifaro.com/en/abs/reducing-the-time-complexity-of-testing-for-local-threshold-testability-2011.062622020-11-13 https://scifaro.com/en/abs/on-language-varieties-without-boolean-operations-2011.069512020-11-16 https://scifaro.com/en/abs/congruences-for-stochastic-automata-2011.069542020-11-16 https://scifaro.com/en/abs/reachability-in-two-parametric-timed-automata-with-one-parameter-is-expspace-complete-2011.070912020-11-17 https://scifaro.com/en/abs/learning-of-structurally-unambiguous-probabilistic-grammars-2011.074722021-03-10 https://scifaro.com/en/abs/safety-synthesis-sans-specification-2011.076302020-11-30 https://scifaro.com/en/abs/mathematical-approach-in-automata-and-automata-association-2011.081082025-10-14 https://scifaro.com/en/abs/agafonov-s-theorem-for-finite-and-infinite-alphabets-and-probability-distributions-different-from-equidistribution-2011.085522022-11-16 https://scifaro.com/en/abs/recurrence-in-dense-time-ams-assertions-2011.088052020-11-18 https://scifaro.com/en/abs/weighted-automata-are-compact-and-actively-learnable-2011.104982021-04-26 https://scifaro.com/en/abs/ambiguity-through-the-lens-of-measure-theory-2011.105342022-04-25 https://scifaro.com/en/abs/conformance-checking-of-mixed-paradigm-process-models-2011.115512020-11-30 https://scifaro.com/en/abs/optimal-transformations-of-muller-conditions-2011.130412023-10-20 https://scifaro.com/en/abs/automatic-optimizations-for-stream-based-monitoring-languages-2011.133442020-11-30 https://scifaro.com/en/abs/state-complexity-of-the-set-of-synchronizing-words-for-circular-automata-and-automata-over-binary-alphabets-2011.144042020-12-01 https://scifaro.com/en/abs/state-complexity-of-halting-returning-and-reversible-graph-walking-automata-2011.148562020-12-01 https://scifaro.com/en/abs/proceedings-of-the-eleventh-international-workshop-on-graph-computation-models-2012.011812020-12-03 https://scifaro.com/en/abs/nesting-negations-in-fo2-over-infinite-words-2012.013092020-12-03 https://scifaro.com/en/abs/weak-greibach-normal-form-for-hyperedge-replacement-grammars-2012.016602020-12-04 https://scifaro.com/en/abs/input-driven-automata-on-well-nested-infinite-strings-automata-theoretic-and-topological-properties-2012.033952020-12-08 https://scifaro.com/en/abs/describing-the-syntax-of-programming-languages-using-conjunctive-and-boolean-grammars-2012.035382020-12-08 https://scifaro.com/en/abs/rational-index-of-bounded-oscillation-languages-2012.035672020-12-08 https://scifaro.com/en/abs/the-hardest-language-for-grammars-with-context-operators-2012.035962021-11-22 https://scifaro.com/en/abs/counting-ternary-square-free-words-quickly-2012.039262021-05-11 https://scifaro.com/en/abs/string-attractors-for-automatic-sequences-2012.068402024-05-31 https://scifaro.com/en/abs/on-probabilistic-stable-event-structures-2012.101882020-12-21 https://scifaro.com/en/abs/a-unified-implementation-of-automata-and-expression-structures-and-of-the-associated-algorithms-using-enriched-categories-2012.106412020-12-22 https://scifaro.com/en/abs/analysis-of-shape-grammars-continuity-of-rules-2012.109492022-03-15 https://scifaro.com/en/abs/o-n-is-an-n-mcfl-2012.121002020-12-23 https://scifaro.com/en/abs/formal-modeling-and-performance-evaluation-for-hybrid-systems-a-probabilistic-hybrid-process-algebra-based-approach-2012.127162021-01-04 https://scifaro.com/en/abs/forest-an-interactive-multi-tree-synthesizer-for-regular-expressions-2012.142352020-12-29 https://scifaro.com/en/abs/canonical-representations-of-k-safety-hyperproperties-2012.145862021-01-01 https://scifaro.com/en/abs/approximate-automata-for-omega-regular-languages-2012.145902021-01-01 https://scifaro.com/en/abs/reachability-relations-of-timed-pushdown-automata-2012.152912021-01-01 https://scifaro.com/en/abs/regular-expression-length-via-arithmetic-formula-complexity-2012.156172021-01-01 https://scifaro.com/en/abs/encoding-sinusoidal-functions-in-hybrid-automata-formalism-2101.000122021-01-05 https://scifaro.com/en/abs/bidimensional-linear-recursive-sequences-and-universality-of-unambiguous-register-automata-2101.010332021-01-05 https://scifaro.com/en/abs/quantitative-corner-case-feature-analysis-of-hybrid-automata-with-forfet-smt-2101.012552021-01-06 https://scifaro.com/en/abs/positive-first-order-logic-on-words-2101.019682021-10-12 https://scifaro.com/en/abs/parallel-hyperedge-replacement-grammars-2101.023102021-01-08 https://scifaro.com/en/abs/on-satisficing-in-quantitative-games-2101.025942021-01-08 https://scifaro.com/en/abs/nondeterministic-syntactic-complexity-2101.030392021-01-12 https://scifaro.com/en/abs/synchronization-of-strongly-connected-partial-dfas-and-prefix-codes-2101.050572026-05-27 https://scifaro.com/en/abs/a-ramsey-theorem-for-finite-monoids-2101.058952021-01-18 https://scifaro.com/en/abs/computability-of-data-word-transductions-over-different-data-domains-2101.070382023-06-22 https://scifaro.com/en/abs/a-passive-online-technique-for-learning-hybrid-automata-from-input-output-traces-2101.070532021-01-19 https://scifaro.com/en/abs/sd-regular-transducer-expressions-for-aperiodic-transformations-2101.071302021-01-19 https://scifaro.com/en/abs/formal-ft-based-cause-consequence-reliability-analysis-using-theorem-proving-2101.071742021-01-21 https://scifaro.com/en/abs/one-way-resynchronizability-of-word-transducers-2101.080112021-01-21 https://scifaro.com/en/abs/synthesizing-context-free-grammars-from-recurrent-neural-networks-extended-version-2101.082002021-03-30 https://scifaro.com/en/abs/general-decidability-results-for-asynchronous-shared-memory-programs-higher-order-and-beyond-2101.086112023-06-22 https://scifaro.com/en/abs/leafy-automata-for-higher-order-concurrency-2101.087202021-01-22 https://scifaro.com/en/abs/certifying-inexpressibility-2101.087562022-01-26 https://scifaro.com/en/abs/continuous-one-counter-automata-2101.119962021-02-04 https://scifaro.com/en/abs/the-complexity-of-learning-linear-temporal-formulas-from-examples-2102.008762021-02-02 https://scifaro.com/en/abs/recursive-prime-factorizations-dyck-words-as-numbers-2102.027772026-02-18 https://scifaro.com/en/abs/parallel-hyperedge-replacement-string-languages-2102.031642021-02-23 https://scifaro.com/en/abs/lie-complexity-of-words-2102.038212021-02-09 https://scifaro.com/en/abs/regular-model-checking-approach-to-knowledge-reasoning-over-parameterized-systems-technical-report-2102.043612021-03-10 https://scifaro.com/en/abs/recognizability-of-languages-via-deterministic-finite-automata-with-values-on-a-monoid-general-myhill-nerode-theorem-2102.059682021-02-12 https://scifaro.com/en/abs/co-lexicographically-ordering-automata-and-regular-languages-part-ii-2102.067982023-03-13 https://scifaro.com/en/abs/optimal-spectral-norm-approximate-minimization-of-weighted-finite-automata-2102.068602021-05-18 https://scifaro.com/en/abs/adaptive-synchronisation-of-pushdown-automata-2102.068972021-02-16 https://scifaro.com/en/abs/matchkat-an-algebraic-foundation-for-match-action-2102.073742021-02-16 https://scifaro.com/en/abs/learning-pomset-automata-2102.075042023-02-03 https://scifaro.com/en/abs/locality-and-centrality-the-variety-zg-2102.077242024-02-14 https://scifaro.com/en/abs/dynamic-membership-for-regular-languages-2102.077282021-06-07 https://scifaro.com/en/abs/new-techniques-for-universality-in-unambiguous-register-automata-2102.083312021-02-17 https://scifaro.com/en/abs/on-polynomial-grammars-extended-with-substitution-2102.087052021-02-18 https://scifaro.com/en/abs/on-typical-hesitant-fuzzy-languages-and-automata-2102.093472021-02-19 https://scifaro.com/en/abs/synthesis-and-implementation-of-distributed-supervisory-controllers-with-communication-delays-2102.098212021-02-22 https://scifaro.com/en/abs/keyboards-as-a-new-model-of-computation-2102.101822021-09-07 https://scifaro.com/en/abs/simplest-non-regular-deterministic-context-free-language-2102.104162021-02-23 https://scifaro.com/en/abs/model-checking-for-decision-making-system-of-long-endurance-unmanned-surface-vehicle-2102.106042021-02-24 https://scifaro.com/en/abs/automatic-sequences-from-rational-bases-to-trees-2102.108282023-06-22 https://scifaro.com/en/abs/a-theory-of-automated-market-makers-in-defi-2102.113502023-06-22 https://scifaro.com/en/abs/decision-power-of-weak-asynchronous-models-of-distributed-computing-2102.116302021-06-03 https://scifaro.com/en/abs/explaining-safety-failures-in-netkat-2102.124482021-02-25 https://scifaro.com/en/abs/subcubic-certificates-for-cfl-reachability-2102.130952021-02-26 https://scifaro.com/en/abs/directing-words-of-fuzzy-finite-automata-2103.009422021-03-02 https://scifaro.com/en/abs/mora-automatic-generation-of-moment-based-invariants-2103.039082021-03-09 https://scifaro.com/en/abs/on-the-determinization-of-event-clock-input-driven-pushdown-automata-2103.040792021-03-09 https://scifaro.com/en/abs/equivalence-checking-and-intersection-of-deterministic-timed-finite-state-machines-2103.048682021-03-09 https://scifaro.com/en/abs/converting-nondeterministic-two-way-automata-into-small-deterministic-linear-time-machines-2103.054852021-03-11 https://scifaro.com/en/abs/weight-reducing-turing-machines-2103.054862021-03-11 https://scifaro.com/en/abs/synthesis-from-weighted-specifications-with-partial-domains-over-finite-words-2103.055502021-03-10 https://scifaro.com/en/abs/synthesizing-computable-functions-from-rational-specifications-over-infinite-words-2103.056742024-02-09 https://scifaro.com/en/abs/bounded-invariant-checking-for-stateflow-programs-2103.062482021-11-22 https://scifaro.com/en/abs/ordered-semiautomatic-rings-with-applications-to-geometry-2103.067142021-03-16 https://scifaro.com/en/abs/languages-of-higher-dimensional-automata-2103.075572021-09-06 https://scifaro.com/en/abs/initial-nonrepetitive-complexity-of-regular-episturmian-words-and-their-diophantine-exponents-2103.083512024-03-28 https://scifaro.com/en/abs/regularity-conditions-for-iterated-shuffle-on-commutative-regular-languages-2103.095872021-08-19 https://scifaro.com/en/abs/a-general-language-based-framework-for-specifying-and-verifying-notions-of-opacity-2103.105012022-05-10 https://scifaro.com/en/abs/discovering-an-algorithm-actually-learning-restricted-single-occurrence-regular-expression-with-interleaving-2103.105462021-03-22 https://scifaro.com/en/abs/nonterminal-complexity-of-some-families-of-infinite-regular-languages-2103.111742021-03-23 https://scifaro.com/en/abs/on-the-uniform-distribution-of-regular-expressions-2103.131752021-03-25 https://scifaro.com/en/abs/on-the-theory-of-stochastic-automata-2103.144232021-03-29 https://scifaro.com/en/abs/on-symmetric-higher-dimensional-automata-and-bisimilarity-2103.152232021-03-30 https://scifaro.com/en/abs/aperiodic-two-way-transducers-and-fo-transductions-2103.156512021-03-30 https://scifaro.com/en/abs/a-note-on-the-join-of-varieties-of-monoids-with-li-2103.156592021-08-31 https://scifaro.com/en/abs/approximation-algorithm-for-finding-short-synchronizing-words-in-weighted-automata-2103.161852021-03-31 https://scifaro.com/en/abs/revisiting-regular-sequences-in-light-of-rational-base-numeration-systems-2103.169662021-04-01 https://scifaro.com/en/abs/orbit-finite-dimensional-vector-spaces-and-weighted-register-automata-2104.024382024-08-07 https://scifaro.com/en/abs/visualization-of-the-computation-process-of-a-universal-register-machine-2104.029202021-05-25 https://scifaro.com/en/abs/congruence-relations-for-b-uchi-automata-2104.035552021-05-12 https://scifaro.com/en/abs/determinisability-of-register-and-timed-automata-2104.036902023-06-22 https://scifaro.com/en/abs/the-theory-of-universal-graphs-for-infinite-duration-games-2104.052622023-06-22 https://scifaro.com/en/abs/control-synthesis-for-parametric-timed-automata-under-unavoidability-specifications-2104.091542021-04-20 https://scifaro.com/en/abs/affine-automata-verifiers-2104.111922021-04-23 https://scifaro.com/en/abs/a-congruence-based-perspective-on-finite-tree-automata-2104.114532023-06-22 https://scifaro.com/en/abs/active-learning-of-sequential-transducers-with-side-information-about-the-domain-2104.117582021-04-27 https://scifaro.com/en/abs/parikh-s-theorem-for-infinite-alphabets-2104.120182021-04-27 https://scifaro.com/en/abs/resynchronized-uniformization-and-definability-problems-for-rational-relations-2104.125082024-02-14 https://scifaro.com/en/abs/canonical-automata-via-distributive-law-homomorphisms-2104.134212021-12-30 https://scifaro.com/en/abs/temporal-reasoning-through-automatic-translation-of-tock-csp-into-timed-automata-2104.134342021-04-29 https://scifaro.com/en/abs/formal-characterization-and-efficient-verification-of-a-biological-robustness-property-2104.138312021-04-29 https://scifaro.com/en/abs/reachability-in-vector-addition-systems-is-ackermann-complete-2104.138662022-10-27 https://scifaro.com/en/abs/pebble-transducers-with-unary-output-2104.140192022-10-03 https://scifaro.com/en/abs/guessing-the-buffer-bound-for-k-synchronizability-2104.144082021-04-30 https://scifaro.com/en/abs/methodology-for-biasing-random-simulation-for-rapid-coverage-of-corner-cases-in-ams-designs-2104.147852021-05-03 https://scifaro.com/en/abs/long-runs-imply-big-separators-in-vector-addition-systems-2105.000522022-09-14 https://scifaro.com/en/abs/a-structural-operational-semantics-for-interactions-with-a-look-at-loops-2105.002082021-05-04 https://scifaro.com/en/abs/properties-of-graphs-specified-by-a-regular-language-2105.004362021-10-13 https://scifaro.com/en/abs/winning-sets-of-regular-languages-descriptional-and-computational-complexity-2105.004522021-05-04 https://scifaro.com/en/abs/deterministic-and-game-separability-for-regular-languages-of-infinite-trees-2105.011372021-05-05 https://scifaro.com/en/abs/degrees-of-restriction-for-two-dimensional-automata-2105.011792021-05-05 https://scifaro.com/en/abs/environment-modeling-during-model-checking-of-cyber-physical-systems-2105.012362021-05-05 https://scifaro.com/en/abs/signal-automata-and-hidden-markov-models-2105.013412021-05-05 https://scifaro.com/en/abs/simulation-by-rounds-of-letter-to-letter-transducers-2105.015122024-02-14 https://scifaro.com/en/abs/polynomial-graph-parsing-with-non-structural-reentrancies-2105.020332021-05-10 https://scifaro.com/en/abs/a-bit-of-nondeterminism-makes-pushdown-automata-expressive-and-succinct-2105.026112024-08-07 https://scifaro.com/en/abs/branching-frequency-and-markov-entropy-of-repetition-free-languages-2105.027502021-05-07 https://scifaro.com/en/abs/petri-net-invariant-synthesis-2105.030962021-05-10 https://scifaro.com/en/abs/executable-interval-temporal-logic-specifications-2105.033752021-07-12 https://scifaro.com/en/abs/parallel-sandpiles-or-spurious-bidirectional-icepiles-2105.043082021-05-18 https://scifaro.com/en/abs/policy-synthesis-for-metric-interval-temporal-logic-with-probabilistic-distributions-2105.045932021-05-12 https://scifaro.com/en/abs/a-new-version-of-toom-s-proof-2105.059682021-05-14 https://scifaro.com/en/abs/on-complementing-unambiguous-automata-and-graphs-with-many-cliques-and-cocliques-2105.074702022-03-17 https://scifaro.com/en/abs/comparison-free-polyregular-functions-2105.083582023-03-24 https://scifaro.com/en/abs/improved-ackermannian-lower-bound-for-the-petri-nets-reachability-problem-2105.085512022-01-14 https://scifaro.com/en/abs/the-v-c-erny-conjecture-for-aperiodic-automata-2105.091052021-05-20 https://scifaro.com/en/abs/deciding-fo2-alternation-for-automata-over-finite-and-infinite-words-2105.092912021-09-02 https://scifaro.com/en/abs/conelikes-and-ranker-comparisons-2105.093462021-10-01 https://scifaro.com/en/abs/forest-languages-defined-by-counting-maximal-paths-2105.099702021-06-15 https://scifaro.com/en/abs/a-generic-solution-to-register-bounded-synthesis-with-an-application-to-discrete-orders-2105.099782022-05-23 https://scifaro.com/en/abs/minimization-and-synthesis-of-the-tail-in-sequential-compositions-of-mealy-machines-2105.102922021-10-08 https://scifaro.com/en/abs/decision-questions-for-probabilistic-automata-on-small-alphabets-2105.102932024-02-14 https://scifaro.com/en/abs/an-algorithm-to-verify-local-threshold-testability-of-deterministic-finite-automata-2105.106542021-05-25 https://scifaro.com/en/abs/asynchronous-wreath-product-and-cascade-decompositions-for-concurrent-behaviours-2105.108972023-06-22 https://scifaro.com/en/abs/automata-learning-for-automated-test-generation-of-real-time-localization-systems-2105.119112021-05-26 https://scifaro.com/en/abs/on-the-minimisation-of-transition-based-rabin-automata-and-the-chromatic-memory-requirements-of-muller-conditions-2105.120092021-11-08 https://scifaro.com/en/abs/an-explicit-algorithm-for-normal-forms-in-small-overlap-monoids-2105.121252023-05-05 https://scifaro.com/en/abs/a-package-testas-for-checking-some-kinds-of-testability-2105.125832021-05-27 https://scifaro.com/en/abs/fast-zone-based-algorithms-for-reachability-in-pushdown-timed-automata-2105.136832021-07-20 https://scifaro.com/en/abs/adapting-behaviors-via-reactive-synthesis-2105.138372021-05-31 https://scifaro.com/en/abs/definability-results-for-top-down-tree-transducers-2105.148602021-06-01 https://scifaro.com/en/abs/lower-bounds-for-the-number-of-repetitions-in-2d-strings-2105.149032021-06-01 https://scifaro.com/en/abs/a-new-distance-based-on-minimal-absent-words-and-applications-to-biological-sequences-2105.149902021-06-01 https://scifaro.com/en/abs/detecting-a-single-fault-in-a-deterministic-finite-automaton-2106.001562021-06-02 https://scifaro.com/en/abs/ordering-regular-languages-a-danger-zone-2106.003152021-06-14 https://scifaro.com/en/abs/hilbert-s-spacefilling-curve-described-by-automatic-regular-and-synchronized-sequences-2106.010622021-06-03 https://scifaro.com/en/abs/on-co-lex-ordering-automata-2106.023092021-06-07 https://scifaro.com/en/abs/verification-tools-for-checking-some-kinds-of-testability-2106.023122021-06-07 https://scifaro.com/en/abs/the-inclusion-problem-for-forest-languages-under-substitutions-2106.025712021-06-07 https://scifaro.com/en/abs/generalized-linear-one-way-jumping-finite-automata-2106.029372021-06-08 https://scifaro.com/en/abs/free-choice-nets-with-home-clusters-are-lucent-2106.035542021-06-08 https://scifaro.com/en/abs/reduction-using-induced-subnets-to-systematically-prove-properties-for-free-choice-nets-2106.036582021-06-18 https://scifaro.com/en/abs/generalized-circular-one-way-jumping-finite-automata-2106.038522021-06-09 https://scifaro.com/en/abs/minimality-notions-via-factorization-systems-2106.072332021-11-09 https://scifaro.com/en/abs/automatic-winning-shifts-2106.072492022-06-15 https://scifaro.com/en/abs/the-connection-between-process-complexity-of-event-sequences-and-models-discovered-by-process-mining-2106.079902023-07-12 https://scifaro.com/en/abs/posets-with-interfaces-as-a-model-for-concurrency-2106.108952022-11-07 https://scifaro.com/en/abs/reasoning-about-emergence-of-collective-memory-2106.115052021-06-23 https://scifaro.com/en/abs/connectivity-of-spaces-of-directed-paths-in-geometric-models-for-concurrent-computation-2106.117032022-09-07 https://scifaro.com/en/abs/decomposition-of-transition-systems-into-sets-of-synchronizing-state-machines-2106.138522022-05-05 https://scifaro.com/en/abs/the-degree-of-a-finite-set-of-words-2106.144712022-07-28 https://scifaro.com/en/abs/a-set-automaton-to-locate-all-pattern-matches-in-a-term-2106.153112021-06-30 https://scifaro.com/en/abs/finite-image-property-of-weighted-tree-automata-over-past-finite-monotonic-strong-bimonoids-2106.158672021-07-01 https://scifaro.com/en/abs/determinization-and-limit-determinization-of-emerson-lei-automata-2106.158922021-07-01 https://scifaro.com/en/abs/improved-constructions-for-succinct-affine-automata-2106.161972021-07-01 https://scifaro.com/en/abs/certifying-dfa-bounds-for-recognition-and-separation-2107.015662022-01-20 https://scifaro.com/en/abs/decision-problems-for-origin-close-top-down-tree-transducers-full-version-2107.025912021-07-07 https://scifaro.com/en/abs/deciding-top-down-determinism-of-regular-tree-languages-2107.031742021-07-08 https://scifaro.com/en/abs/nominal-b-uchi-automata-with-name-allocation-2107.032132021-07-13 https://scifaro.com/en/abs/syntactic-minimization-of-nondeterministic-finite-automata-2107.032292021-07-12 https://scifaro.com/en/abs/generalising-projection-in-asynchronous-multiparty-session-types-2107.039842022-08-12 https://scifaro.com/en/abs/on-the-expressive-power-of-non-deterministic-and-unambiguous-petri-nets-over-infinite-words-2107.040252023-06-22 https://scifaro.com/en/abs/algebra-and-coalgebra-of-stream-products-2107.044552024-05-24 https://scifaro.com/en/abs/decomposing-permutation-automata-2107.046832021-07-13 https://scifaro.com/en/abs/a-new-approach-for-active-automata-learning-based-on-apartness-2107.054192022-01-28 https://scifaro.com/en/abs/normal-sequences-with-non-maximal-automatic-complexity-2107.059792021-11-30 https://scifaro.com/en/abs/composition-of-choreography-automata-2107.067272021-07-15 https://scifaro.com/en/abs/decidability-of-liveness-on-the-tso-memory-model-2107.099302021-07-22 https://scifaro.com/en/abs/logics-meet-2-way-1-clock-alternating-timed-automata-2107.129862022-03-01 https://scifaro.com/en/abs/bottom-up-derivatives-of-tree-expressions-2107.133732021-07-29 https://scifaro.com/en/abs/computational-complexity-of-synchronization-under-sparse-regular-constraints-2108.000812021-08-03 https://scifaro.com/en/abs/scope-bounded-reachability-in-valence-systems-2108.009632021-08-03 https://scifaro.com/en/abs/featured-team-automata-2108.017842021-08-05 https://scifaro.com/en/abs/constructing-deterministic-omega-automata-from-examples-by-an-extension-of-the-rpni-algorithm-2108.037352021-08-10 https://scifaro.com/en/abs/decentralized-observation-of-discrete-event-systems-at-least-one-can-tell-2108.045232021-08-11 https://scifaro.com/en/abs/finite-automata-intersection-non-emptiness-parameterized-complexity-revisited-2108.052442021-08-12 https://scifaro.com/en/abs/composition-machines-programming-self-organising-software-models-for-the-emergence-of-sequential-program-spaces-2108.054022025-08-27 https://scifaro.com/en/abs/automatic-sequences-of-rank-two-2108.054342021-08-13 https://scifaro.com/en/abs/automating-system-configuration-2108.059872021-08-20 https://scifaro.com/en/abs/state-complexity-of-projection-on-languages-recognized-by-permutation-automata-and-commuting-letters-2108.069762021-08-17 https://scifaro.com/en/abs/constrained-synchronization-and-subset-synchronization-problems-for-weakly-acyclic-automata-2108.069842021-08-17 https://scifaro.com/en/abs/on-balanced-sequences-and-their-critical-exponent-2108.075032022-10-21 https://scifaro.com/en/abs/the-n-ary-initial-literal-and-literal-shuffle-2108.092822021-08-23 https://scifaro.com/en/abs/second-order-finite-automata-2108.127512021-08-31 https://scifaro.com/en/abs/parameterizations-of-logarithmic-space-reductions-stack-state-complexity-of-nonuniform-families-of-pushdown-automata-and-a-road-to-the-logcfl-subseteq-logdcfl-poly-question-2108.127792021-08-31 https://scifaro.com/en/abs/a-mechanically-verified-theory-of-contracts-2108.136472021-09-01 https://scifaro.com/en/abs/extremal-binary-pfas-with-small-number-of-states-2108.139272023-04-18 https://scifaro.com/en/abs/absent-subsequences-in-words-2108.139682026-04-08 https://scifaro.com/en/abs/coalgebras-for-bisimulation-of-weighted-automata-over-semirings-2109.007322023-06-22 https://scifaro.com/en/abs/image-binary-automata-2109.010492022-03-29 https://scifaro.com/en/abs/a-survey-of-practical-formal-methods-for-security-2109.013622021-09-06 https://scifaro.com/en/abs/constrained-synchronization-for-commutative-automata-and-automata-with-simple-idempotents-2109.027432021-09-08 https://scifaro.com/en/abs/good-enough-synthesis-2109.035942021-09-09 https://scifaro.com/en/abs/cost-problems-for-parametric-time-petri-nets-2109.036582023-06-22 https://scifaro.com/en/abs/reducing-higher-order-recursion-scheme-equivalence-to-coinductive-higher-order-constrained-horn-clauses-2109.046322021-09-13 https://scifaro.com/en/abs/the-decidability-of-the-genus-of-regular-languages-and-directed-emulators-2109.057352024-04-10 https://scifaro.com/en/abs/diagnosability-of-labeled-mathfrak-d-p-automata-2109.071252024-02-16 https://scifaro.com/en/abs/proceedings-12th-international-symposium-on-games-automata-logics-and-formal-verification-2109.077982021-09-17 https://scifaro.com/en/abs/adapting-to-the-behavior-of-environments-with-bounded-memory-2109.083162021-09-20 https://scifaro.com/en/abs/expressiveness-of-extended-bounded-response-ltl-2109.083192021-09-20 https://scifaro.com/en/abs/a-nivat-theorem-for-weighted-alternating-automata-over-commutative-semirings-2109.083232021-09-20 https://scifaro.com/en/abs/lower-bounds-for-unambiguous-automata-via-communication-complexity-2109.091552022-02-15 https://scifaro.com/en/abs/abelian-repetition-threshold-revisited-2109.093062021-09-21 https://scifaro.com/en/abs/on-the-power-of-finite-ambiguity-in-b-uchi-complementation-2109.128282023-03-06 https://scifaro.com/en/abs/approximate-bisimulation-minimisation-2110.003262021-10-04 https://scifaro.com/en/abs/on-the-complexity-of-intersection-non-emptiness-for-star-free-language-classes-2110.012792021-10-05 https://scifaro.com/en/abs/the-complexity-of-bidirected-reachability-in-valence-systems-2110.036542022-06-28 https://scifaro.com/en/abs/symbolic-register-automata-for-complex-event-recognition-and-forecasting-2110.040322021-10-11 https://scifaro.com/en/abs/a-characterization-of-totally-compatible-automata-2110.051732021-10-12 https://scifaro.com/en/abs/the-algebra-of-row-monomial-matrices-2110.068392022-10-05 https://scifaro.com/en/abs/what-can-we-learn-from-universal-turing-machines-2110.085112021-10-19 https://scifaro.com/en/abs/derived-terms-without-derivation-a-shifted-perspective-on-the-derived-term-automaton-2110.091812021-10-19 https://scifaro.com/en/abs/turing-tumble-is-turing-complete-2110.093432021-10-19 https://scifaro.com/en/abs/learning-realtime-one-counter-automata-2110.094342024-09-16 https://scifaro.com/en/abs/investigating-reversibility-of-steps-in-petri-nets-2110.105352023-06-22 https://scifaro.com/en/abs/weighted-automata-and-expressions-over-pre-rational-monoids-2110.123952021-10-26 https://scifaro.com/en/abs/ltl-based-non-markovian-inverse-reinforcement-learning-2110.136162023-03-02 https://scifaro.com/en/abs/history-determinism-vs-good-for-gameness-in-quantitative-automata-2110.142382021-10-28 https://scifaro.com/en/abs/token-games-and-history-deterministic-quantitative-automata-2110.143082024-02-14 https://scifaro.com/en/abs/articulations-and-products-of-transition-systems-and-their-applications-to-petri-net-synthesis-2111.002022023-06-22 https://scifaro.com/en/abs/a-framework-for-transforming-specifications-in-reinforcement-learning-2111.002722022-05-31 https://scifaro.com/en/abs/introduction-to-probabilistic-concurrent-systems-2111.005072023-06-22 https://scifaro.com/en/abs/the-no-endmarker-theorem-for-one-way-probabilistic-pushdown-automata-2111.026882025-11-11 https://scifaro.com/en/abs/model-checking-temporal-properties-of-recursive-probabilistic-programs-2111.035012024-02-14 https://scifaro.com/en/abs/modular-decomposition-of-hierarchical-finite-state-machines-2111.049022025-04-03 https://scifaro.com/en/abs/behavioral-strengths-and-weaknesses-of-various-models-of-limited-automata-2111.050002021-11-10 https://scifaro.com/en/abs/a-diamond-structure-in-the-transducer-hierarchy-2111.054812025-12-17 https://scifaro.com/en/abs/conservative-hybrid-automata-from-development-artifacts-2111.056132022-01-24 https://scifaro.com/en/abs/classifying-all-degrees-below-n-3-2111.065052021-11-15 https://scifaro.com/en/abs/developing-a-prototype-of-a-mechanical-ventilator-controller-from-requirements-to-code-with-asmeta-2111.082042021-11-17 https://scifaro.com/en/abs/context-bounded-verification-of-thread-pools-2111.090222021-11-18 https://scifaro.com/en/abs/homomorphisms-on-graph-walking-automata-2111.102142021-11-22 https://scifaro.com/en/abs/max-algebraic-hybrid-automata-modelling-and-equivalences-2111.103182021-11-22 https://scifaro.com/en/abs/generating-tree-structures-for-hyperbolic-tessellations-2111.120402022-03-18 https://scifaro.com/en/abs/regulated-multiset-rewriting-systems-2111.130362023-12-21 https://scifaro.com/en/abs/commutative-regular-languages-with-product-form-minimal-automata-2111.135232021-11-29 https://scifaro.com/en/abs/state-complexity-investigations-on-commutative-languages-the-upward-and-downward-closure-commutative-aperiodic-and-commutative-group-languages-2111.135242021-11-29 https://scifaro.com/en/abs/sync-maximal-permutation-groups-equal-primitive-permutation-groups-2111.135272021-11-29 https://scifaro.com/en/abs/a-topological-approach-for-computing-supremal-sublanguages-for-some-language-equations-in-supervisory-control-theory-2111.138402021-11-30 https://scifaro.com/en/abs/on-formally-undecidable-propositions-in-nondeterministic-languages-2111.148072021-11-30 https://scifaro.com/en/abs/undecidability-in-finite-transducers-defense-systems-and-finite-substitutions-2111.154202021-12-01 https://scifaro.com/en/abs/some-basic-techniques-allowing-petri-net-synthesis-complexity-and-algorithmic-issues-2112.036052023-06-22 https://scifaro.com/en/abs/synthesis-of-pure-and-impure-petri-nets-with-restricted-place-environments-complexity-issues-2112.036082023-06-22 https://scifaro.com/en/abs/active-learning-of-abstract-system-models-from-traces-using-model-checking-extended-2112.059902021-12-15 https://scifaro.com/en/abs/on-ll-k-linear-conjunctive-grammars-2112.080142021-12-16 https://scifaro.com/en/abs/verification-of-component-based-systems-with-recursive-architectures-2112.082922021-12-16 https://scifaro.com/en/abs/intersection-and-union-hierarchies-of-deterministic-context-free-languages-and-pumping-lemmas-2112.093832025-11-04 https://scifaro.com/en/abs/hiding-pebbles-when-the-output-alphabet-is-unary-2112.102122022-10-03 https://scifaro.com/en/abs/proceedings-twelfth-international-workshop-on-graph-computational-models-2112.102172021-12-21 https://scifaro.com/en/abs/grammars-based-on-a-logic-of-hypergraph-languages-2112.110332021-12-22 https://scifaro.com/en/abs/properties-of-a-class-of-toeplitz-words-2112.121252021-12-23 https://scifaro.com/en/abs/determinization-of-one-counter-nets-2112.137162021-12-28 https://scifaro.com/en/abs/efficient-enumeration-algorithms-for-annotated-grammars-2201.005492023-03-02 https://scifaro.com/en/abs/decision-trees-for-binary-subword-closed-languages-2201.014932023-03-22 https://scifaro.com/en/abs/finite-word-hyperlanguages-2201.016702022-01-06 https://scifaro.com/en/abs/decision-trees-for-regular-factorial-languages-2201.019522022-01-07 https://scifaro.com/en/abs/completely-reachable-automata-an-interplay-between-automata-graphs-and-trees-2201.050752022-01-14 https://scifaro.com/en/abs/improvements-to-ltlsynt-2201.053762022-01-17 https://scifaro.com/en/abs/mechanical-proving-with-walnut-for-squares-and-cubes-in-partial-words-2201.059542022-08-11 https://scifaro.com/en/abs/the-normalized-edit-distance-with-uniform-operation-costs-is-a-metric-2201.061152022-04-26 https://scifaro.com/en/abs/characterizing-level-one-in-group-based-concatenation-hierarchies-2201.068262022-01-19 https://scifaro.com/en/abs/time-distance-based-computation-of-the-state-space-of-preemptive-real-time-systems-2201.097842022-01-25 https://scifaro.com/en/abs/supported-sets-a-new-foundation-for-nominal-sets-and-automata-2201.098252022-10-06 https://scifaro.com/en/abs/on-the-translation-of-automata-to-linear-temporal-logic-2201.102672022-05-10 https://scifaro.com/en/abs/positive-first-order-logic-on-words-and-graphs-2201.116192024-02-14 https://scifaro.com/en/abs/topological-invariants-for-words-of-linear-factor-complexity-2202.006432022-05-12 https://scifaro.com/en/abs/approximate-nfa-universality-and-related-problems-motivated-by-information-theory-2202.015942022-04-13 https://scifaro.com/en/abs/logarithmic-equal-letter-runs-for-bwt-of-purely-morphic-words-2202.026092022-02-08 https://scifaro.com/en/abs/on-the-complexity-of-coordinated-table-selective-substitution-systems-2202.026132022-02-08 https://scifaro.com/en/abs/kleene-theorem-for-higher-dimensional-automata-2202.037912024-12-18 https://scifaro.com/en/abs/the-amazing-mixed-polynomial-closure-and-its-applications-to-two-variable-first-order-logic-2202.039892023-01-03 https://scifaro.com/en/abs/efficient-construction-of-reversible-transducers-from-regular-transducer-expressions-2202.043402022-02-10 https://scifaro.com/en/abs/minimality-notions-via-factorization-systems-and-examples-2202.057012025-12-15 https://scifaro.com/en/abs/fast-symbolic-algorithms-for-omega-regular-games-under-strong-transition-fairness-2202.074802023-06-22 https://scifaro.com/en/abs/on-good-for-mdps-automata-2202.076292026-01-01 https://scifaro.com/en/abs/language-inclusion-for-boundedly-ambiguous-vector-addition-systems-is-decidable-2202.080332025-03-26 https://scifaro.com/en/abs/finite-maximal-codes-and-factorizations-of-cyclic-groups-2202.096752024-04-30 https://scifaro.com/en/abs/construction-of-a-bi-infinite-power-free-word-with-a-given-factor-and-a-non-recurrent-letter-2202.120382023-07-10 https://scifaro.com/en/abs/a-simpler-alternative-minimizing-transition-systems-modulo-alternating-simulation-equivalence-2203.016722022-03-04 https://scifaro.com/en/abs/intertwining-of-complementary-thue-morse-factors-2203.029172022-03-08 https://scifaro.com/en/abs/weak-muller-conditions-make-delay-games-hard-2203.034042022-10-20 https://scifaro.com/en/abs/mwp-analysis-improvement-and-implementation-realizing-implicit-computational-complexity-2203.039432022-03-09 https://scifaro.com/en/abs/lower-bounds-for-the-reachability-problem-in-fixed-dimensional-vasses-2203.042432022-03-09 https://scifaro.com/en/abs/well-quasi-orders-arising-from-finite-ordered-semigroups-2203.065352022-03-15 https://scifaro.com/en/abs/quantum-finite-automata-and-quiver-algebras-2203.075972022-04-21 https://scifaro.com/en/abs/between-sc-and-logdcfl-families-of-languages-accepted-by-logarithmic-space-deterministic-auxiliary-depth-k-storage-automata-2203.101932024-04-16 https://scifaro.com/en/abs/note-on-a-fibonacci-parity-sequence-2203.105042022-03-22 https://scifaro.com/en/abs/binary-codes-that-do-not-preserve-primitivity-2203.113412025-10-09 https://scifaro.com/en/abs/reduction-of-register-pushdown-systems-with-freshness-property-to-pushdown-systems-in-ltl-model-checking-2203.118262022-09-14 https://scifaro.com/en/abs/ordering-regular-languages-and-automata-complexity-2203.125342022-03-24 https://scifaro.com/en/abs/zone-extrapolations-in-parametric-timed-automata-2203.131732022-06-08 https://scifaro.com/en/abs/exemplifying-parametric-timed-specifications-over-signals-with-bounded-behavior-2203.132472022-06-08 https://scifaro.com/en/abs/opportunistic-qualitative-planning-in-stochastic-systems-with-preferences-over-temporal-logic-objectives-2203.138032022-03-28 https://scifaro.com/en/abs/sublinear-time-probabilistic-cellular-automata-2203.146142023-03-15 https://scifaro.com/en/abs/row-monomial-matrices-and-v-c-erny-conjecture-short-proof-2203.148222022-11-21 https://scifaro.com/en/abs/kleene-star-of-the-primes-is-not-regular-in-any-base-2203.160882022-04-12 https://scifaro.com/en/abs/looking-for-winning-strategies-in-two-player-games-on-petri-nets-with-partial-observability-2204.016032022-04-05 https://scifaro.com/en/abs/on-the-expressive-power-of-the-normal-form-for-branching-time-temporal-logics-2204.067362022-04-15 https://scifaro.com/en/abs/a-shortest-string-decoding-for-non-idempotent-semirings-2204.072362024-01-29 https://scifaro.com/en/abs/continuous-rational-functions-are-deterministic-regular-2204.112352022-11-04 https://scifaro.com/en/abs/on-the-size-of-good-for-games-rabin-automata-and-its-link-with-the-memory-in-muller-games-2204.113332022-05-02 https://scifaro.com/en/abs/parameterized-safety-verification-of-round-based-shared-memory-systems-2204.116702022-04-26 https://scifaro.com/en/abs/reachability-in-bidirected-pushdown-vass-2204.117992022-04-26 https://scifaro.com/en/abs/fast-coalgebraic-bisimilarity-minimization-2204.123682022-11-18 https://scifaro.com/en/abs/guarded-kleene-algebra-with-tests-automata-learning-2204.141532023-06-22 https://scifaro.com/en/abs/formal-languages-via-theories-over-strings-2205.004752022-05-03 https://scifaro.com/en/abs/deterministic-pushdown-automata-can-compress-some-normal-sequences-2205.007342024-08-21 https://scifaro.com/en/abs/group-separation-strikes-back-2205.016322023-05-01 https://scifaro.com/en/abs/a-generic-solution-to-register-bounded-synthesis-with-an-application-to-discrete-orders-2205.019522022-06-09 https://scifaro.com/en/abs/fuzzy-simulations-and-bisimulations-between-fuzzy-automata-2205.019552022-05-05 https://scifaro.com/en/abs/a-fibonacci-analogue-of-the-two-s-complement-numeration-system-2205.025742024-02-27 https://scifaro.com/en/abs/alternating-good-for-mdp-automata-2205.032432022-05-09 https://scifaro.com/en/abs/standard-automata-theory-and-process-algebra-2205.035152026-04-21 https://scifaro.com/en/abs/a-regular-and-complete-notion-of-delay-for-streaming-string-transducers-2205.042872024-04-30 https://scifaro.com/en/abs/parsing-expression-gll-2205.046002022-08-29 https://scifaro.com/en/abs/a-polynomial-time-algorithm-for-local-testability-and-its-level-2205.054342022-05-12 https://scifaro.com/en/abs/analyzing-freertos-scheduling-behaviors-with-the-spin-model-checker-2205.074802022-10-10 https://scifaro.com/en/abs/strong-equivalence-of-tag-and-ccg-2205.077432022-05-17 https://scifaro.com/en/abs/probabilistic-automata-of-bounded-ambiguity-2205.081752022-05-20 https://scifaro.com/en/abs/on-eventual-non-negativity-and-positivity-for-the-weighted-sum-of-powers-of-matrices-2205.091902022-05-20 https://scifaro.com/en/abs/binary-completely-reachable-automata-2205.094042022-08-23 https://scifaro.com/en/abs/all-about-unambiguous-polynomial-closure-2205.127032024-02-14 https://scifaro.com/en/abs/real-time-visualization-of-stream-based-monitoring-data-2205.128232022-05-26 https://scifaro.com/en/abs/learning-deterministic-finite-automata-decompositions-from-examples-and-demonstrations-2205.130132022-05-27 https://scifaro.com/en/abs/the-boundedness-and-zero-isolation-problems-for-weighted-automata-over-nonnegative-rationals-2205.135162022-05-27 https://scifaro.com/en/abs/synchronizable-functions-on-integers-2205.140182022-05-30 https://scifaro.com/en/abs/computational-and-descriptional-power-of-nondeterministic-iterated-uniform-finite-state-transducers-2205.156312023-06-22 https://scifaro.com/en/abs/towards-an-aak-theory-approach-to-approximate-minimization-in-the-multi-letter-case-2206.001722022-06-02 https://scifaro.com/en/abs/string-attractors-and-infinite-words-2206.003762022-06-02 https://scifaro.com/en/abs/a-closer-look-at-tdfa-2206.013982026-03-31 https://scifaro.com/en/abs/optimal-codeword-construction-for-dna-based-finite-automata-2206.019262022-06-07 https://scifaro.com/en/abs/complementing-b-uchi-automata-with-ranker-technical-report-2206.019462022-06-07 https://scifaro.com/en/abs/universal-shape-replication-via-self-assembly-with-signal-passing-tiles-2206.039082022-06-09 https://scifaro.com/en/abs/a-report-on-achieving-complete-regular-expression-matching-using-mealy-machines-2206.049442022-06-13 https://scifaro.com/en/abs/state-complexity-of-the-star-of-a-boolean-operation-2206.051002022-06-13 https://scifaro.com/en/abs/reducing-the-local-alphabet-size-in-tiling-systems-by-means-of-2d-comma-free-codes-2206.052082022-06-13 https://scifaro.com/en/abs/computing-real-numbers-with-large-population-protocols-having-a-continuum-of-equilibria-2206.065942022-06-15 https://scifaro.com/en/abs/specification-sketching-for-linear-temporal-logic-2206.067222022-06-15 https://scifaro.com/en/abs/a-partially-synchronizing-coloring-2206.071162022-06-16 https://scifaro.com/en/abs/conformance-testing-of-mealy-machines-under-input-restrictions-2206.074412022-06-16 https://scifaro.com/en/abs/towards-efficient-active-learning-of-pdfa-2206.090042022-06-22 https://scifaro.com/en/abs/analyzing-b-uchi-automata-with-graph-neural-networks-2206.096192022-06-22 https://scifaro.com/en/abs/learning-from-positive-and-negative-examples-new-proof-for-binary-alphabets-2206.100252022-06-22 https://scifaro.com/en/abs/maximal-automatic-complexity-and-context-free-languages-2206.101302022-06-22 https://scifaro.com/en/abs/effective-reductions-of-mealy-machines-2206.102282022-06-22 https://scifaro.com/en/abs/divide-and-conquer-determinization-of-b-uchi-automata-based-on-scc-decomposition-2206.137392022-06-29 https://scifaro.com/en/abs/extending-shinohara-s-algorithm-for-computing-descriptive-angluin-style-patterns-to-subsequence-patterns-2206.139182022-06-29 https://scifaro.com/en/abs/monitoring-timed-properties-revisited-2206.145902025-09-30 https://scifaro.com/en/abs/probabilistic-model-checking-for-strategic-equilibria-based-decision-making-advances-and-challenges-2206.151482022-07-01 https://scifaro.com/en/abs/regular-monoidal-languages-2207.005262022-07-04 https://scifaro.com/en/abs/the-power-set-construction-for-tree-algebras-2207.005632024-02-14 https://scifaro.com/en/abs/interactive-learning-from-natural-language-and-demonstrations-using-signal-temporal-logic-2207.006272022-07-05 https://scifaro.com/en/abs/learning-state-machines-via-efficient-hashing-of-future-traces-2207.015162022-07-05 https://scifaro.com/en/abs/timed-alignments-2207.018702022-07-06 https://scifaro.com/en/abs/simulations-for-event-clock-automata-2207.026332024-08-07 https://scifaro.com/en/abs/global-cellular-automata-gca-a-massively-parallel-computing-model-2207.048852022-07-12 https://scifaro.com/en/abs/affinity-classification-problem-by-stochastic-cellular-automata-2207.054462022-07-13 https://scifaro.com/en/abs/an-improved-algorithm-for-finding-the-shortest-synchronizing-words-2207.054952022-07-13 https://scifaro.com/en/abs/z-polyregular-functions-2207.074502023-04-19 https://scifaro.com/en/abs/parikh-automata-over-infinite-words-2207.076942022-12-21 https://scifaro.com/en/abs/subsequences-in-bounded-ranges-matching-and-analysis-problems-2207.092012024-09-16 https://scifaro.com/en/abs/two-dimensional-typewriter-automata-2207.100162022-07-21 https://scifaro.com/en/abs/assume-guarantee-or-repair-a-regular-framework-for-non-regular-properties-full-version-2207.105342022-07-22 https://scifaro.com/en/abs/natural-colors-of-infinite-words-2207.110002022-07-25 https://scifaro.com/en/abs/development-of-monitoring-systems-for-anomaly-detection-using-astd-specifications-2207.111342022-07-25 https://scifaro.com/en/abs/machine-checked-executable-semantics-of-stateflow-2207.119652022-07-26 https://scifaro.com/en/abs/optimal-repair-for-omega-regular-properties-2207.134162022-07-28 https://scifaro.com/en/abs/forq-based-language-inclusion-formal-testing-2207.135492022-07-28 https://scifaro.com/en/abs/short-synchronizing-words-for-random-automata-2207.141082023-07-04 https://scifaro.com/en/abs/active-learning-of-one-clock-timed-automata-using-constraint-solving-2208.004122022-08-02 https://scifaro.com/en/abs/a-diamond-structure-in-the-transducer-hierarchy-2208.005542023-01-18 https://scifaro.com/en/abs/on-the-homology-language-of-hda-models-of-transition-systems-2208.022862022-08-05 https://scifaro.com/en/abs/watson-crick-conjugates-of-words-and-languages-2208.031232025-09-03 https://scifaro.com/en/abs/fair-planning-for-mobility-on-demand-with-temporal-logic-requests-2208.044162022-08-15 https://scifaro.com/en/abs/co-lexicographically-ordering-automata-and-regular-languages-part-i-2208.049312023-05-04 https://scifaro.com/en/abs/synthesizing-transducers-from-complex-specifications-2208.051312022-08-30 https://scifaro.com/en/abs/comparing-channel-restrictions-of-communicating-state-machines-high-level-message-sequence-charts-and-multiparty-session-types-2208.055592022-08-12 https://scifaro.com/en/abs/completely-reachable-automata-a-quadratic-decision-algorithm-and-a-quadratic-upper-bound-on-the-reaching-threshold-2208.059562025-02-12 https://scifaro.com/en/abs/automatic-sequences-in-negative-bases-and-proofs-of-some-conjectures-of-shevelev-2208.060252022-08-15 https://scifaro.com/en/abs/synthesis-of-parametric-hybrid-automata-from-time-series-2208.063832022-10-25 https://scifaro.com/en/abs/active-learning-for-deterministic-bottom-up-nominal-tree-automata-2208.083192022-08-18 https://scifaro.com/en/abs/a-robust-class-of-languages-of-2-nested-words-2208.103472022-08-23 https://scifaro.com/en/abs/coarser-equivalences-for-causal-concurrency-2208.121172023-10-27 https://scifaro.com/en/abs/proceedings-12th-international-workshop-on-non-classical-models-of-automata-and-applications-2208.130152022-08-30 https://scifaro.com/en/abs/reversible-computations-of-one-way-counter-automata-2208.147202022-09-01 https://scifaro.com/en/abs/combinatorial-algorithms-for-subsequence-matching-a-survey-2208.147222022-10-11 https://scifaro.com/en/abs/p-versus-b-p-systems-as-a-formal-framework-for-controllability-of-boolean-networks-2208.147232022-09-01 https://scifaro.com/en/abs/monadic-expressions-and-their-derivatives-2208.147242022-09-01 https://scifaro.com/en/abs/on-the-generative-capacity-of-contextual-grammars-with-strictly-locally-testable-selection-languages-2208.147252022-09-01 https://scifaro.com/en/abs/conclusive-tree-controlled-grammars-2208.147282022-09-01 https://scifaro.com/en/abs/non-returning-finite-automata-with-translucent-letters-2208.147292022-09-01 https://scifaro.com/en/abs/quasi-deterministic-5-3-watson-crick-automata-2208.147302022-09-01 https://scifaro.com/en/abs/on-the-accepting-state-complexity-of-operations-on-permutation-automata-2208.147312022-09-01 https://scifaro.com/en/abs/tree-based-adaptive-model-learning-2209.001222022-11-18 https://scifaro.com/en/abs/how-to-decide-functionality-of-compositions-of-top-down-tree-transducers-2209.010442022-09-05 https://scifaro.com/en/abs/computing-the-linear-hull-deciding-deterministic-and-unambiguous-for-weighted-automata-over-fields-2209.022602026-01-13 https://scifaro.com/en/abs/the-first-order-theory-of-binary-overlap-free-words-is-decidable-2209.032662022-09-08 https://scifaro.com/en/abs/practical-aspects-of-membership-problem-of-watson-crick-context-free-grammars-2209.036552022-09-09 https://scifaro.com/en/abs/wex-formal-specifications-for-windows-in-stream-processing-2209.042442025-11-18 https://scifaro.com/en/abs/polynomial-time-multiplication-and-normal-forms-in-free-bands-2209.053342023-03-23 https://scifaro.com/en/abs/composing-copyless-streaming-string-transducers-2209.054482024-02-08 https://scifaro.com/en/abs/software-hardware-codesign-for-efficient-in-memory-regular-pattern-matching-2209.056862022-09-14 https://scifaro.com/en/abs/on-the-intersection-of-context-free-and-regular-languages-2209.068092023-05-19 https://scifaro.com/en/abs/characterizing-attributed-tree-translations-in-terms-of-macro-tree-transducers-2209.070902022-09-16 https://scifaro.com/en/abs/history-deterministic-parikh-automata-2209.077452025-05-28 https://scifaro.com/en/abs/practical-lr-parser-generation-2209.083832022-09-20 https://scifaro.com/en/abs/grammars-over-the-lambek-calculus-with-permutation-recognizing-power-and-connection-to-branching-vector-addition-systems-with-states-2209.084152023-11-01 https://scifaro.com/en/abs/proceedings-of-the-13th-international-symposium-on-games-automata-logics-and-formal-verification-2209.093332022-09-21 https://scifaro.com/en/abs/constructing-concise-characteristic-samples-for-acceptors-of-omega-regular-languages-2209.093362024-11-13 https://scifaro.com/en/abs/a-hierarchy-of-nondeterminism-2209.098662025-10-29 https://scifaro.com/en/abs/realizable-and-context-free-hyperlanguages-2209.103062022-09-22 https://scifaro.com/en/abs/schema-based-automata-determinization-2209.103122022-09-22 https://scifaro.com/en/abs/generating-tokenizers-with-flat-automata-2209.103132022-09-22 https://scifaro.com/en/abs/analyzing-robustness-of-angluin-s-l-algorithm-in-presence-of-noise-2209.103152022-09-22 https://scifaro.com/en/abs/avoid-one-s-doom-finding-cliff-edge-configurations-in-petri-nets-2209.103232022-09-22 https://scifaro.com/en/abs/comparing-channel-restrictions-of-communicating-state-machines-high-level-message-sequence-charts-and-multiparty-session-types-2209.103282022-09-22 https://scifaro.com/en/abs/characterising-memory-in-infinite-games-2209.120442025-03-26 https://scifaro.com/en/abs/on-von-neumann-regularity-of-cellular-automata-2209.133732022-09-28 https://scifaro.com/en/abs/a-framework-for-formal-verification-of-dram-controllers-2209.140212022-10-03 https://scifaro.com/en/abs/active-vs-passive-a-comparison-of-automata-learning-paradigms-for-network-protocols-2209.140312022-09-29 https://scifaro.com/en/abs/skinet-a-petri-net-generation-tool-for-the-verification-of-skillset-based-autonomous-systems-2209.140392022-09-29 https://scifaro.com/en/abs/low-latency-sliding-window-algorithms-for-formal-languages-2209.148352022-10-03 https://scifaro.com/en/abs/enumerating-regular-languages-with-bounded-delay-2209.148782023-01-10 https://scifaro.com/en/abs/the-maximum-length-of-shortest-accepted-strings-for-direction-determinate-two-way-finite-automata-2210.002352022-10-04 https://scifaro.com/en/abs/a-generic-polynomial-time-approach-to-separation-by-first-order-logic-without-quantifier-alternation-2210.009462022-10-04 https://scifaro.com/en/abs/on-rational-recursive-sequences-2210.016352022-10-05 https://scifaro.com/en/abs/learning-signal-temporal-logic-through-neural-network-for-interpretable-classification-2210.019102023-07-04 https://scifaro.com/en/abs/non-closure-under-complementation-for-unambiguous-linear-grammars-2210.023292022-10-06 https://scifaro.com/en/abs/pebble-minimization-the-last-theorems-2210.024262023-01-25 https://scifaro.com/en/abs/computing-threshold-budgets-in-discrete-bidding-games-2210.027732025-07-02 https://scifaro.com/en/abs/yet-another-proof-of-parikh-s-theorem-2210.029252022-10-07 https://scifaro.com/en/abs/automata-equipped-with-auxiliary-data-structures-and-regular-realizability-problems-2210.039342022-10-11 https://scifaro.com/en/abs/stochastic-robustness-interval-for-motion-planning-with-signal-temporal-logic-2210.048132023-05-30 https://scifaro.com/en/abs/model-checking-lock-sharing-systems-against-regular-constraints-2210.079142022-10-17 https://scifaro.com/en/abs/myhill-nerode-theorem-for-higher-dimensional-automata-2210.082982026-04-08 https://scifaro.com/en/abs/on-history-deterministic-one-counter-nets-2210.100842026-05-28 https://scifaro.com/en/abs/timed-alignments-with-mixed-moves-2210.152092022-10-28 https://scifaro.com/en/abs/a-model-of-actors-and-grey-failures-2210.175082024-02-14 https://scifaro.com/en/abs/counterfactual-causality-in-networks-2211.007582022-11-03 https://scifaro.com/en/abs/verifying-and-interpreting-neural-networks-using-finite-automata-2211.010222023-09-28 https://scifaro.com/en/abs/geometry-of-reachability-sets-of-vector-addition-systems-2211.028892023-07-25 https://scifaro.com/en/abs/computable-bounds-and-monte-carlo-estimates-of-the-expected-edit-distance-2211.076442024-04-09 https://scifaro.com/en/abs/on-minimization-and-learning-of-deterministic-omega-automata-in-the-presence-of-don-t-care-words-2211.087872026-04-08 https://scifaro.com/en/abs/validating-streaming-json-documents-with-learned-vpas-2211.088912023-05-15 https://scifaro.com/en/abs/some-results-on-digital-segments-and-balanced-words-2211.094172024-11-14 https://scifaro.com/en/abs/a-note-on-generating-sets-for-semiflows-2211.104052023-02-06 https://scifaro.com/en/abs/waiting-nets-state-classes-and-taxonomy-2211.105402026-04-08 https://scifaro.com/en/abs/building-squares-with-optimal-state-complexity-in-restricted-active-self-assembly-2211.125892022-11-28 https://scifaro.com/en/abs/automata-cascades-expressivity-and-sample-complexity-2211.140282023-03-07 https://scifaro.com/en/abs/factor-balanced-s-adic-languages-2211.140762022-11-28 https://scifaro.com/en/abs/some-remarks-on-almost-periodic-sequences-and-languages-2211.146132022-11-29 https://scifaro.com/en/abs/fingerprinting-and-analysis-of-bluetooth-devices-with-automata-learning-2211.160742023-05-25 https://scifaro.com/en/abs/p-expression-grammar-probability-of-deriving-an-algebraic-expression-with-a-probabilistic-context-free-grammar-2212.007512022-12-05 https://scifaro.com/en/abs/space-complexity-of-stack-automata-models-2212.008912022-12-05 https://scifaro.com/en/abs/generalizations-of-checking-stack-automata-characterizations-and-hierarchies-2212.008972022-12-05 https://scifaro.com/en/abs/semilinearity-of-families-of-languages-2212.013012022-12-05 https://scifaro.com/en/abs/automaton-based-representations-of-task-knowledge-from-generative-language-models-2212.019442023-08-11 https://scifaro.com/en/abs/complexity-of-the-emptiness-problem-for-graph-walking-automata-and-for-tilings-with-star-subgraphs-2212.023802022-12-06 https://scifaro.com/en/abs/relationships-between-bounded-languages-counter-machines-finite-index-grammars-ambiguity-and-commutative-regularity-2212.033592022-12-08 https://scifaro.com/en/abs/why-the-equivalence-problem-for-unambiguous-grammars-has-not-been-solved-back-in-1966-2212.037862022-12-08 https://scifaro.com/en/abs/on-families-of-full-trios-containing-counter-machine-languages-2212.037912022-12-08 https://scifaro.com/en/abs/cocke-younger-kasami-schwartz-zippel-algorithm-and-relatives-2212.038612022-12-08 https://scifaro.com/en/abs/state-grammars-with-stores-2212.039922022-12-09 https://scifaro.com/en/abs/structural-reductions-and-stutter-sensitive-properties-2212.042182025-05-28 https://scifaro.com/en/abs/efficient-convex-zone-merging-in-parametric-timed-automata-2212.048022022-12-12 https://scifaro.com/en/abs/weighted-tree-automata-may-it-be-a-little-more-2212.055292026-01-28 https://scifaro.com/en/abs/correctness-notions-for-petri-nets-with-identifiers-2212.073632026-04-08 https://scifaro.com/en/abs/automata-and-automatic-sequences-2212.088572022-12-20 https://scifaro.com/en/abs/reactive-synthesis-for-declare-via-symbolic-automata-2212.108752022-12-22 https://scifaro.com/en/abs/an-elementary-proof-of-the-fmp-for-kleene-algebra-2212.109312026-03-11 https://scifaro.com/en/abs/real-valued-affine-automata-compute-beyond-turing-machines-2212.118342022-12-23 https://scifaro.com/en/abs/classical-and-quantum-merlin-arthur-automata-2212.138012024-07-19 https://scifaro.com/en/abs/the-simplest-proof-of-parikh-s-theorem-via-derivation-trees-2301.000472023-01-03 https://scifaro.com/en/abs/action-codes-2301.001992023-02-13 https://scifaro.com/en/abs/modular-mix-and-match-complementation-of-b-u-chi-automata-technical-report-2301.018902023-01-06 https://scifaro.com/en/abs/the-algebra-of-nondeterministic-finite-automata-2301.034352024-02-02 https://scifaro.com/en/abs/descriptional-complexity-of-finite-automata-selected-highlights-2301.037082026-04-08 https://scifaro.com/en/abs/alma-automata-learner-using-modulo-2-multiplicity-automata-2301.040772023-05-30 https://scifaro.com/en/abs/on-the-comparison-of-discounted-sum-automata-with-multiple-discount-factors-2301.040862023-06-12 https://scifaro.com/en/abs/certificates-for-probabilistic-pushdown-automata-via-optimistic-value-iteration-2301.086572023-02-28 https://scifaro.com/en/abs/parikh-automata-on-infinite-words-2301.089692023-01-24 https://scifaro.com/en/abs/refutations-of-pebble-minimization-via-output-languages-2301.092342023-06-21 https://scifaro.com/en/abs/word-mappings-of-level-3-2301.099662023-10-12 https://scifaro.com/en/abs/unboundedness-problems-for-machines-with-reversal-bounded-counters-2301.101982023-01-25 https://scifaro.com/en/abs/a-weakly-universal-weighted-cellular-automaton-in-the-heptagrid-with-6-states-2301.106912023-03-29 https://scifaro.com/en/abs/effective-projections-on-group-shifts-to-decide-properties-of-group-cellular-automata-2301.111332023-01-27 https://scifaro.com/en/abs/regular-separability-in-b-u-chi-vass-2301.112422023-01-27 https://scifaro.com/en/abs/fast-matching-of-regular-patterns-with-synchronizing-counting-technical-report-2301.128512023-01-31 https://scifaro.com/en/abs/monadic-expressions-and-their-derivatives-extended-version-2301.130542023-01-31 https://scifaro.com/en/abs/weighted-one-deterministic-counter-automata-2301.134562023-07-31 https://scifaro.com/en/abs/coverability-in-2-vass-with-one-unary-counter-is-in-np-2301.135432023-02-01 https://scifaro.com/en/abs/a-transaction-represented-with-weighted-finite-state-transducers-2302.002002023-02-02 https://scifaro.com/en/abs/string-compression-in-fa-presentable-structures-2302.010092023-02-03 https://scifaro.com/en/abs/parameterized-verification-under-tso-with-data-types-2302.021632023-02-14 https://scifaro.com/en/abs/timed-partial-order-inference-algorithm-2302.025012023-02-07 https://scifaro.com/en/abs/weighted-tree-automata-with-constraints-2302.034342023-02-08 https://scifaro.com/en/abs/b-uchi-like-characterizations-for-parikh-recognizable-omega-languages-2302.040872023-02-09 https://scifaro.com/en/abs/symbolic-quantum-simulation-with-quasimodo-2302.043492023-05-31 https://scifaro.com/en/abs/timed-i-o-automata-it-is-never-too-late-to-complete-your-timed-specification-theory-2302.045292023-07-14 https://scifaro.com/en/abs/prefixes-of-the-fibonacci-word-2302.046402023-02-13 https://scifaro.com/en/abs/commuting-upper-triangular-binary-morphisms-2302.061582026-04-08 https://scifaro.com/en/abs/decision-problems-on-copying-and-shuffling-2302.062482026-04-08 https://scifaro.com/en/abs/recognizability-in-s-adic-shifts-2302.062582023-12-14 https://scifaro.com/en/abs/closure-properties-of-general-grammars-formally-verified-2302.064202025-01-03 https://scifaro.com/en/abs/languages-given-by-finite-automata-over-the-unary-alphabet-2302.064352024-12-16 https://scifaro.com/en/abs/a-myhill-nerode-theorem-for-generalized-automata-with-applications-to-pattern-matching-and-compression-2302.065062026-04-23 https://scifaro.com/en/abs/deterministic-regular-functions-of-infinite-words-2302.066722023-02-15 https://scifaro.com/en/abs/supervisory-control-of-modular-discrete-event-systems-under-partial-observation-normality-2302.106662023-02-22 https://scifaro.com/en/abs/the-word-problem-for-finitary-automaton-groups-2302.106702024-03-13 https://scifaro.com/en/abs/constructing-deterministic-parity-automata-from-positive-and-negative-examples-2302.110432024-08-07 https://scifaro.com/en/abs/asynchronous-multiparty-session-type-implementability-is-decidable-lessons-learned-from-message-sequence-charts-2302.112722023-07-20 https://scifaro.com/en/abs/an-educational-tool-for-exploring-the-pumping-lemma-property-for-regular-languages-2302.129412023-02-28 https://scifaro.com/en/abs/the-mathsf-ac-0-complexity-of-visibly-pushdown-languages-2302.131162026-05-12 https://scifaro.com/en/abs/revisiting-variable-ordering-for-real-quantifier-elimination-using-machine-learning-2302.140382023-02-28 https://scifaro.com/en/abs/a-p-systems-variant-for-reasoning-about-sequential-controllability-of-boolean-networks-2303.001102023-03-02 https://scifaro.com/en/abs/isometric-words-based-on-swap-and-mismatch-distance-2303.030862023-03-07 https://scifaro.com/en/abs/black-box-testing-liveness-properties-of-partially-observable-stochastic-systems-2303.032922024-06-05 https://scifaro.com/en/abs/on-the-reconstructability-and-rediscoverability-of-typed-jackson-nets-extended-version-2303.100392023-03-20 https://scifaro.com/en/abs/bideterministic-weighted-automata-2303.106312023-10-02 https://scifaro.com/en/abs/sturmian-and-infinitely-desubstitutable-words-accepted-by-an-omega-automaton-2303.111332023-04-12 https://scifaro.com/en/abs/infinite-words-and-morphic-languages-formalized-in-isabelle-hol-2303.114452023-03-22 https://scifaro.com/en/abs/a-coalgebraic-approach-to-reducing-finitary-automata-2303.149162023-04-14 https://scifaro.com/en/abs/transduction-of-automatic-sequences-and-applications-2303.152032023-04-12 https://scifaro.com/en/abs/vdm-recursive-functions-in-isabelle-hol-2303.174572023-03-31 https://scifaro.com/en/abs/jumping-automata-over-infinite-words-2304.012782023-04-05 https://scifaro.com/en/abs/history-deterministic-timed-automata-2304.031832024-10-16 https://scifaro.com/en/abs/magic-numbers-in-periodic-sequences-2304.032682023-09-06 https://scifaro.com/en/abs/nl-is-strictly-contained-in-p-2304.048402024-04-25 https://scifaro.com/en/abs/reasoning-about-regular-properties-a-comparative-study-2304.050642023-04-12 https://scifaro.com/en/abs/exact-and-approximated-log-alignments-for-processes-with-inter-case-dependencies-2304.052102023-04-12 https://scifaro.com/en/abs/the-big-o-problem-for-max-plus-automata-is-decidable-pspace-complete-2304.052292025-07-16 https://scifaro.com/en/abs/robustness-measures-and-monitors-for-time-window-temporal-logic-2304.066452023-04-14 https://scifaro.com/en/abs/completeness-theorems-for-kleene-algebra-with-tests-and-top-2304.071902024-10-09 https://scifaro.com/en/abs/quantitative-estimates-for-the-size-of-an-intersection-of-sparse-automatic-sets-2304.092232023-04-20 https://scifaro.com/en/abs/speed-me-up-if-you-can-conditional-lower-bounds-on-opacity-verification-2304.099202023-04-21 https://scifaro.com/en/abs/on-certificates-expected-runtimes-and-termination-in-probabilistic-pushdown-automata-2304.099972023-04-25 https://scifaro.com/en/abs/on-the-computational-power-of-particle-methods-2304.102862025-07-23 https://scifaro.com/en/abs/revisiting-membership-problems-in-subclasses-of-rational-relations-2304.110342023-04-27 https://scifaro.com/en/abs/probabilistic-planning-with-prioritized-preferences-over-temporal-logic-objectives-2304.116412023-04-25 https://scifaro.com/en/abs/on-arch-factorization-and-subword-universality-for-words-and-compressed-words-2304.119322023-04-25 https://scifaro.com/en/abs/positive-data-languages-2304.129472023-07-24 https://scifaro.com/en/abs/a-strongly-universal-cellular-automaton-on-the-heptagrif-with-six-states-2304.135752023-05-05 https://scifaro.com/en/abs/multiplicity-problems-on-algebraic-series-and-context-free-grammars-2304.141452023-05-01 https://scifaro.com/en/abs/maximizing-reachability-probabilities-in-rectangular-automata-with-random-clocks-2304.149962023-05-05 https://scifaro.com/en/abs/adding-reconfiguration-to-zielonka-s-asynchronous-automata-2305.014252026-05-13 https://scifaro.com/en/abs/coverability-in-vass-revisited-improving-rackoff-s-bound-to-obtain-conditional-optimality-2305.015812023-05-03 https://scifaro.com/en/abs/history-deterministic-vector-addition-systems-2305.019812023-07-11 https://scifaro.com/en/abs/separability-and-non-determinizability-of-wsts-2305.027362024-06-03 https://scifaro.com/en/abs/symbolic-solution-of-emerson-lei-games-for-reactive-synthesis-2305.027932023-10-26 https://scifaro.com/en/abs/hypernode-automata-2305.028362024-01-09 https://scifaro.com/en/abs/closure-and-decision-properties-for-higher-dimensional-automata-2305.028732024-07-19 https://scifaro.com/en/abs/regular-methods-for-operator-precedence-languages-2305.034472023-11-01 https://scifaro.com/en/abs/weighted-hom-problem-for-nonnegative-integers-2305.041172023-05-09 https://scifaro.com/en/abs/from-muller-to-parity-and-rabin-automata-optimal-transformations-preserving-history-determinism-2305.043232024-08-07 https://scifaro.com/en/abs/getting-more-out-of-large-language-models-for-proofs-2305.043692023-06-02 https://scifaro.com/en/abs/finitely-presentable-higher-dimensional-automata-and-the-irrationality-of-process-replication-2305.064282025-05-20 https://scifaro.com/en/abs/automata-with-timers-2305.074512024-03-04 https://scifaro.com/en/abs/model-checking-strategies-from-synthesis-over-finite-traces-2305.083192023-08-01 https://scifaro.com/en/abs/separating-automatic-relations-2305.087272023-08-03 https://scifaro.com/en/abs/transformational-supervisor-localization-2305.093842023-05-17 https://scifaro.com/en/abs/singly-exponential-translation-of-alternating-weak-b-uchi-automata-to-unambiguous-b-uchi-automata-2305.099662023-05-18 https://scifaro.com/en/abs/weighted-context-free-language-ordered-binary-decision-diagrams-2305.136102024-08-30 https://scifaro.com/en/abs/on-semantically-deterministic-automata-2305.154892023-05-26 https://scifaro.com/en/abs/complete-multiparty-session-type-projection-with-automata-2305.170792024-03-28 https://scifaro.com/en/abs/live-programming-for-finite-model-finders-2305.173172023-05-30 https://scifaro.com/en/abs/active-learning-of-deterministic-timed-automata-with-myhill-nerode-style-characterization-2305.177422023-05-30 https://scifaro.com/en/abs/a-unified-model-for-real-time-systems-symbolic-techniques-and-implementation-2305.178242024-03-19 https://scifaro.com/en/abs/about-decisiveness-of-dynamic-probabilistic-models-2305.195642023-06-01 https://scifaro.com/en/abs/optimal-approximate-minimization-of-one-letter-weighted-finite-automata-2306.001352025-02-12 https://scifaro.com/en/abs/checking-in-polynomial-time-whether-or-not-a-regular-tree-language-is-deterministic-top-down-2306.005732023-06-02 https://scifaro.com/en/abs/a-fast-algorithm-for-computing-prefix-probabilities-2306.023032025-05-09 https://scifaro.com/en/abs/duality-of-lattices-associated-to-left-and-right-quotients-2306.024912023-09-07 https://scifaro.com/en/abs/a-term-based-approach-for-generating-finite-automata-from-interaction-diagrams-2306.029832023-08-04 https://scifaro.com/en/abs/kunz-languages-for-numerical-semigroups-are-context-sensitive-2306.033082026-03-18 https://scifaro.com/en/abs/deciding-minimal-distinguishing-dfas-is-np-complete-2306.035332023-06-07 https://scifaro.com/en/abs/convergence-and-diversity-in-the-control-hierarchy-2306.036282023-06-07 https://scifaro.com/en/abs/deciding-whether-an-attributed-translation-can-be-realized-by-a-top-down-transducer-2306.043262024-04-16 https://scifaro.com/en/abs/optimal-wheeler-language-recognition-2306.047372023-12-19 https://scifaro.com/en/abs/reachability-in-3-vass-is-in-tower-2306.057102023-08-22 https://scifaro.com/en/abs/surjective-span-6-cellular-automata-2306.065622023-06-13 https://scifaro.com/en/abs/invariants-and-home-spaces-in-transition-systems-and-petri-nets-2306.076232024-10-23 https://scifaro.com/en/abs/analyzing-robustness-of-angluin-s-l-algorithm-in-presence-of-noise-2306.082662024-08-07 https://scifaro.com/en/abs/checking-refinement-of-asynchronous-programs-against-context-free-specifications-2306.130582023-06-23 https://scifaro.com/en/abs/synchronization-of-primitive-automata-2306.133172023-07-24 https://scifaro.com/en/abs/learning-broadcast-protocols-2306.142842023-12-13 https://scifaro.com/en/abs/determining-smallest-path-size-of-multiplication-transducers-without-a-restricted-digit-set-2306.149042023-06-28 https://scifaro.com/en/abs/string-diagrammatic-trace-theory-2306.163412023-06-29 https://scifaro.com/en/abs/towards-a-self-replicating-turing-machine-2306.168722023-06-30 https://scifaro.com/en/abs/checking-presence-reachability-properties-on-parameterized-shared-memory-systems-2306.174762023-08-01 https://scifaro.com/en/abs/primitive-automata-that-are-synchronizing-2307.013022023-07-06 https://scifaro.com/en/abs/depth-bounded-fuzzy-simulations-and-bisimulations-between-fuzzy-automata-2307.033182023-07-10 https://scifaro.com/en/abs/complexity-of-membership-and-non-emptiness-problems-in-unbounded-memory-automata-2307.035612023-07-10 https://scifaro.com/en/abs/opacity-of-parametric-discrete-event-systems-models-decidability-and-algorithms-2307.038702023-07-11 https://scifaro.com/en/abs/chain-free-string-constraints-technical-report-2307.039702023-07-11 https://scifaro.com/en/abs/optimizing-an-lts-simulation-algorithm-technical-report-2307.042352023-07-11 https://scifaro.com/en/abs/asymptotic-complexity-estimates-for-probabilistic-programs-and-their-vass-abstractions-2307.047072023-07-13 https://scifaro.com/en/abs/safety-and-liveness-of-quantitative-properties-and-automata-2307.060162025-04-16 https://scifaro.com/en/abs/a-local-time-semantics-for-negotiations-2307.066912023-07-14 https://scifaro.com/en/abs/deciding-conjugacy-of-a-rational-relation-2307.067772024-02-16 https://scifaro.com/en/abs/decomposing-finite-languages-2307.068022023-07-14 https://scifaro.com/en/abs/parikh-automata-on-finite-and-infinite-words-2307.072382025-11-12 https://scifaro.com/en/abs/contextual-behavioural-metrics-extended-version-2307.074002023-09-06 https://scifaro.com/en/abs/priority-downward-closures-2307.074602023-08-02 https://scifaro.com/en/abs/a-novel-family-of-finite-automata-for-recognizing-and-learning-omega-regular-languages-2307.074902023-07-17 https://scifaro.com/en/abs/comparing-two-approaches-to-include-stochasticity-in-hybrid-automata-2307.080522023-08-09 https://scifaro.com/en/abs/on-the-expressive-power-of-regular-expressions-with-backreferences-2307.085312025-07-23 https://scifaro.com/en/abs/a-generic-characterization-of-generalized-unary-temporal-logic-and-two-variable-first-order-logic-2307.093492023-11-30 https://scifaro.com/en/abs/closing-star-free-closure-2307.093762023-07-19 https://scifaro.com/en/abs/learning-formal-specifications-from-membership-and-preference-queries-2307.104342025-05-26 https://scifaro.com/en/abs/two-way-automata-and-transducers-with-planar-behaviours-are-aperiodic-2307.110572023-07-21 https://scifaro.com/en/abs/on-the-succinctness-of-good-for-mdps-automata-2307.114832023-07-24 https://scifaro.com/en/abs/enpac-petri-net-model-checking-for-linear-temporal-logic-2307.123242023-07-25 https://scifaro.com/en/abs/minimizing-cost-register-automata-over-a-field-2307.135052024-07-02 https://scifaro.com/en/abs/synthesis-of-procedural-models-for-deterministic-transition-systems-2307.143682023-07-28 https://scifaro.com/en/abs/dimension-minimality-and-primality-of-counter-nets-2307.144922023-12-27 https://scifaro.com/en/abs/automata-in-toposes-and-general-myhill-nerode-theorems-2307.148552023-07-28 https://scifaro.com/en/abs/explicit-hopcroft-s-trick-in-categorical-partition-refinement-2307.152612024-05-03 https://scifaro.com/en/abs/coordination-sequences-of-periodic-structures-are-rational-via-automata-theory-2307.158032023-08-01 https://scifaro.com/en/abs/deciding-linear-height-and-linear-size-to-height-increase-for-macro-tree-transducers-2307.165002024-02-23 https://scifaro.com/en/abs/two-dimensional-dyck-words-2307.165222023-09-22 https://scifaro.com/en/abs/forgetting-1-limited-automata-2307.167002023-09-19 https://scifaro.com/en/abs/the-expansion-problem-for-infinite-trees-2308.011742026-03-11 https://scifaro.com/en/abs/an-easily-checkable-algebraic-characterization-of-positive-expansivity-for-additive-cellular-automata-over-a-finite-abelian-group-2308.030642023-08-09 https://scifaro.com/en/abs/synchronized-ctl-over-one-counter-automata-2308.033082023-12-22 https://scifaro.com/en/abs/canonical-algebraic-generators-in-automata-learning-2308.042222023-08-09 https://scifaro.com/en/abs/on-some-closure-properties-of-nc-ence-graph-grammars-2308.059432023-08-16 https://scifaro.com/en/abs/sweep-complexity-revisited-2308.066832023-08-15 https://scifaro.com/en/abs/matching-patterns-with-variables-under-simon-s-congruence-2308.083742023-08-17 https://scifaro.com/en/abs/introducing-divergence-for-infinite-probabilistic-models-2308.088422026-03-03 https://scifaro.com/en/abs/the-fine-grained-complexity-of-cfl-reachability-2308.092842023-08-21 https://scifaro.com/en/abs/structure-and-computability-of-preimages-in-the-game-of-life-2308.101982025-04-15 https://scifaro.com/en/abs/real-time-regular-expression-matching-2308.102082023-08-22 https://scifaro.com/en/abs/formal-analysis-and-verification-of-max-plus-linear-systems-2308.105872023-08-22 https://scifaro.com/en/abs/research-challenges-in-orchestration-synthesis-2308.106512023-08-24 https://scifaro.com/en/abs/transcendence-of-sturmian-numbers-over-an-algebraic-base-2308.136572023-08-29 https://scifaro.com/en/abs/an-analysis-of-on-the-fly-determinization-of-finite-state-automata-2308.140772023-08-29 https://scifaro.com/en/abs/conditional-automatic-complexity-and-its-metrics-2308.162922023-09-01 https://scifaro.com/en/abs/on-decidability-and-expressive-power-of-fusion-grammars-2309.009542025-03-25 https://scifaro.com/en/abs/proceedings-of-the-16th-international-conference-on-automata-and-formal-languages-2309.011262023-09-06 https://scifaro.com/en/abs/a-usage-aware-sequent-calculus-for-differential-dynamic-logic-2309.011802024-10-08 https://scifaro.com/en/abs/reversible-two-party-computations-2309.027472023-09-07 https://scifaro.com/en/abs/operations-on-boolean-and-alternating-finite-automata-2309.027482023-09-07 https://scifaro.com/en/abs/on-the-degree-of-extension-of-some-models-defining-non-regular-languages-2309.027492023-09-07 https://scifaro.com/en/abs/approximate-state-reduction-of-fuzzy-finite-automata-2309.027502023-09-07 https://scifaro.com/en/abs/weighted-automata-over-vector-spaces-2309.027512023-09-07 https://scifaro.com/en/abs/freezing-1-tag-systems-with-states-2309.027532023-09-07 https://scifaro.com/en/abs/when-stars-control-a-grammar-s-work-2309.027552023-09-07 https://scifaro.com/en/abs/comparative-transition-system-semantics-for-cause-respecting-reversible-prime-event-structures-2309.027562023-09-07 https://scifaro.com/en/abs/on-minimal-pumping-constants-for-regular-languages-2309.027572023-09-07 https://scifaro.com/en/abs/pumping-lemmata-for-recognizable-weighted-languages-over-artinian-semirings-2309.027582023-09-07 https://scifaro.com/en/abs/state-deterministic-finite-automata-with-translucent-letters-and-finite-automata-with-nondeterministically-translucent-letters-2309.027592023-09-07 https://scifaro.com/en/abs/solving-the-weighted-hom-problem-with-the-help-of-unambiguity-2309.027612023-09-07 https://scifaro.com/en/abs/once-marking-and-always-marking-1-limited-automata-2309.027632023-09-07 https://scifaro.com/en/abs/a-general-approach-to-proving-properties-of-fibonacci-representations-via-automata-theory-2309.027652023-09-07 https://scifaro.com/en/abs/separating-words-from-every-start-state-with-horner-automata-2309.027662023-09-07 https://scifaro.com/en/abs/cyclic-operator-precedence-grammars-for-parallel-parsing-2309.042002023-09-11 https://scifaro.com/en/abs/data-flow-based-normalization-generation-algorithm-of-r1cs-for-zero-knowledge-proof-2309.042742024-03-26 https://scifaro.com/en/abs/petri-net-classes-for-collaboration-mining-assessment-and-design-guidelines-2309.062002023-09-13 https://scifaro.com/en/abs/symbolic-path-guided-test-cases-for-models-with-data-and-time-2309.068402023-09-14 https://scifaro.com/en/abs/proceedings-of-the-13th-international-workshop-on-non-classical-models-of-automata-and-applications-2309.073332023-09-15 https://scifaro.com/en/abs/feasability-of-learning-weighted-automata-on-a-semiring-2309.078062025-08-13 https://scifaro.com/en/abs/reset-thresholds-of-transformation-monoids-2309.083212025-09-16 https://scifaro.com/en/abs/generating-semantic-graph-corpora-with-graph-expansion-grammar-2309.087142023-09-19 https://scifaro.com/en/abs/formalizing-bpe-tokenization-2309.087152023-09-19 https://scifaro.com/en/abs/deterministic-real-time-tree-walking-storage-automata-2309.087162023-09-19 https://scifaro.com/en/abs/ordered-context-free-grammars-revisited-2309.087172023-09-19 https://scifaro.com/en/abs/on-languages-generated-by-signed-grammars-2309.087182023-09-19 https://scifaro.com/en/abs/final-sentential-forms-2309.087192023-09-19 https://scifaro.com/en/abs/latvian-quantum-finite-state-automata-for-unary-languages-2309.087202023-09-19 https://scifaro.com/en/abs/constituency-parsing-as-an-instance-of-the-m-monoid-parsing-problem-2309.087222023-09-19 https://scifaro.com/en/abs/sweeping-permutation-automata-2309.087232023-09-19 https://scifaro.com/en/abs/shuffling-posets-on-trajectories-technical-report-2309.091892023-11-14 https://scifaro.com/en/abs/synchronous-orders-on-the-set-of-integers-2309.095662023-10-06 https://scifaro.com/en/abs/characterizing-morphic-sequences-2309.105622023-09-20 https://scifaro.com/en/abs/robert-s-theorem-and-graphs-on-complete-lattices-2309.113632023-09-21 https://scifaro.com/en/abs/derivative-based-extended-regular-expression-matching-supporting-intersection-complement-and-lookarounds-2309.144012023-09-27 https://scifaro.com/en/abs/proceedings-of-the-fourteenth-international-symposium-on-games-automata-logics-and-formal-verification-2309.173182023-10-02 https://scifaro.com/en/abs/conflict-aware-active-automata-learning-2310.010032023-10-03 https://scifaro.com/en/abs/bandwidth-of-timed-automata-3-classes-2310.019412023-10-04 https://scifaro.com/en/abs/acyclic-petri-and-workflow-nets-with-resets-2310.019922023-11-07 https://scifaro.com/en/abs/determinisation-and-unambiguisation-of-polynomially-ambiguous-rational-weighted-automata-2310.022042025-05-28 https://scifaro.com/en/abs/symbolic-automata-omega-regularity-modulo-theories-2310.023932023-10-05 https://scifaro.com/en/abs/logical-languages-accepted-by-transformer-encoders-with-hard-attention-2310.038172023-10-09 https://scifaro.com/en/abs/characterizations-of-monadic-second-order-definable-context-free-sets-of-graphs-2310.047642026-03-11 https://scifaro.com/en/abs/lemur-integrating-large-language-models-in-automated-program-verification-2310.048702024-04-26 https://scifaro.com/en/abs/the-lexicographically-least-binary-rich-word-achieving-the-repetition-threshold-2310.070102023-10-12 https://scifaro.com/en/abs/visualizing-a-nondeterministic-to-deterministic-finite-state-machine-transformation-2310.082482023-10-24 https://scifaro.com/en/abs/non-reducible-modal-transition-systems-2310.084122024-03-08 https://scifaro.com/en/abs/new-lower-bounds-for-reachability-in-vector-addition-systems-2310.090082023-11-14 https://scifaro.com/en/abs/determinization-of-integral-discounted-sum-automata-is-decidable-2310.091152023-10-16 https://scifaro.com/en/abs/mata-a-fast-and-simple-finite-automata-library-technical-report-2310.101362024-03-29 https://scifaro.com/en/abs/contracting-tsetlin-machine-with-absorbing-automata-2310.114812023-10-19 https://scifaro.com/en/abs/reduced-complexity-verification-for-k-step-and-infinite-step-opacity-in-discrete-event-systems-2310.118252023-10-19 https://scifaro.com/en/abs/enumerating-regular-languages-in-radix-order-revisiting-the-ackerman-shallit-algorithm-2310.133092023-10-23 https://scifaro.com/en/abs/checking-history-determinism-is-np-hard-for-parity-automata-2310.134982026-05-28 https://scifaro.com/en/abs/masked-hard-attention-transformers-recognize-exactly-the-star-free-languages-2310.138972024-10-31 https://scifaro.com/en/abs/note-on-dissecting-power-of-regular-languages-2310.141142025-09-16 https://scifaro.com/en/abs/a-robust-measure-on-fdfas-following-duo-normalized-acceptance-2310.160222024-02-23 https://scifaro.com/en/abs/reachability-in-fixed-vass-expressiveness-and-lower-bounds-2310.167402023-10-26 https://scifaro.com/en/abs/reachability-in-continuous-pushdown-vass-2310.167982023-11-01 https://scifaro.com/en/abs/normal-forms-for-elements-of-continuous-kleene-algebras-representing-the-context-free-languages-2310.172952026-03-11 https://scifaro.com/en/abs/simple-and-tight-complexity-lower-bounds-for-solving-rabin-games-2310.204332023-11-01 https://scifaro.com/en/abs/don-s-conjecture-for-binary-completely-reachable-automata-an-approach-and-its-limitations-2311.000772024-03-20 https://scifaro.com/en/abs/expressive-power-of-hypergraph-lambek-grammars-2311.024162023-11-30 https://scifaro.com/en/abs/leveraging-large-language-models-for-automated-proof-synthesis-in-rust-2311.037392023-11-27 https://scifaro.com/en/abs/parikh-s-theorem-made-symbolic-2311.039012024-08-01 https://scifaro.com/en/abs/the-complexity-of-checking-non-emptiness-in-symbolic-tree-automata-2311.052502023-11-10 https://scifaro.com/en/abs/set-augmented-finite-automata-over-infinite-alphabets-2311.065142023-11-14 https://scifaro.com/en/abs/co-buchi-barrier-certificates-for-discrete-time-dynamical-systems-2311.076952026-01-22 https://scifaro.com/en/abs/3vltl-a-tool-to-generate-automata-for-three-valued-ltl-2311.097872023-11-17 https://scifaro.com/en/abs/unambiguity-and-fewness-for-nonuniform-families-of-polynomial-size-nondeterministic-finite-automata-2311.099792023-11-17 https://scifaro.com/en/abs/k-universality-of-regular-languages-2311.106582023-11-20 https://scifaro.com/en/abs/learning-deterministic-finite-automata-from-confidence-oracles-2311.109632023-11-21 https://scifaro.com/en/abs/the-weighted-hom-problem-over-fields-2311.110672023-11-21 https://scifaro.com/en/abs/simulation-limitations-of-affine-cellular-automata-2311.144772024-05-14 https://scifaro.com/en/abs/repetition-factorization-of-automatic-sequences-2311.149612023-11-30 https://scifaro.com/en/abs/careful-synchronization-of-one-cluster-automata-2311.150202023-11-28 https://scifaro.com/en/abs/on-universality-of-regular-realizability-problems-2311.153812024-10-11 https://scifaro.com/en/abs/on-the-piecewise-complexity-of-words-and-periodic-words-2311.154312023-11-28 https://scifaro.com/en/abs/random-generation-of-group-elements-using-combinatorial-group-theory-and-automata-theory-along-with-a-hardware-example-2311.163472023-11-29 https://scifaro.com/en/abs/traversing-automata-with-current-state-uncertainty-under-ltl-f-constraints-2311.178492023-11-30 https://scifaro.com/en/abs/semantics-of-attack-defense-trees-for-dynamic-countermeasures-and-a-new-hierarchy-of-star-free-languages-2312.004582023-12-04 https://scifaro.com/en/abs/a-linear-time-simulation-of-deterministic-d-limited-automata-2312.018962025-09-01 https://scifaro.com/en/abs/on-the-rank-of-the-communication-matrix-for-deterministic-two-way-finite-automata-2312.059092023-12-12 https://scifaro.com/en/abs/finer-characterization-of-bounded-languages-described-by-gf-2-grammars-2312.066092023-12-12 https://scifaro.com/en/abs/restivo-salemi-property-for-alpha-power-free-languages-with-alpha-geq-5-and-k-geq-3-letters-2312.100612025-04-29 https://scifaro.com/en/abs/weighted-automata-and-logics-meet-computational-complexity-2312.108102024-08-20 https://scifaro.com/en/abs/3-anti-power-uniform-morphisms-2312.145142023-12-25 https://scifaro.com/en/abs/classifying-words-with-3-sort-automata-2401.013142024-01-03 https://scifaro.com/en/abs/the-complexity-of-simplifying-omega-automata-through-the-alternating-cycle-decomposition-2401.038112024-07-01 https://scifaro.com/en/abs/on-the-boolean-closure-of-deterministic-top-down-tree-automata-2401.065962024-01-15 https://scifaro.com/en/abs/directed-regular-and-context-free-languages-2401.071062024-01-22 https://scifaro.com/en/abs/anti-context-free-languages-2401.078152024-01-17 https://scifaro.com/en/abs/satisfiability-of-context-free-string-constraints-with-subword-ordering-and-transducers-2401.079962024-01-17 https://scifaro.com/en/abs/extended-stone-duality-via-monoidal-adjunctions-2401.082192025-10-15 https://scifaro.com/en/abs/verification-and-enforcement-of-strong-state-based-opacity-for-discrete-event-systems-2401.103632024-01-22 https://scifaro.com/en/abs/verification-under-tso-with-an-infinite-data-domain-2401.104232024-01-22 https://scifaro.com/en/abs/on-the-fly-algorithm-for-reachability-in-parametric-timed-games-extended-version-2401.112872024-01-23 https://scifaro.com/en/abs/constrained-multi-tildes-derived-term-and-position-automata-2401.121112024-01-23 https://scifaro.com/en/abs/strongly-k-recursive-sequences-2401.142312024-01-26 https://scifaro.com/en/abs/on-some-complexity-results-for-even-linear-languages-2401.143032024-01-26 https://scifaro.com/en/abs/scalable-tree-based-register-automata-learning-2401.143242024-01-26 https://scifaro.com/en/abs/bonding-grammars-2401.143772024-08-07 https://scifaro.com/en/abs/deterministic-parikh-automata-on-infinite-words-2401.147372024-05-27 https://scifaro.com/en/abs/positional-omega-regular-languages-2401.153842026-03-11 https://scifaro.com/en/abs/on-the-separability-problem-of-vass-reachability-languages-2401.160952025-08-12 https://scifaro.com/en/abs/dot-depth-three-return-of-the-j-class-2401.161952024-01-30 https://scifaro.com/en/abs/collaboration-miner-discovering-collaboration-petri-nets-extended-version-2401.162632024-10-11 https://scifaro.com/en/abs/deciding-subtyping-for-asynchronous-multiparty-sessions-2401.163952024-01-30 https://scifaro.com/en/abs/higher-dimensional-timed-automata-for-real-time-concurrency-2401.174442025-02-06 https://scifaro.com/en/abs/axiomatizing-nfas-generated-by-regular-grammars-2402.005022024-08-12 https://scifaro.com/en/abs/the-freeness-problem-for-automaton-semigroups-2402.013722025-02-19 https://scifaro.com/en/abs/backward-responsibility-in-transition-systems-using-general-power-indices-2402.015392024-02-05 https://scifaro.com/en/abs/fully-generalized-reactivity-1-synthesis-2402.029792024-02-06 https://scifaro.com/en/abs/distributed-fair-assignment-and-rebalancing-for-mobility-on-demand-systems-via-an-auction-based-method-2402.049722024-02-08 https://scifaro.com/en/abs/q-parikh-matrices-and-q-deformed-binomial-coefficients-of-words-2402.056572024-02-09 https://scifaro.com/en/abs/slightly-non-linear-higher-order-tree-transducers-2402.058542026-03-13 https://scifaro.com/en/abs/random-deterministic-automata-with-one-added-transition-2402.065912025-02-05 https://scifaro.com/en/abs/inform-from-compartmental-models-to-stochastic-bounded-counter-machines-2402.091212024-02-15 https://scifaro.com/en/abs/flattability-of-priority-vector-addition-systems-2402.091852024-05-01 https://scifaro.com/en/abs/navigational-hierarchies-of-regular-languages-2402.100802025-02-03 https://scifaro.com/en/abs/kleene-theorems-for-lasso-languages-and-omega-languages-2402.130852024-03-13 https://scifaro.com/en/abs/probabilistic-automatic-complexity-of-finite-strings-2402.133762024-06-04 https://scifaro.com/en/abs/regular-languages-in-the-sliding-window-model-2402.133852025-03-12 https://scifaro.com/en/abs/on-algorithms-verifying-initial-and-final-state-opacity-complexity-special-cases-and-comparison-2402.170002024-12-25 https://scifaro.com/en/abs/tree-verifiable-graph-grammars-2402.170152024-02-29 https://scifaro.com/en/abs/around-don-s-conjecture-for-binary-completely-reachable-automata-2402.190892024-03-01 https://scifaro.com/en/abs/active-learning-of-mealy-machines-with-timers-2403.020192025-08-20 https://scifaro.com/en/abs/efficient-interaction-based-offline-runtime-verification-of-distributed-systems-with-lifeline-removal-2403.030572024-03-06 https://scifaro.com/en/abs/mso-enumeration-over-slp-compressed-unranked-forests-2403.030672026-03-17 https://scifaro.com/en/abs/characterizations-of-controlled-generation-of-right-linear-grammars-with-unknown-behaviors-2403.043012024-03-08 https://scifaro.com/en/abs/semidirect-product-decompositions-for-periodic-regular-languages-2403.050882024-03-11 https://scifaro.com/en/abs/on-graph-grammars-and-games-2403.076072024-03-13 https://scifaro.com/en/abs/a-short-survey-around-the-pumping-lemma-for-context-free-languages-2403.158992024-03-26 https://scifaro.com/en/abs/presenting-interval-pomsets-with-interfaces-2403.166262024-07-19 https://scifaro.com/en/abs/logic-and-languages-of-higher-dimensional-automata-2403.195262024-03-29 https://scifaro.com/en/abs/transformers-as-transducers-2404.020402024-11-07 https://scifaro.com/en/abs/illustrating-finite-automata-with-grail-and-tikz-2404.030392024-04-05 https://scifaro.com/en/abs/learning-deterministic-multi-clock-timed-automata-2404.078232024-05-21 https://scifaro.com/en/abs/supervisory-control-theory-with-event-forcing-2404.084692024-04-15 https://scifaro.com/en/abs/a-uniform-framework-for-language-inclusion-problems-2404.098622024-04-16 https://scifaro.com/en/abs/flow-based-synthesis-of-reactive-tests-for-discrete-decision-making-systems-with-temporal-logic-specifications-2404.098882024-04-16 https://scifaro.com/en/abs/exact-descriptional-complexity-of-determinization-of-input-driven-pushdown-automata-2404.105162024-04-17 https://scifaro.com/en/abs/context-free-languages-of-string-diagrams-2404.106532024-04-17 https://scifaro.com/en/abs/computing-inductive-invariants-of-regular-abstraction-frameworks-2404.107522024-07-22 https://scifaro.com/en/abs/review-of-automaton-learning-algorithms-with-polynomial-complexity-completely-solved-examples-2404.110962024-04-18 https://scifaro.com/en/abs/on-the-representation-and-state-complexity-of-block-languages-2404.117462025-05-19 https://scifaro.com/en/abs/characterization-of-isometric-words-based-on-swap-and-mismatch-distance-2404.135772024-04-23 https://scifaro.com/en/abs/opacity-complexity-of-automatic-sequences-the-general-case-2404.136012024-04-23 https://scifaro.com/en/abs/finite-automata-for-efficient-graph-recognition-2404.150522025-03-27 https://scifaro.com/en/abs/the-algebras-for-automatic-relations-2404.154962024-11-26 https://scifaro.com/en/abs/on-the-topology-of-concurrent-systems-2404.164922024-04-26 https://scifaro.com/en/abs/edit-distance-of-finite-state-transducers-2404.165182024-04-26 https://scifaro.com/en/abs/development-of-parallel-programs-on-shared-data-structures-revised-version-2404.166242024-04-26 https://scifaro.com/en/abs/regular-expressions-with-backreferences-and-lookaheads-capture-nlog-2404.174922024-04-29 https://scifaro.com/en/abs/lookahead-games-and-efficient-determinisation-of-history-deterministic-b-uchi-automata-2404.175302026-05-28 https://scifaro.com/en/abs/efficient-runtime-verification-of-real-time-systems-under-parametric-communication-delays-2404.182822025-07-30 https://scifaro.com/en/abs/a-cornering-strategy-for-synchronizing-a-dfa-2405.008262025-08-22 https://scifaro.com/en/abs/a-direct-translation-from-ltl-with-past-to-deterministic-rabin-automata-2405.011782024-09-05 https://scifaro.com/en/abs/using-finite-automata-to-compute-the-base-b-representation-of-the-golden-ratio-and-other-quadratic-irrationals-2405.027272024-09-10 https://scifaro.com/en/abs/probabilistic-finite-automaton-emptiness-is-undecidable-2405.030352024-06-07 https://scifaro.com/en/abs/g-odel-number-based-clustering-algorithm-with-decimal-first-degree-cellular-automata-2405.048812024-05-09 https://scifaro.com/en/abs/planning-with-probabilistic-opacity-and-transparency-a-computational-model-of-opaque-transparent-observations-2405.054082024-12-04 https://scifaro.com/en/abs/time-complexity-for-deterministic-string-machines-2405.060432024-05-13 https://scifaro.com/en/abs/scalable-computation-of-inter-core-bounds-through-exact-abstractions-2405.063872025-02-18 https://scifaro.com/en/abs/constructing-a-bpe-tokenization-dfa-2405.076712025-05-27 https://scifaro.com/en/abs/slice-closures-of-indexed-languages-and-word-equations-with-counting-constraints-2405.079112024-05-14 https://scifaro.com/en/abs/dynamic-programming-for-symbolic-boolean-realizability-and-synthesis-2405.079752024-06-21 https://scifaro.com/en/abs/finite-valued-streaming-string-transducers-2405.081712025-05-14 https://scifaro.com/en/abs/techniques-for-showing-the-decidability-of-the-boundedness-problem-of-language-acceptors-2405.089882024-05-20 https://scifaro.com/en/abs/a-formal-approach-for-tuning-stochastic-oscillators-2405.091832024-05-16 https://scifaro.com/en/abs/extended-time-petri-nets-2405.092082024-05-16 https://scifaro.com/en/abs/o-2-is-a-multiple-context-free-grammar-an-implementation-formalisation-friendly-proof-2405.093962024-05-16 https://scifaro.com/en/abs/verifying-unboundedness-via-amalgamation-2405.102962024-09-17 https://scifaro.com/en/abs/propositional-dynamic-logic-and-asynchronous-cascade-decompositions-for-regular-trace-languages-2405.113082024-09-13 https://scifaro.com/en/abs/quantitative-semantics-for-jumping-automata-2405.118492026-01-07 https://scifaro.com/en/abs/nominal-tree-automata-with-name-allocation-2405.142722024-07-12 https://scifaro.com/en/abs/the-power-of-hard-attention-transformers-on-data-sequences-a-formal-language-theoretic-perspective-2405.161662024-11-13 https://scifaro.com/en/abs/lindenmayer-graph-languages-first-order-theories-and-expanders-2405.176292024-05-29 https://scifaro.com/en/abs/dfaminer-mining-minimal-separating-dfas-from-labelled-samples-2405.188712024-05-30 https://scifaro.com/en/abs/the-cfg-complexity-of-singleton-sets-2405.200262024-06-04 https://scifaro.com/en/abs/the-generating-power-of-weighted-tree-automata-with-initial-algebra-semantics-2405.207532024-06-11 https://scifaro.com/en/abs/linear-equations-and-recursively-enumerable-sets-2406.006882024-06-04 https://scifaro.com/en/abs/separability-in-b-uchi-vass-and-singly-non-linear-systems-of-inequalities-2406.010082024-06-04 https://scifaro.com/en/abs/indexing-finite-state-automata-using-forward-stable-partitions-2406.027632024-06-06 https://scifaro.com/en/abs/attributed-tree-transducers-for-partial-functions-2406.061412024-06-12 https://scifaro.com/en/abs/learning-efsm-models-with-registers-in-guards-2406.070402024-06-12 https://scifaro.com/en/abs/database-assisted-automata-learning-2406.072082024-06-12 https://scifaro.com/en/abs/omega-regular-expression-synthesis-from-transition-based-b-uchi-automata-2406.081362024-06-13 https://scifaro.com/en/abs/analyzing-constrained-llm-through-pdfa-learning-2406.082692024-06-18 https://scifaro.com/en/abs/linear-recurrence-sequence-automata-and-the-addition-of-abstract-numeration-systems-2406.098682025-05-05 https://scifaro.com/en/abs/a-subclass-of-mu-calculus-with-the-freeze-quantifier-equivalent-to-buchi-register-automata-2406.113512024-06-18 https://scifaro.com/en/abs/reversible-transducers-over-infinite-words-2406.114882024-07-01 https://scifaro.com/en/abs/computing-the-bandwidth-of-meager-timed-automata-2406.126942024-06-24 https://scifaro.com/en/abs/on-the-intersection-problem-for-quantum-finite-automata-2406.137972025-07-16 https://scifaro.com/en/abs/information-flow-interfaces-and-security-lattices-2406.143742024-06-21 https://scifaro.com/en/abs/computational-model-for-parsing-expression-grammars-2406.149112024-09-06 https://scifaro.com/en/abs/global-one-counter-tree-automata-2406.150902024-06-24 https://scifaro.com/en/abs/self-descriptive-sequences-directed-by-two-periodic-sequences-2406.163912024-06-25 https://scifaro.com/en/abs/querying-labeled-time-series-data-with-scenario-programs-2406.176272024-06-26 https://scifaro.com/en/abs/pdfa-distillation-via-string-probability-queries-2406.183282024-07-01 https://scifaro.com/en/abs/unveiling-the-connection-between-the-lyndon-factorization-and-the-canonical-inverse-lyndon-factorization-via-a-border-property-2406.184732024-10-30 https://scifaro.com/en/abs/regular-expressions-with-backreferences-on-multiple-context-free-languages-and-the-closed-star-condition-2406.189182024-06-28 https://scifaro.com/en/abs/the-single-use-restriction-for-register-automata-and-transducers-over-infinite-alphabets-2406.189342024-06-28 https://scifaro.com/en/abs/on-transition-constructions-for-automata-a-categorical-perspective-2406.193122024-06-28 https://scifaro.com/en/abs/minimising-the-probabilistic-bisimilarity-distance-2406.198302024-07-01 https://scifaro.com/en/abs/the-finiteness-problem-for-automaton-semigroups-of-extended-bounded-activity-2406.200562026-05-27 https://scifaro.com/en/abs/some-remarks-on-first-order-definable-tree-languages-2407.011692024-07-02 https://scifaro.com/en/abs/on-shuffling-and-splitting-automata-2407.026602024-07-04 https://scifaro.com/en/abs/monads-comonads-and-transducers-2407.027042024-07-04 https://scifaro.com/en/abs/complex-event-recognition-with-symbolic-register-transducers-extended-technical-report-2407.028842024-07-04 https://scifaro.com/en/abs/theoremllama-transforming-general-purpose-llms-into-lean4-experts-2407.032032024-10-07 https://scifaro.com/en/abs/weighted-basic-parallel-processes-and-combinatorial-enumeration-2407.036382024-07-08 https://scifaro.com/en/abs/simple-grammar-bisimilarity-with-an-application-to-session-type-equivalence-2407.040632026-05-11 https://scifaro.com/en/abs/generalized-parikh-matrices-for-tracking-subsequence-occurrences-2407.044622024-07-08 https://scifaro.com/en/abs/more-on-maximally-permissive-similarity-control-of-discrete-event-systems-2407.080682025-03-11 https://scifaro.com/en/abs/finite-state-automaton-to-from-regular-expression-visualization-2407.080882024-07-12 https://scifaro.com/en/abs/a-quadratic-upper-bound-on-the-reset-thresholds-of-synchronizing-automata-containing-a-transitive-permutation-group-2407.081352024-07-12 https://scifaro.com/en/abs/differential-tree-automata-2407.082182025-01-29 https://scifaro.com/en/abs/mitl-model-checking-via-generalized-timed-automata-and-a-new-liveness-algorithm-2407.084522025-07-08 https://scifaro.com/en/abs/history-determinism-vs-fair-simulation-2407.086202026-05-28 https://scifaro.com/en/abs/the-mu-mathcal-g-language-for-programming-graph-neural-networks-2407.094412024-10-16 https://scifaro.com/en/abs/learning-weighted-finite-automata-over-the-max-plus-semiring-and-its-termination-2407.097752024-07-16 https://scifaro.com/en/abs/a-close-analysis-of-the-subset-construction-2407.098912025-10-20 https://scifaro.com/en/abs/on-state-complexity-for-subword-closed-languages-2407.103552024-07-16 https://scifaro.com/en/abs/quasi-stratified-order-semantics-of-concurrency-2407.134062024-07-19 https://scifaro.com/en/abs/quasi-isometric-reductions-between-infinite-strings-2407.141052025-08-19 https://scifaro.com/en/abs/dual-adjunction-between-omega-automata-and-wilke-algebra-quotients-2407.141152024-11-25 https://scifaro.com/en/abs/on-the-minimisation-of-deterministic-and-history-deterministic-generalised-co-b-uchi-automata-2407.180902026-05-28 https://scifaro.com/en/abs/reachability-for-multi-priced-timed-automata-with-positive-and-negative-rates-2407.181312024-07-26 https://scifaro.com/en/abs/detecting-and-explaining-in-equivalence-of-context-free-grammars-2407.182202026-04-09 https://scifaro.com/en/abs/tight-bounds-for-the-number-of-absent-subsequences-2407.185992025-09-01 https://scifaro.com/en/abs/re-high-performance-derivative-based-regex-matching-with-intersection-complement-and-lookarounds-2407.204792025-01-27 https://scifaro.com/en/abs/hyper-parametric-timed-ctl-2407.213212024-08-01 https://scifaro.com/en/abs/regular-grammars-for-sets-of-graphs-of-tree-width-2-2408.012262025-06-17 https://scifaro.com/en/abs/a-tree-sampler-for-bounded-context-free-languages-2408.018492024-08-13 https://scifaro.com/en/abs/hierarchical-clustering-using-reversible-binary-cellular-automata-for-high-dimensional-data-2408.022502024-08-06 https://scifaro.com/en/abs/llms-as-probabilistic-minimally-adequate-teachers-for-dfa-learning-2408.029992024-08-07 https://scifaro.com/en/abs/recomposition-a-new-technique-for-efficient-compositional-verification-2408.034882024-08-19 https://scifaro.com/en/abs/alternating-nominal-automata-with-name-allocation-2408.036582025-05-20 https://scifaro.com/en/abs/parameterized-verification-of-timed-networks-with-clock-invariants-2408.051902025-10-13 https://scifaro.com/en/abs/parameterized-verification-of-systems-with-precise-0-1-counter-abstraction-2408.059542026-03-24 https://scifaro.com/en/abs/draft-high-order-estimation-based-properties-and-high-order-observers-for-labeled-finite-state-automata-2408.061412026-01-01 https://scifaro.com/en/abs/exploring-complexity-an-extended-study-of-formal-properties-for-process-model-complexity-measures-2408.098712024-08-23 https://scifaro.com/en/abs/distribution-of-reconfiguration-languages-maintaining-tree-like-communication-topology-2408.107082024-08-21 https://scifaro.com/en/abs/runtime-verification-via-rational-monitor-with-imperfect-information-2408.116272024-08-22 https://scifaro.com/en/abs/invariants-for-one-counter-automata-with-disequality-tests-2408.119082024-08-23 https://scifaro.com/en/abs/greybox-learning-of-languages-recognizable-by-event-recording-automata-2408.125512024-08-23 https://scifaro.com/en/abs/exponent-strings-and-their-edit-distance-2408.129312024-08-26 https://scifaro.com/en/abs/imposing-rules-in-process-discovery-an-inductive-mining-approach-2408.173262024-09-02 https://scifaro.com/en/abs/configuration-monitor-synthesis-2408.173682024-09-02 https://scifaro.com/en/abs/attractor-basins-in-concurrent-systems-2409.010792024-09-04 https://scifaro.com/en/abs/completing-the-picture-for-the-skolem-problem-on-order-4-linear-recurrence-sequences-2409.012212025-12-10 https://scifaro.com/en/abs/two-or-three-things-i-know-about-tree-transducers-2409.031692024-09-12 https://scifaro.com/en/abs/quak-quantitative-automata-kit-2409.035692025-06-30 https://scifaro.com/en/abs/presheaf-automata-2409.046122025-08-18 https://scifaro.com/en/abs/exploiting-assumptions-for-effective-monitoring-of-real-time-properties-under-partial-observability-2409.054562025-07-30 https://scifaro.com/en/abs/state-estimation-of-timed-automata-under-partial-observation-draft-version-2409.058102024-09-10 https://scifaro.com/en/abs/proceedings-14th-international-workshop-on-non-classical-models-of-automata-and-applications-ncma-2024-2409.061202024-09-11 https://scifaro.com/en/abs/a-glr-like-parsing-algorithm-for-three-valued-interpretations-of-boolean-grammars-with-strong-negation-2409.069662024-09-12 https://scifaro.com/en/abs/complexity-of-unary-exclusive-nondeterministic-finite-automata-2409.069672024-09-12 https://scifaro.com/en/abs/a-new-notion-of-regularity-finite-state-automata-accepting-graphs-2409.069682024-09-12 https://scifaro.com/en/abs/determinism-in-multi-soliton-automata-2409.069692024-09-12 https://scifaro.com/en/abs/operational-state-complexity-of-block-languages-2409.069702024-09-12 https://scifaro.com/en/abs/winning-strategies-for-the-synchronization-game-on-subclasses-of-finite-automata-2409.069712024-09-12 https://scifaro.com/en/abs/how-to-demonstrate-metalinearness-and-regularity-by-tree-restricted-general-grammars-2409.069722024-09-12 https://scifaro.com/en/abs/non-global-parikh-tree-automata-2409.069732024-09-12 https://scifaro.com/en/abs/various-types-of-comet-languages-and-their-application-in-external-contextual-grammars-2409.069742024-09-12 https://scifaro.com/en/abs/repetitive-finite-automata-with-translucent-letters-2409.069752024-09-12 https://scifaro.com/en/abs/5-3-watson-crick-automata-accepting-necklaces-2409.069762024-09-12 https://scifaro.com/en/abs/complexity-aspects-of-the-extension-of-wagner-s-hierarchy-to-k-partitions-2409.069772024-09-12 https://scifaro.com/en/abs/large-language-models-and-the-extended-church-turing-thesis-2409.069782024-09-12 https://scifaro.com/en/abs/mathbb-n-polyregular-functions-arise-from-well-quasi-orderings-2409.078822024-09-13 https://scifaro.com/en/abs/subshifts-defined-by-nondeterministic-and-alternating-plane-walking-automata-2409.080242025-02-18 https://scifaro.com/en/abs/run-supports-and-initial-algebra-supports-of-weighted-automata-2409.087272024-09-16 https://scifaro.com/en/abs/well-behaved-co-algebraic-semantics-of-regular-expressions-in-dafny-2409.098892024-09-17 https://scifaro.com/en/abs/query-learning-of-advice-and-nominal-automata-2409.108222024-09-18 https://scifaro.com/en/abs/declarative-integration-and-management-of-large-language-models-through-finite-automata-application-to-automation-communication-and-ethics-2409.136932024-09-24 https://scifaro.com/en/abs/formal-verification-of-higher-dimensional-quantum-protocols-2409.179802024-09-27 https://scifaro.com/en/abs/self-replicating-mechanical-universal-turing-machine-2409.190372024-10-01 https://scifaro.com/en/abs/completely-reachable-almost-group-automata-2409.191722024-10-01 https://scifaro.com/en/abs/conway-s-cosmological-theorem-and-automata-theory-2409.203412025-11-24 https://scifaro.com/en/abs/the-complexity-of-separability-for-semilinear-sets-and-parikh-automata-2410.005482025-07-02 https://scifaro.com/en/abs/from-ltl-to-cocoa-without-detours-2410.010212025-08-27 https://scifaro.com/en/abs/a-complete-formalization-of-fermat-s-last-theorem-for-regular-primes-in-lean-2410.014662025-06-16 https://scifaro.com/en/abs/active-learning-of-deterministic-transducers-with-outputs-in-arbitrary-monoids-2410.015902025-10-15 https://scifaro.com/en/abs/execution-time-opacity-problems-in-one-clock-parametric-timed-automata-2410.016592024-10-03 https://scifaro.com/en/abs/a-myhill-nerode-style-characterization-for-timed-automata-with-integer-resets-2410.024642024-10-04 https://scifaro.com/en/abs/non-deterministic-asynchronous-automata-games-and-their-undecidability-2410.044202024-10-18 https://scifaro.com/en/abs/on-the-complexity-of-computing-the-co-lexicographic-width-of-a-regular-language-2410.047712024-10-08 https://scifaro.com/en/abs/maximal-length-cellular-automata-a-survey-2410.059472024-10-10 https://scifaro.com/en/abs/lr-parsing-of-permutation-phrases-2410.067692024-10-10 https://scifaro.com/en/abs/subsequence-matching-and-analysis-problems-for-formal-languages-2410.079922024-10-11 https://scifaro.com/en/abs/opacity-enforcement-by-edit-functions-under-incomparable-observations-2410.084712025-05-12 https://scifaro.com/en/abs/synthesis-from-ltl-with-reward-optimization-in-sampled-oblivious-environments-2410.085992024-10-14 https://scifaro.com/en/abs/motion-planning-for-automata-based-objectives-using-efficient-gradient-based-methods-2410.111562024-10-16 https://scifaro.com/en/abs/kamp-theorem-for-pomset-languages-of-higher-dimensional-automata-2410.124932025-12-10 https://scifaro.com/en/abs/algebraic-language-theory-with-effects-2410.125692025-05-06 https://scifaro.com/en/abs/computing-measures-of-weak-mso-definable-sets-of-trees-2410.134792025-12-22 https://scifaro.com/en/abs/a-uniform-framework-for-problems-on-context-free-grammars-2410.193862024-10-28 https://scifaro.com/en/abs/new-fault-domains-for-conformance-testing-of-finite-state-machines-2410.194052025-06-13 https://scifaro.com/en/abs/automata-size-reduction-by-procedure-finding-2410.202272025-03-18 https://scifaro.com/en/abs/proceedings-fifteenth-international-symposium-on-games-automata-logics-and-formal-verification-2410.218842024-10-30 https://scifaro.com/en/abs/synthesis-of-timeline-based-planning-strategies-avoiding-determinization-2410.227572024-10-31 https://scifaro.com/en/abs/deterministic-suffix-reading-automata-2410.227612024-10-31 https://scifaro.com/en/abs/two-way-one-counter-nets-revisited-2410.228452024-11-19 https://scifaro.com/en/abs/explorable-parity-automata-2410.231872025-11-26 https://scifaro.com/en/abs/tracer-a-tool-for-race-detection-in-software-defined-network-models-2410.237632024-11-01 https://scifaro.com/en/abs/static-analysis-framework-for-detecting-use-after-free-bugs-in-c-2410.237642024-11-01 https://scifaro.com/en/abs/decidability-issues-for-petri-nets-a-survey-2411.015922024-11-05 https://scifaro.com/en/abs/reachability-in-one-dimensional-pushdown-vector-addition-systems-is-decidable-2411.023862024-11-05 https://scifaro.com/en/abs/equivalence-of-deterministic-weighted-real-time-one-counter-automata-2411.030662024-11-19 https://scifaro.com/en/abs/hybrid-rebeca-revisited-2411.031602025-03-11 https://scifaro.com/en/abs/topoi-of-automata-i-four-topoi-of-automata-and-regular-languages-2411.063582024-11-19 https://scifaro.com/en/abs/the-equivalence-problem-of-e-pattern-languages-with-length-constraints-is-undecidable-2411.069042025-03-03 https://scifaro.com/en/abs/the-equivalence-problem-of-e-pattern-languages-with-regular-constraints-is-undecidable-2411.072752024-11-13 https://scifaro.com/en/abs/vulnerabilities-analysis-and-secure-controlling-for-unmanned-aerial-system-based-on-reactive-synthesis-2411.077412025-01-03 https://scifaro.com/en/abs/the-word-problem-for-omega-1-terms-over-mathrm-dab-2411.085232024-11-15 https://scifaro.com/en/abs/learning-real-time-one-counter-automata-using-polynomially-many-queries-2411.088152025-03-11 https://scifaro.com/en/abs/learning-quantitative-automata-modulo-theories-2411.106012024-11-19 https://scifaro.com/en/abs/proceedings-combined-31st-international-workshop-on-expressiveness-in-concurrency-and-21st-workshop-on-structural-operational-semantics-2411.133182024-11-21 https://scifaro.com/en/abs/complete-test-suites-for-automata-in-monoidal-closed-categories-2411.134122025-03-18 https://scifaro.com/en/abs/a-hierarchy-of-reversible-finite-automata-2411.145382024-11-25 https://scifaro.com/en/abs/synchronisability-in-mailbox-communication-2411.145802024-11-25 https://scifaro.com/en/abs/on-computational-completeness-of-semi-conditional-matrix-grammars-2411.153382024-11-26 https://scifaro.com/en/abs/temporally-non-uniform-cellular-automata-surjectivity-reversibility-and-cyclic-behavior-2411.174212026-03-24 https://scifaro.com/en/abs/nondeterministic-tree-walking-automata-are-not-closed-under-complementation-2412.026182024-12-04 https://scifaro.com/en/abs/responsibility-in-actor-based-systems-2412.051622024-12-09 https://scifaro.com/en/abs/probabilistic-finite-automaton-emptiness-is-undecidable-for-a-fixed-automaton-2412.051982024-12-09 https://scifaro.com/en/abs/digging-for-decision-trees-a-case-study-in-strategy-sampling-and-learning-2412.054762024-12-10 https://scifaro.com/en/abs/a-lower-bound-on-the-state-complexity-of-transforming-two-way-nondeterministic-finite-automata-to-unambiguous-finite-automata-2412.062832024-12-10 https://scifaro.com/en/abs/congruence-based-learning-of-probabilistic-deterministic-finite-automata-2412.097602024-12-16 https://scifaro.com/en/abs/the-black-ninjas-and-the-sniper-on-robustness-of-population-protocols-2412.117832024-12-17 https://scifaro.com/en/abs/reachability-in-vector-addition-system-with-states-parameterized-by-geometric-dimension-2412.146082024-12-20 https://scifaro.com/en/abs/checking-timed-bisimilarity-with-virtual-clocks-2412.157992026-04-01 https://scifaro.com/en/abs/on-the-piecewise-complexity-of-words-2412.165602024-12-24 https://scifaro.com/en/abs/the-tractability-border-of-reachability-in-simple-vector-addition-systems-with-states-2412.166122024-12-24 https://scifaro.com/en/abs/mostowski-index-via-extended-register-games-2412.167932024-12-24 https://scifaro.com/en/abs/extended-ctg-generalization-and-dynamic-adjustment-of-generalization-strategies-in-ic3-2501.024802025-01-10 https://scifaro.com/en/abs/asynchronism-in-cellular-automata-2501.025782025-01-07 https://scifaro.com/en/abs/active-learning-techniques-for-pomset-recognizers-2501.039142026-01-21 https://scifaro.com/en/abs/an-automata-based-method-to-formalize-psychological-theories-the-case-study-of-lazarus-and-folkman-s-stress-theory-2501.051852025-01-10 https://scifaro.com/en/abs/well-quasi-orderings-on-word-languages-2501.074282025-01-14 https://scifaro.com/en/abs/uniform-membership-for-hyperedge-replacement-grammars-and-related-decision-problems-2501.080822026-03-03 https://scifaro.com/en/abs/mining-diamonds-in-labeled-transition-systems-2501.086892025-05-01 https://scifaro.com/en/abs/the-structure-of-polynomial-growth-for-tree-automata-transducers-and-mso-set-queries-2501.102702026-01-07 https://scifaro.com/en/abs/history-deterministic-parity-automata-games-complexity-and-the-2-token-theorem-2501.123022026-05-28 https://scifaro.com/en/abs/fine-grained-complexity-of-ambiguity-problems-on-automata-and-directed-graphs-2501.147252025-07-22 https://scifaro.com/en/abs/the-alternation-hierarchy-of-first-order-logic-on-words-is-decidable-2501.148992025-02-03 https://scifaro.com/en/abs/a-polynomial-time-algorithm-for-the-automatic-baire-property-2501.151922026-05-05 https://scifaro.com/en/abs/automating-the-analysis-of-quantitative-automata-with-quak-2501.160882025-01-28 https://scifaro.com/en/abs/what-is-formal-verification-without-specifications-a-survey-on-mining-ltl-specifications-2501.162742025-01-28 https://scifaro.com/en/abs/model-checking-for-multi-agent-systems-modeled-by-epistemic-process-calculus-2501.181552025-01-31 https://scifaro.com/en/abs/cerny-type-automata-and-rank-conjecture-2501.191662025-02-03 https://scifaro.com/en/abs/an-experimental-mathematics-approach-to-stolarsky-interspersions-via-automata-theory-2502.033122025-02-06 https://scifaro.com/en/abs/universality-frontier-for-asynchronous-cellular-automata-2502.059892025-10-20 https://scifaro.com/en/abs/recognizing-numbers-2502.073142025-02-12 https://scifaro.com/en/abs/pumping-like-results-for-copyless-cost-register-automata-and-polynomially-ambiguous-weighted-automata-2502.073562026-01-13 https://scifaro.com/en/abs/reachability-and-related-problems-in-vector-addition-systems-with-nested-zero-tests-2502.076602025-05-20 https://scifaro.com/en/abs/on-constructing-finite-automata-by-relational-programming-2502.080402025-02-13 https://scifaro.com/en/abs/the-queue-automaton-revisited-2502.083452025-02-13 https://scifaro.com/en/abs/equality-of-cycle-lengths-in-one-and-two-dimensional-sigma-automata-2502.108982026-02-24 https://scifaro.com/en/abs/reachability-in-trace-pushdown-systems-2502.116302025-02-18 https://scifaro.com/en/abs/learning-automata-with-name-allocation-2502.119472026-03-27 https://scifaro.com/en/abs/the-agafonov-and-schnorr-stimm-theorems-for-probabilistic-automata-2502.123072025-02-19 https://scifaro.com/en/abs/resolving-nondeterminism-with-randomness-2502.128722026-05-29 https://scifaro.com/en/abs/two-way-affine-automata-can-verify-every-language-2502.128792025-02-19 https://scifaro.com/en/abs/the-ric3-hardware-model-checker-2502.136052025-05-22 https://scifaro.com/en/abs/reachability-in-3-vass-is-elementary-2502.139162025-04-29 https://scifaro.com/en/abs/counting-abstraction-for-the-verification-of-structured-parameterized-networks-2502.153912025-02-24 https://scifaro.com/en/abs/you-may-delay-but-time-will-not-timed-games-under-delayed-control-2502.189722025-02-27 https://scifaro.com/en/abs/mapping-words-to-powers-by-morphisms-2503.009602025-03-04 https://scifaro.com/en/abs/lexicographic-transductions-of-finite-words-2503.017462025-03-04 https://scifaro.com/en/abs/on-decidability-timed-automata-with-2-parametric-clocks-2503.043742025-03-07 https://scifaro.com/en/abs/soundness-of-reset-workflow-nets-2503.044402025-03-07 https://scifaro.com/en/abs/learning-deterministic-one-counter-automata-in-polynomial-time-2503.045252025-03-07 https://scifaro.com/en/abs/random-testing-of-model-checkers-for-timed-automata-with-automated-oracle-generation-2503.045892025-03-07 https://scifaro.com/en/abs/efficient-analysis-of-polynomial-asymptotic-estimates-for-vass-mdps-2503.050062025-03-10 https://scifaro.com/en/abs/higher-dimensional-automata-extension-to-infinite-tracks-2503.078812026-01-27 https://scifaro.com/en/abs/rerailing-automata-2503.084382025-03-12 https://scifaro.com/en/abs/contract-based-program-models-for-software-model-checking-2503.112362025-03-17 https://scifaro.com/en/abs/omega-regular-robustness-2503.126312025-05-13 https://scifaro.com/en/abs/simplifying-ltl-model-checking-given-prior-knowledge-2503.168912025-03-31 https://scifaro.com/en/abs/behaviorally-correct-learning-from-informants-2503.175722025-03-25 https://scifaro.com/en/abs/conservative-perception-models-for-probabilistic-verification-2503.180772025-07-30 https://scifaro.com/en/abs/polyregular-model-checking-2503.185142025-05-16 https://scifaro.com/en/abs/k-universality-of-regular-languages-revisited-2503.186112025-03-25 https://scifaro.com/en/abs/grappare-a-tool-for-efficient-graph-recognition-based-on-finite-automata-and-regular-expressions-2503.204672025-03-27 https://scifaro.com/en/abs/when-is-a-bottom-up-deterministic-tree-translation-top-down-deterministic-2503.213292025-03-28 https://scifaro.com/en/abs/rethinking-meaning-and-ontologies-from-the-perspective-of-ontological-units-2503.216612025-08-29 https://scifaro.com/en/abs/the-commutativity-problem-for-effective-varieties-of-formal-series-and-applications-2503.216972025-05-19 https://scifaro.com/en/abs/algorithmic-analysis-of-systems-with-affine-input-and-polynomial-state-2503.225582025-04-01 https://scifaro.com/en/abs/a-sharper-upper-bound-for-the-separating-words-problem-2503.231842025-04-03 https://scifaro.com/en/abs/determinization-of-min-plus-weighted-automata-is-decidable-2503.238262025-04-01 https://scifaro.com/en/abs/the-2-token-theorem-recognising-history-deterministic-parity-automata-efficiently-2503.242442026-05-28 https://scifaro.com/en/abs/gol-in-gol-in-hol-verified-circuits-in-conway-s-game-of-life-2504.002632025-04-02 https://scifaro.com/en/abs/input-erasing-two-way-finite-automata-2504.017202025-04-03 https://scifaro.com/en/abs/example-free-learning-of-regular-languages-with-prefix-queries-2504.021702025-04-04 https://scifaro.com/en/abs/semiflows-home-spaces-and-home-states-applications-to-the-analysis-of-parameterized-petri-nets-2504.034772025-11-13 https://scifaro.com/en/abs/on-the-equivalence-checking-problem-for-deterministic-top-down-tree-automata-2504.042062025-04-08 https://scifaro.com/en/abs/learning-verified-monitors-for-hidden-markov-models-2504.059632025-09-22 https://scifaro.com/en/abs/thin-coalgebraic-behaviours-are-inductive-2504.070132025-06-09 https://scifaro.com/en/abs/certified-symbolic-finite-transducers-formalization-and-applications-to-string-analysis-2504.072032025-09-16 https://scifaro.com/en/abs/undecidability-of-the-emptiness-problem-for-weak-models-of-distributed-computing-2504.073392025-04-11 https://scifaro.com/en/abs/languages-of-boundedly-ambiguous-vector-addition-systems-with-states-2504.076692025-09-16 https://scifaro.com/en/abs/nondeterminism-makes-unary-1-limited-automata-concise-2504.084642025-05-01 https://scifaro.com/en/abs/time-for-timed-monitorability-2504.100082025-10-02 https://scifaro.com/en/abs/resolving-nondeterminism-by-chance-2504.102342026-04-01 https://scifaro.com/en/abs/automata-for-the-commutative-closure-of-regular-sets-2504.108642025-04-16 https://scifaro.com/en/abs/a-formalization-of-co-transcriptional-splicing-as-an-operation-on-formal-languages-2504.133542025-06-19 https://scifaro.com/en/abs/effective-computation-of-generalized-abelian-complexity-for-pisot-type-substitutive-sequences-2504.135842025-04-23 https://scifaro.com/en/abs/the-complexity-of-reachability-problems-in-strongly-connected-finite-automata-2504.137842025-07-25 https://scifaro.com/en/abs/synthesising-asynchronous-automata-from-fair-specifications-2504.146232026-02-02 https://scifaro.com/en/abs/a-new-graph-grammar-formalism-for-robust-syntactic-pattern-recognition-2504.159752025-04-25 https://scifaro.com/en/abs/learning-weighted-automata-over-number-rings-concretely-and-categorically-2504.165962025-10-14 https://scifaro.com/en/abs/density-of-rational-languages-under-shift-invariant-measures-2504.167082025-08-08 https://scifaro.com/en/abs/using-games-and-universal-trees-to-characterise-the-nondeterministic-index-of-tree-languages-2504.168192025-04-30 https://scifaro.com/en/abs/approximate-problems-for-finite-transducers-2504.172992025-04-25 https://scifaro.com/en/abs/morphisms-and-bwt-run-sensitivity-2504.174432025-04-25 https://scifaro.com/en/abs/dynamic-membership-for-regular-tree-languages-2504.175362025-08-21 https://scifaro.com/en/abs/efficient-matching-of-some-fundamental-regular-expressions-with-backreferences-2504.182472025-07-03 https://scifaro.com/en/abs/clustering-of-return-words-in-languages-of-interval-exchanges-2504.182802025-04-28 https://scifaro.com/en/abs/universally-wheeler-languages-2504.195372025-04-29 https://scifaro.com/en/abs/partial-answer-of-how-transformers-learn-automata-2504.203952025-05-13 https://scifaro.com/en/abs/characterizing-the-polynomial-time-minimizable-omega-automata-2504.205532025-04-30 https://scifaro.com/en/abs/from-regular-expressions-to-deterministic-finite-automata-2-frac-n-2-sqrt-n-log-n-theta-1-states-are-necessary-and-sufficient-2504.205552025-04-30 https://scifaro.com/en/abs/statistical-process-discovery-2504.213902025-05-01 https://scifaro.com/en/abs/active-learning-of-upward-closed-sets-of-words-2504.214292025-07-30 https://scifaro.com/en/abs/verifying-parameterized-networks-specified-by-vertex-replacement-graph-grammars-2505.012692025-05-05 https://scifaro.com/en/abs/focuse-a-semantic-extension-of-focusst-2505.090322025-05-15 https://scifaro.com/en/abs/deterministic-suffix-reading-automata-2505.093532026-05-13 https://scifaro.com/en/abs/deconstructing-subset-construction-reducing-while-determinizing-2505.103192026-04-14 https://scifaro.com/en/abs/b-uchi-elgot-trakhtenbrot-theorem-for-higher-dimensional-automata-2505.104612025-05-16