Výsledky vyhľadávania - "Theory of computation Formal languages and automata theory"

A Bit of Nondeterminism Makes Pushdown Automata Expressive and Succinct

Autori: Guha, Shibashis Jecker, Ismaël Lehtinen, Karoliina a ďalší

Prispievatelia: Guha, Shibashis Jecker, Ismaël Lehtinen, Karoliina a ďalší

Zdroj: Logical Methods in Computer Science, Vol Volume 20, Issue 1 (2024)
Guha, S, Jecker, I, Lehtinen, K & Zimmermann, M 2024, 'A bit of nondeterminism makes pushdown automata expressive and succinct', Logical Methods in Computer Science, vol. 20, no. 1, 39, pp. 3:1–3:39. https://doi.org/10.46298/lmcs-20(1:3)2024
46th International Symposium on Mathematical Foundations of Computer Science

Predmety: FOS: Computer and information sciences, Computer Science - Logic in Computer Science, Logic, Formal Languages and Automata Theory (cs.FL), Computer Science - Formal Languages and Automata Theory, Pushdown Automata, Succintness, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, 12. Responsible consumption, computer science - logic in computer science, Synthesis, 0202 electrical engineering, electronic engineering, information engineering, 14. Life underwater, Formal Languages and Automata Theory, Computer Science, BC1-199, Logic in Computer Science, Theory of computation → Formal languages and automata theory, 4. Education, QA75.5-76.95, Good-for-games, Logic in Computer Science (cs.LO), computer science - formal languages and automata theory, Electronic computers. Computer science, Computer Science, ddc:004

Popis súboru: application/pdf

Prístupová URL adresa: http://arxiv.org/abs/2105.02611
https://lmcs.episciences.org/10156
https://doi.org/10.46298/lmcs-20(1:3)2024
http://livrepository.liverpool.ac.uk/3130035/1/2105.02611v1.pdf
https://doaj.org/article/03ee626ded51408a95e4d810f7c4816d
http://www.scopus.com/inward/record.url?scp=85186488986&partnerID=8YFLogxK
https://vbn.aau.dk/ws/files/749985196/2105.02611.pdf
https://doi.org/10.46298/lmcs-20(1:3)2024
https://vbn.aau.dk/da/publications/a389c202-828c-4303-877b-5eebb7556241
https://drops.dagstuhl.de/opus/volltexte/2021/14493/
https://livrepository.liverpool.ac.uk/id/eprint/3130035
https://drops.dagstuhl.de/opus/volltexte/2021/14493/pdf/LIPIcs-MFCS-2021-53.pdf/
https://dblp.uni-trier.de/db/journals/corr/corr2105.html#abs-2105-02611
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2021.53

FO logic on cellular automata orbits equals MSO logic

Autori: Theyssier, Guillaume Guillaume Theyssier

Prispievatelia: Theyssier, Guillaume Guillaume Theyssier

Predmety: FO logic, FOS: Computer and information sciences, Computer Science - Logic in Computer Science, Theory of computation → Models of computation, [INFO.INFO-LO] Computer Science [cs]/Logic in Computer Science [cs.LO], Discrete Mathematics (cs.DM), Theory of computation → Formal languages and automata theory, cellular automata, [MATH.MATH-DS] Mathematics [math]/Dynamical Systems [math.DS], Cayley Graphs, MSO logic, Cellular Automata, Dynamical Systems (math.DS), Theory of computation → Logic, Cayley graphs, Logic in Computer Science (cs.LO), Domino Problem, [INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM], domino problem, FOS: Mathematics, ddc:004, Mathematics - Dynamical Systems, Computer Science - Discrete Mathematics

Popis súboru: application/pdf

Prístupová URL adresa: http://arxiv.org/abs/2404.16430
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.154
https://hal.science/hal-04558369v1
https://hal.science/hal-04558369v1/document
https://doi.org/10.4230/lipics.icalp.2024.154
https://hal.science/hal-04785124v1
https://doi.org/10.4230/lipics.icalp.2024.154

LIPIcs, Volume 289, STACS 2024, Complete Volume: 41st International Symposium on Theoretical Aspects of Computer Science (STACS 2024)

Autori: Beyersdorff, Olaf Kanté, Mamadou Moustapha Kupferman, Orna a ďalší

Prispievatelia: Beyersdorff, Olaf Kanté, Mamadou Moustapha Kupferman, Orna a ďalší

Predmety: Theory of computation → Models of computation, Mathematics of computing → Graph theory, STACS 2024, Theory of computation → Design and analysis of algorithms, Theory of computation → Formal languages and automata theory, Complete Volume, [INFO] Computer Science [cs], Volume 289, Theory of computation → Computational complexity and cryptography, Mathematics of computing → Combinatorics, Theory of computation → Logic, LIPIcs

Prístupová URL adresa: https://hal.science/hal-04859229v1

Agafonov's theorem for probabilistic selectors

Autori: Léchine, Ulysse Seiller, Thomas Simonsen, Jakob Grue a ďalší

Prispievatelia: Léchine, Ulysse Seiller, Thomas Simonsen, Jakob Grue a ďalší

Zdroj: Leibniz International Proceedings in Informatics (LIPIcs) ; Mathematical Foundations of Computer Science ; https://hal.science/hal-04563952 ; Mathematical Foundations of Computer Science, Aug 2024, Bratislava, Slovakia. pp.67:1-67:15, ⟨10.4230/LIPIcs.MFCS.2024.67⟩

Predmety: Normal Sequences, Probabilistic Automata, Agafonov's Theorem, Agafonov’s theorem, Theory of computation → Formal languages and automata theory, Theory of computation → Probabilistic computation, Theory of computation → Randomness, geometry and discrete structures, [INFO.INFO-FL]Computer Science [cs]/Formal Languages and Automata Theory [cs.FL], [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], [MATH.MATH-PR]Mathematics [math]/Probability [math.PR]

Geografické téma: Bratislava, Slovakia

Dostupnosť: https://hal.science/hal-04563952
https://hal.science/hal-04563952v1/document
https://hal.science/hal-04563952v1/file/Probabilistic__Automata_for__Agafonov-6.pdf
https://doi.org/10.4230/LIPIcs.MFCS.2024.67

Closure Properties of General Grammars -- Formally Verified

Autori: Dvorak, Martin Blanchette, Jasmin Martin Dvorak and Jasmin Blanchette

Prispievatelia: Dvorak, Martin Blanchette, Jasmin Martin Dvorak and Jasmin Blanchette

Predmety: FOS: Computer and information sciences, 2012 ACM Subject Classification Theory of computation → Formal languages and automata theory phrases Lean type-0 grammars recursively enumerable languages Kleene star, Formal Languages and Automata Theory (cs.FL), Computer Science - Formal Languages and Automata Theory, 02 engineering and technology, [INFO] Computer Science [cs], 2012 ACM Subject Classification Theory of computation → Formal languages and automata theory phrases Lean, recursively enumerable languages, 0202 electrical engineering, electronic engineering, information engineering, Lean, Kleene star, ddc:004, Theory of computation → Rewrite systems, type-0 grammars

Popis súboru: application/pdf

Prístupová URL adresa: http://arxiv.org/abs/2302.06420
https://inria.hal.science/hal-04298533v1/document
https://doi.org/10.4230/lipics.itp.2023.15
https://inria.hal.science/hal-04298533v1
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITP.2023.15

Safety Analysis of Parameterised Networks with Non-Blocking Rendez-Vous

Autori: Guillou, Lucie Sangnier, Arnaud Sznajder, Nathalie a ďalší

Prispievatelia: Guillou, Lucie Sangnier, Arnaud Sznajder, Nathalie a ďalší

Predmety: FOS: Computer and information sciences, Computer Science - Logic in Computer Science, Parameterised verification, Theory of computation → Formal languages and automata theory, [INFO] Computer Science [cs], C.2.4, F.4.3, Logic in Computer Science (cs.LO), Counter machines, Coverability, Computer Science - Multiagent Systems, ddc:004, Multiagent Systems (cs.MA)

Popis súboru: application/pdf

Prístupová URL adresa: http://arxiv.org/abs/2307.04546
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2023.7
https://hal.sorbonne-universite.fr/hal-04286027v1
https://doi.org/10.4230/lipics.concur.2023.7
https://hal.sorbonne-universite.fr/hal-04286027v1/document

LIPIcs, Volume 254, STACS 2023, Complete Volume

Autori: Berenbrink, Petra Bouyer, Patricia Dawar, Anuj a ďalší

Prispievatelia: Berenbrink, Petra Bouyer, Patricia Dawar, Anuj a ďalší

Predmety: Theory of computation → Models of computation, Mathematics of computing → Graph theory, Theory of computation → Formal languages and automata theory, Theory of computation → Design and analysis of algorithms, [INFO] Computer Science [cs], Mathematics of computing → Combinatorics, Theory of computation → Logic, LIPIcs, Volume 254, STACS 2023, Complete Volume, STACS 2023, Complete Volume, ddc:004, Theory of computation → Computational complexity and cryptography, Volume 254, LIPIcs

Popis súboru: application/pdf

Prístupová URL adresa: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2023
https://hal.science/hal-04859252v1
https://doi.org/10.4230/lipics.stacs.2023

Regular Methods for Operator Precedence Languages

Autori: Henzinger, Thomas A. Kebis, Pavol Mazzocchi, Nicolas a ďalší

Prispievatelia: Henzinger, Thomas A. Kebis, Pavol Mazzocchi, Nicolas a ďalší

Zdroj: Schloss Dagstuhl-Leibniz-Zentrum für Informatik

Predmety: FOS: Computer and information sciences, antichain algorithm, Formal Languages and Automata Theory (cs.FL), Theory of computation → Formal languages and automata theory, operator precedence automata, Computer Science - Formal Languages and Automata Theory, ddc:004, syntactic congruence

Popis súboru: application/pdf

Prístupová URL adresa: http://arxiv.org/abs/2305.03447
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.129

History-Deterministic Parikh Automata

Autori: Erlich, Enzo Guha, Shibashis Jecker, Ismaël a ďalší

Prispievatelia: Erlich, Enzo Guha, Shibashis Jecker, Ismaël a ďalší

Zdroj: Erlich, E, Guha, S, Jecker, I, Lehtinen, K & Zimmermann, M 2023, History-Deterministic Parikh Automata. in G A Perez & J-F Raskin (eds), 34th International Conference on Concurrency Theory, CONCUR 2023. vol. 279, 31, Schloss Dagstuhl-Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, Leibniz International Proceedings in Informatics, pp. 31:1-31:16, 34th International Conference on Concurrency Theory (CONCUR 2023), Antwerpen, Belgium, 18/09/2023. https://doi.org/10.4230/LIPICS.CONCUR.2023.31

Predmety: Reversal-bounded Counter Machines, Theory of computation → Formal languages and automata theory, Parikh automata, [INFO] Computer Science [cs], ddc:004, History-determinism

Popis súboru: application/pdf; text/html; charset=utf-8

Prístupová URL adresa: http://www.scopus.com/inward/record.url?scp=85167928574&partnerID=8YFLogxK
https://vbn.aau.dk/ws/files/679672473/LIPIcs.CONCUR.2023.31.pdf
https://vbn.aau.dk/da/publications/adb27469-8f2b-45e2-9286-2c07658ba075
https://dblp.org/rec/conf/concur/ErlichGJL023
https://doi.org/10.4230/LIPICS.CONCUR.2023.31
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2023.31
https://hal.science/hal-04222543v1/document
https://hal.science/hal-04222543v1
https://doi.org/10.4230/lipics.concur.2023.31

Explorable Automata

Autori: Hazard, Emile Kuperberg, Denis Emile Hazard and Denis Kuperberg a ďalší

Prispievatelia: Hazard, Emile Kuperberg, Denis Emile Hazard and Denis Kuperberg a ďalší

Predmety: automata, Theory of computation → Formal languages and automata theory, Nondeterminism, ddc:004, complexity, [INFO.INFO-FL] Computer Science [cs]/Formal Languages and Automata Theory [cs.FL]

Popis súboru: application/pdf

Prístupová URL adresa: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2023.24
https://hal.science/hal-03669659v2/document
https://hal.science/hal-03669659v2
https://doi.org/10.4230/lipics.csl.2023.24

Enumerating Regular Languages with Bounded Delay

Autori: Amarilli, Antoine Monet, Mikaël Data, Intelligence and Graphs (DIG) a ďalší

Prispievatelia: Amarilli, Antoine Monet, Mikaël Data, Intelligence and Graphs (DIG) a ďalší

Zdroj: STACS ; https://hal.science/hal-03940590 ; STACS, Mar 2023, Hamburg, Germany. ⟨10.4230/LIPIcs.STACS.2023.8⟩

Predmety: Regular language, Constant-delay enumeration, Edit distance, Theory of computation → Formal languages and automata theory, [INFO]Computer Science [cs]

Geografické téma: Hamburg, Germany

Relation: info:eu-repo/semantics/altIdentifier/arxiv/2209.14878; ARXIV: 2209.14878

Dostupnosť: https://hal.science/hal-03940590
https://hal.science/hal-03940590v1/document
https://hal.science/hal-03940590v1/file/enumerating.pdf
https://doi.org/10.4230/LIPIcs.STACS.2023.8

Getting to the CORE of Complex Event Recognition (Invited Talk)

Autori: VANSUMMEREN, Stijn Vansummeren, Stijn

Prispievatelia: VANSUMMEREN, Stijn Vansummeren, Stijn

Predmety: Complex Event Recognition, automata, enumeration-based query processing, Information systems → Query languages for non-relational engines, Information systems → Stream management, Theory of computation → Formal languages and automata theory

Popis súboru: application/pdf

Relation: Leibniz International Proceedings in Informatics (LIPIcs); 29; 247; http://hdl.handle.net/1942/39427; 3:2; 3:1; https://drops.dagstuhl.de/opus/volltexte/2022/17250/

Dostupnosť: http://hdl.handle.net/1942/39427
https://doi.org/10.4230/LIPIcs.TIME.2022.3
https://drops.dagstuhl.de/opus/volltexte/2022/17250/

On the Monitoring of Decentralized Specifications: Semantics, Properties, Analysis, and Simulation

Autori: El-Hokayem, Antoine Falcone, Yliès VERIMAG (VERIMAG - IMAG) a ďalší

Prispievatelia: El-Hokayem, Antoine Falcone, Yliès VERIMAG (VERIMAG - IMAG) a ďalší

Zdroj: ACM Transactions on Software Engineering and Methodology. 29:1-57

Predmety: FOS: Computer and information sciences, Monitoring, Formal Languages and Automata Theory (cs.FL), [INFO.INFO-SE] Computer Science [cs]/Software Engineering [cs.SE], Runtime Verification, Computer Science - Formal Languages and Automata Theory, [INFO.INFO-SE]Computer Science [cs]/Software Engineering [cs.SE], 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Automata, Computer Science - Software Engineering, • Theory of computation → Formal languages and automata theory, Data structures design and analysis, Computer Science - Data Structures and Algorithms, 0202 electrical engineering, electronic engineering, information engineering, • Computing methodologies → Simulation tools, Data Structures and Algorithms (cs.DS), CCS Concepts: • Software and its engineering → Software verification, [INFO.INFO-ES] Computer Science [cs]/Embedded Systems, Software Engineering (cs.SE), Decentralized Monitoring, Eventual Consistency, [INFO.INFO-ES]Computer Science [cs]/Embedded Systems, Simulation

Popis súboru: application/pdf

Prístupová URL adresa: https://hal.archives-ouvertes.fr/hal-01653725/file/themis.pdf
http://arxiv.org/abs/1808.02692
https://hal.science/hal-02283429v2
https://dl.acm.org/doi/10.1145/3355181
https://hal.archives-ouvertes.fr/hal-02283429v2
https://hal.inria.fr/hal-02283429
https://dblp.uni-trier.de/db/journals/tosem/tosem29.html#El-HokayemF20
http://ui.adsabs.harvard.edu/abs/2018arXiv180802692E/abstract
https://hal.archives-ouvertes.fr/hal-02283429/document

enOn Rational Recursive Sequences

Autori: Clemente, Lorenzo Donten-Bury, Maria Mazowiecki, Filip a ďalší

Prispievatelia: Clemente, Lorenzo Donten-Bury, Maria Mazowiecki, Filip a ďalší

Predmety: Theory of computation → Formal languages and automata theory, equivalence problem, zeroness problem, recursive sequences, polynomial automata

The True Colors of Memory: A Tour of Chromatic-Memory Strategies in Zero-Sum Games on Graphs (Invited Talk)

Autori: Bouyer, Patricia Randour, Mickael Vandenhove, Pierre a ďalší

Prispievatelia: Bouyer, Patricia Randour, Mickael Vandenhove, Pierre a ďalší

Zdroj: 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science
FSTTCS'22
https://centralesupelec.hal.science/hal-04236273
FSTTCS'22, Dec 2022, Chennai (India), France. pp.3:1--3:18, ⟨10.4230/LIPIcs.FSTTCS.2022.3⟩

Predmety: Theory of computation → Formal languages and automata theory, ω-regularity, parity automata, chromatic memory, finite-memory strategies, two-player games on graphs, [INFO.INFO-GT]Computer Science [cs]/Computer Science and Game Theory [cs.GT], [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO], [INFO.INFO-FL]Computer Science [cs]/Formal Languages and Automata Theory [cs.FL]

Geografické téma: Chennai (India), France

Dostupnosť: https://centralesupelec.hal.science/hal-04236273
https://centralesupelec.hal.science/hal-04236273v1/document
https://centralesupelec.hal.science/hal-04236273v1/file/mainFSTTCS.pdf
https://doi.org/10.4230/LIPIcs.FSTTCS.2022.3

Powerset-Like Monads Weakly Distribute over Themselves in Toposes and Compact Hausdorff Spaces

Autori: Goy, Alexandre Petrişan, Daniela Aiguier, Marc a ďalší

Prispievatelia: Goy, Alexandre Petrişan, Daniela Aiguier, Marc a ďalší

Zdroj: 48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)
https://hal.science/hal-04491472
48th International Colloquium on Automata, Languages, and Programming (ICALP 2021), Jul 2022, Glasgow (SCOTLAND), France. ⟨10.4230/LIPIcs.ICALP.2021.132⟩

Predmety: Egli-Milner relation, weak extension, weak distributive law, weak lifting, powerset monad, Vietoris monad, topos, alternating automaton, generalized determinization, Theory of computation → Formal languages and automata theory, [INFO]Computer Science [cs], [MATH]Mathematics [math]

Geografické téma: Glasgow (SCOTLAND), France

Dostupnosť: https://hal.science/hal-04491472
https://hal.science/hal-04491472v1/document
https://hal.science/hal-04491472v1/file/LIPIcs.ICALP.2021.132_aiguier.pdf
https://doi.org/10.4230/LIPIcs.ICALP.2021.132

Geometry of Reachability sets of Vector Addition Systems

Autori: Guttenberg, Roland Raskin, Mikhail Esparza, Javier a ďalší

Prispievatelia: Guttenberg, Roland Raskin, Mikhail Esparza, Javier a ďalší

Predmety: FOS: Computer and information sciences, Computer Science - Logic in Computer Science, Formal Languages and Automata Theory (cs.FL), Theory of computation → Formal languages and automata theory, Geometry, Computer Science - Formal Languages and Automata Theory, Petri net, 0102 computer and information sciences, 02 engineering and technology, Reachability Set, 01 natural sciences, Logic in Computer Science (cs.LO), Almost hybridlinear, 0202 electrical engineering, electronic engineering, information engineering, ddc:004, Vector Addition System, Partition

Popis súboru: application/pdf

Prístupová URL adresa: http://arxiv.org/abs/2211.02889
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2023.6

Enumerating Regular Languages with Bounded Delay

Autori: Amarilli, Antoine Monet, Mikaël Antoine Amarilli and Mikaël Monet

Prispievatelia: Amarilli, Antoine Monet, Mikaël Antoine Amarilli and Mikaël Monet

Predmety: FOS: Computer and information sciences, Formal Languages and Automata Theory (cs.FL), Edit distance, Theory of computation → Formal languages and automata theory, constant-delay enumeration, Regular language, Computer Science - Formal Languages and Automata Theory, edit distance, 0102 computer and information sciences, [INFO] Computer Science [cs], 01 natural sciences, Constant-delay enumeration, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), ddc:004, 0101 mathematics

Popis súboru: application/pdf

Prístupová URL adresa: http://arxiv.org/abs/2209.14878
https://hal.science/hal-03940590v1/document
https://hal.science/hal-03940590v1
https://doi.org/10.4230/lipics.stacs.2023.8
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2023.8

A Technique to Speed up Symmetric Attractor-Based Algorithms for Parity Games

Autori: Thejaswini, K. S. Ohlmann, Pierre Jurdziński, Marcin a ďalší

Prispievatelia: Thejaswini, K. S. Ohlmann, Pierre Jurdziński, Marcin a ďalší

Predmety: Quasipolynomial Algorithms, Theory of computation → Formal languages and automata theory, Theory of computation → Design and analysis of algorithms, Parity games, ddc:004, Theory of computation → Logic and verification, Attractor decomposition, Universal trees

Popis súboru: application/pdf

Prístupová URL adresa: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2022.44

enParikh Automata over Infinite Words

Autori: Guha, Shibashis Jecker, Ismaël Lehtinen, Karoliina a ďalší

Prispievatelia: Guha, Shibashis Jecker, Ismaël Lehtinen, Karoliina a ďalší

Predmety: ω-automata, Parikh automata, Theory of computation → Formal languages and automata theory, Infinite Games